Very Large-Scale Neighborhood Search

Douglas S. Altner (), Ravindra K. Ahuja (), Özlem Ergun () and James B. Orlin ()
Additional contact information
Douglas S. Altner: United States Naval Academy
Ravindra K. Ahuja: University of Florida
Özlem Ergun: Georgia Institute of Technology
James B. Orlin: Massachusetts Institute of Technology

Chapter Chapter 13 in Search Methodologies, 2014, pp 339-367 from Springer

Abstract: Abstract One of the central issues in developing neighborhood search techniques is defining the neighborhood. As a rule of thumb, larger neighborhoods contain higher quality local optimal solutions compared to smaller neighborhoods. However, larger neighborhoods also typically require more time to search than smaller neighborhoods. A neighborhood search algorithm is not practical if the neighborhoods cannot be searched efficiently. Thus, a rapid search algorithm is needed to make efficient use of large neighborhoods.

Keywords: Travel Salesman Problem; Combinatorial Optimization Problem; Variable Neighborhood Search; Vehicle Rout Problem; Path Exchange (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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-1-4614-6940-7_13

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

DOI: 10.1007/978-1-4614-6940-7_13

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 ().