Very Large-Scale neighborhood search

3Citations
Citations of this article
70Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Altner, D. S., Ahuja, R. K., Ergun, Ö., & Orlin, J. B. (2014). Very Large-Scale neighborhood search. In Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques, Second Edition (pp. 339–368). Springer US. https://doi.org/10.1007/978-1-4614-6940-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free