IDEAS home Printed from https://ideas.repec.org/a/igg/jamc00/v1y2010i1p1-15.html
   My bibliography  Save this article

Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity

Author

Listed:
  • Fred Glover

    (OptTek Systems, Inc., USA)

  • Saïd Hanafi

    (Universite de Valenciennes, France)

Abstract

Recent adaptive memory and evolutionary metaheuristics for mixed integer programming have included proposals for introducing inequalities and target objectives to guide the search. These guidance approaches are useful in intensification and diversification strategies related to fixing subsets of variables at particular values, and in strategies that use linear programming to generate trial solutions whose variables are induced to receive integer values. In Part I (the present paper), we show how to improve such approaches by new inequalities that dominate those previously proposed and by associated target objectives that underlie the creation of both inequalities and trial solutions. Part I focuses on exploiting inequalities in target solution strategies by including partial vectors and more general target objectives. We also propose procedures for generating target objectives and solutions by exploiting proximity in original space or projected space. Part II of this study (to appear in a subsequent issue) focuses on supplementary linear programming models that exploit the new inequalities for intensification and diversification, and introduce additional inequalities from sets of elite solutions that enlarge the scope of these models. Part II indicates more advanced approaches for generating the target objective based on exploiting the mutually reinforcing notions of reaction and resistance. Our work in the concluding segment, building on the foundation laid in Part I, examines ways our framework can be exploited in generating target objectives, employing both older adaptive memory ideas of tabu search and newer ones proposed here for the first time.

Suggested Citation

  • Fred Glover & Saïd Hanafi, 2010. "Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity," International Journal of Applied Metaheuristic Computing (IJAMC), IGI Global, vol. 1(1), pages 1-15, January.
  • Handle: RePEc:igg:jamc00:v:1:y:2010:i:1:p:1-15
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jamc.2010102601
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yin, Peng-Yeng & Wu, Tsai-Hung & Hsu, Ping-Yi, 2017. "Risk management of wind farm micro-siting using an enhanced genetic algorithm with simulation optimization," Renewable Energy, Elsevier, vol. 107(C), pages 508-521.
    2. Yin, Peng-Yeng & Wu, Tsai-Hung & Hsu, Ping-Yi, 2017. "Simulation based risk management for multi-objective optimal wind turbine placement using MOEA/D," Energy, Elsevier, vol. 141(C), pages 579-597.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jamc00:v:1:y:2010:i:1:p:1-15. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.