IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-642-29210-1_55.html
   My bibliography  Save this book chapter

Harmony Search Algorithms for binary optimization problems

In: Operations Research Proceedings 2011

Author

Listed:
  • Miriam Padberg

Abstract

In many theoretical and empirical investigations heuristic methods are the subject of investigation for optimization problems in order to get good and valid solutions. In 2001 Harmony Search, a new music-inspired meta-heuristic, was introduced [1]. It has been applied to various types of optimization problems, for example structural design problems, showing significant improvements over other heuristics. Motivated by the question whether these heuristics represent a new class of meta-heuristics or whether they are only another representation of a well-known technique, a couple of investigations were made. In this paper we will show that for the class of binary optimization problems this new nature-inspired heuristic is ”equivalent” to an evolutionary algorithm.

Suggested Citation

  • Miriam Padberg, 2012. "Harmony Search Algorithms for binary optimization problems," Operations Research Proceedings, in: Diethard Klatte & Hans-Jakob Lüthi & Karl Schmedders (ed.), Operations Research Proceedings 2011, edition 127, pages 343-348, Springer.
    • Handle: RePEc:spr:oprchp:978-3-642-29210-1_55
    DOI: 10.1007/978-3-642-29210-1_55
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Weyland, Dennis, 2015. "A critical analysis of the harmony search algorithm—How not to solve sudoku," Operations Research Perspectives, Elsevier, vol. 2(C), pages 97-105.

    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:spr:oprchp:978-3-642-29210-1_55. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.