A very large scale neighborhood search algorithm for the<i>q</i>-mode problem

Many optimization problems that model the essential issues of important real‐world decision making are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic techniques that find nearly optimal solutions within a reasonable amount of computation time. Improvement algorithms generally start with a feasible solution and iteratively try to obtain a better solution. Neighborhood search algorithms, which are alternatively called local search algorithms , are a wide class of improvement algorithms where at each iteration an improving solution is found by searching a “neighborhood” of the current solution. A critical issue in the design of a neighborhood search algorithm is defining what solutions constitute the neighborhood of a solution. As a rule of thumb, the larger the neighborhood, the better is the quality of the locally optimal solutions, including the final solution selected upon termination. Similarly, the larger the neighborhood, the longer it takes to search the neighborhood. Thus, a larger neighborhood does not necessarily produce a more effective heuristic unless one can search the larger neighborhood efficiently. This article concentrates on neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the input data and the neighborhood can be searched efficiently. We survey three broad classes of very large‐scale neighborhood (VLSN) search algorithms: variable‐depth methods in which large neighborhoods are searched heuristically, large neighborhoods that are searched by solving a constrained minimum–cost flow problem, and other situations that give rise to efficiently searchable large neighborhoods.

show abstract

Very Large‐Scale Neighborhood Search

Altner

Ahuja

Ergün

et al. 2011

Wiley Encyclopedia of Operations Research and Management Science

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A very large scale neighborhood search algorithm for theq-mode problem

Cited by 1 publication

References 15 publications

Very Large‐Scale Neighborhood Search

Very Large‐Scale Neighborhood Search

Contact Info

Product

Resources

About