POPMUSIC

Éric D. Taillard () and Stefan Voß ()
Additional contact information
Éric D. Taillard: HEIG-VD, University of Applied Sciences and Arts of Western Switzerland, Embedded Information Systems
Stefan Voß: University of Hamburg, Faculty of Business Administration, Institute of Information Systems

Chapter 22 in Handbook of Heuristics, 2018, pp 687-701 from Springer

Abstract: Abstract This chapter presents POPMUSIC, a general decomposition-based framework within the realm of metaheuristics and matheuristics that has been successfully applied to various combinatorial optimization problems. POPMUSIC is especially useful for designing heuristic methods for large combinatorial problems that can be partially optimized. The basic idea is to optimize subparts of solutions until a local optimum is reached. Implementations of the technique to various problems show its broad applicability and efficiency for tackling especially large-size instances.

Keywords: Decomposition algorithm; Fix-and-optimize method; Large Neighbourhood Search; Large-scale optimization; Matheuristics; Metaheuristics (search for similar items in EconPapers)
Date: 2018
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:sprchp:978-3-319-07124-4_31

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

DOI: 10.1007/978-3-319-07124-4_31

Access Statistics for this chapter

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