Large Neighborhood Search

David Pisinger () and Stefan Ropke ()
Additional contact information
David Pisinger: Technical University of Denmark
Stefan Ropke: Technical University of Denmark

Chapter Chapter 13 in Handbook of Metaheuristics, 2010, pp 399-419 from Springer

Abstract: Abstract Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the large neighborhood search method, we give an overview of very large scale neighborhood search methods and discuss recent variants and extensions like variable depth search and adaptive large neighborhood search.

Keywords: Travel Salesman Problem; Hamiltonian Path; Large Neighborhood; Repair Method; Vehicle Rout Problem With Time Window (search for similar items in EconPapers)
Date: 2010
References: Add references at CitEc
Citations: View citations in EconPapers (95)

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:isochp:978-1-4419-1665-5_13

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

DOI: 10.1007/978-1-4419-1665-5_13

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().