IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-032-00385-0_20.html
   My bibliography  Save this book chapter

Fundamentals of Scatter Search

In: Handbook of Heuristics

Author

Listed:
  • Rafael Martí

    (University of Valencia, Operations Research and Statistics Department, School of Mathematics)

  • José Laguardia

    (Universidad Teconológica de Panamá, Facultad de Ciencias y Tecnología)

  • María Teresa León

    (University of Valencia, Facultat de Ciències Matemàtiques, Departament d’Estadìstica i Investigació Operativa)

Abstract

Scatter search is a population-based metaheuristic that has been shown to yield high-quality outcomes for hard combinatorial optimization problems. It uses strategies for combining solution vectors, making limited use of randomization, that have proved effective in a variety of problem settings. The fundamental concepts and principles were first proposed in the 1960s and 1970s as an extension of mathematical relaxation techniques for combinatorial optimization problems. Its framework is flexible, allowing the development of implementations with varying degrees of sophistication. This chapter provides a grounding in the scatter search methodology that will allow readers to create successful applications of their own. To illustrate this, we present a scatter search implementation for a N P $$\mathcal {N}\mathcal {P}$$ -hard variant of the classic p-hub median problem, for which we describe search elements, mechanisms, and strategies to generate, combine, and improve solutions.

Suggested Citation

  • Rafael Martí & José Laguardia & María Teresa León, 2025. "Fundamentals of Scatter Search," Springer Books, in: Rafael Martí & Panos M. Pardalos & Mauricio G.C. Resende (ed.), Handbook of Heuristics, edition 0, chapter 21, pages 599-625, Springer.
    • Handle: RePEc:spr:sprchp:978-3-032-00385-0_20
    DOI: 10.1007/978-3-032-00385-0_20
    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
    for a similarly titled item that would be available.

    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:sprchp:978-3-032-00385-0_20. 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.