IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v33y2025i2d10.1007_s11750-025-00699-x.html
   My bibliography  Save this article

Iterated local search, iterated greedy and applications

Author

Listed:
  • Helena Ramalhinho

    (Universitat Pompeu Fabra)

  • Thomas Stützle

    (IRIDIA, Université libre de Bruxelles)

Abstract

Iterated local search and iterated greedy are two stochastic local search methods. The first one iterates through perturbation phases and local searches, while the second one iterates through destruction/construction phases and optionally through local searches. The destruction/construction phase in iterated greedy can be consider as a perturbation in iterated local search that leads to many commonalities between these two methods. However, iterated greedy can function without the local search phase. In this article, we review the two methods and detail their main principles. After some experiments with these methods on the permutation flow-shop problem, we review recent applications where these two methods have been successfully employed. We then delve into the historical development of these approaches, which reveals that many methods with different names have been proposed, but they ultimately align with one of these two approaches.

Suggested Citation

  • Helena Ramalhinho & Thomas Stützle, 2025. "Iterated local search, iterated greedy and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 33(2), pages 229-261, July.
    • Handle: RePEc:spr:topjnl:v:33:y:2025:i:2:d:10.1007_s11750-025-00699-x
    DOI: 10.1007/s11750-025-00699-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11750-025-00699-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11750-025-00699-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:topjnl:v:33:y:2025:i:2:d:10.1007_s11750-025-00699-x. 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.