Scatter Search

Manuel Laguna (), Anna Martínez-Gavara () and Rafael Martí ()
Additional contact information
Manuel Laguna: University of Colorado Boulder
Anna Martínez-Gavara: University of Valencia
Rafael Martí: University of Valencia

Chapter Chapter 11 in Discrete Diversity and Dispersion Maximization, 2023, pp 253-269 from Springer

Abstract: Abstract Scatter search (SS) is a population-based metaheuristic introduced in the late 1970s as a heuristic for integer programming problems. The main concepts and principles are based on combining solution vectors, making limited use of randomization. Its flexibility in the development of the implementation has been shown very effective in the resolution of hard optimization problems, leading to high-quality solutions. This chapter provides the framework of the SS methodology, from the broader and more general case to the particular one of the diversity and dispersion problems. Specifically, two different SS designs have been described in detailed to solve a specific dispersion problem, the capacitated dispersion problem.

Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-38310-6_11

Ordering information: This item can be ordered from
http://www.springer.com/9783031383106

DOI: 10.1007/978-3-031-38310-6_11

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().