An Introduction to Variable Neighborhood Search
Published 1 January 1999
Pierre Hansen, Nenad Mladenović
Citations342
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A relatively unexplored approach to the design of heuristics, the guided change of neighborhood in the search process, is examined, which leads to a new metaheuristic, which is widely applicable.
Abstract
In this paper we examine a relatively unexplored approach to the design of heuristics, the guided change of neighborhood in the search process. Using systematically this idea and very little more, i.e., only a local search routine, leads to a new metaheuristic, which is widely applicable. We call this approach Variable Neighborhood Search (VNS).
Keywords
Computer ScienceDecision SciencesEngineering
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)Some methods for classification and analysis of multivariate observations
22,787 Citations1967James B. MacQueen
The complexity of theorem-proving procedures
6,107 Citations1971Stephen Cook
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
American Mathematical MonthlyCombinatorial Optimization: Algorithms and Complexity.
6,028 Citations1984David Johnson, Christos H. Papadimitriou +1 more
Tabu Search
5,702 Citations1997Fred Glover, Manuel Laguna
INFORMS Journal on ComputingTabu Search—Part II
5,643 Citations1990Fred Glover
The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
INFORMS Journal on ComputingTabu Search—Part I
4,974 Citations1989Fred Glover
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness.
Computers & Operations ResearchVariable neighborhood search
4,147 Citations1997Nenad Mladenović, Pierre Hansen
This chapter presents the basic schemes of VNS and some of its extensions, and presents five families of applications in which VNS has proven to be very successful.
Operations ResearchAn Effective Heuristic Algorithm for the Traveling-Salesman Problem
3,797 Citations1973Simon Lin, Brian W. Kernighan
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems.
Journal of the American Chemical SocietyCharacterization of molecular branching
3,547 Citations1975Milan Randić
Tabu Search
2,936 Citations1997Fred Glover, Manuel Laguna
This book explores the meta-heuristics approach called tabu search, which is dramatically changing the authors' ability to solve a host of problems that stretch over the realms of resource planning, telecommunications, VLSI design, financial analysis, scheduling, spaceplanning, energy distribution, molecular engineering, logistics, pattern classification, flexible manufacturing, waste management,mineral exploration, biomedical analysis, environmental conservation and scores of other problems.
Journal of Global OptimizationGreedy Randomized Adaptive Search Procedures
2,709 Citations1995Thomas A. Feo, Maurício G. C. Resende
This paper defines the various components comprising a GRASP and demonstrates, step by step, how to develop such heuristics for combinatorial optimization problems.
INFORMS Journal on ComputingTSPLIB—A Traveling Salesman Problem Library
2,570 Citations1991Gerhard Reinelt
This paper contains the description of a traveling salesman problem library (TSPLIB) which is meant to provide researchers with a broad set of test problems from various sources and with various properties.
Kluwer Academic Publishers eBooksGreedy Randomized Adaptive Search Procedures
2,325 Citations2006Maurício G. C. Resende, Celso C. Ribeiro
Bell System Technical JournalComputer Solutions of the Traveling Salesman Problem
1,960 Citations1965Shen Lin
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
SIAM Journal on Applied MathematicsAn Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians
1,268 Citations1979Oded Kariv, S. L. Hakimi
An algorithm is presented which finds a p-median of a tree (for $p > 1$) in time $O(n^2 \cdot p^2 )$.
Bulletin of the American Mathematical SocietyEvery planar map is four colorable
1,121 Citations1976K. I. Appel, Wolfgang Haken
Operations ResearchA Dual-Based Procedure for Uncapacitated Facility Location
910 Citations1978Donald Erlenkotter
This approach has obtained and verified optimal solutions to all the Kuehn-Hamburger location problems in well under 0.1 seconds each on an IBM 360/91 computer, with no branching required.
Operations ResearchHeuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
795 Citations1968Michael B. Teitz, Polly Bart
This paper investigates alternatives of choice of location of p sources of unconstrained capacity from among n destinations having fixed demands and located at nodes of a network and proposes a method that seems to perform well in comparison with others found in the literature.
Illinois Journal of MathematicsEvery planar map is four colorable. Part II: Reducibility
700 Citations1977K. I. Appel, Wolfgang Haken +1 more
Annals of Operations ResearchMetaheuristics: A bibliography
643 Citations1996Ibrahim H. Osman, Gilbert Laporte
This bibliography provides a classification of a comprehensive list of 1380 references on the theory and application of metaheuristics that have had widespread successes in attacking a variety of difficult combinatorial optimization problems that arise in many practical areas.
Journal of Combinatorial Theory Series BThe Four-Colour Theorem
608 Citations1997Neil Robertson, Daniel P. Sanders +2 more
Another proof is given, still using a computer, but simpler than Appel and Haken's in several respects, that every loopless planar graph admits a vertex-colouring with at most four different colours.
Combinatorial optimization: algorithms and complexity
486 Citations1998Papadimitriou, Christos H, Steiglitz, Kenneth
INFORMS Journal on ComputingFast Algorithms for Geometric Traveling Salesman Problems
469 Citations1992Jon Jouis Bentley
Efficient algorithms for computing approximate traveling salesman tours in multidimensional point sets and three local optimizations are described, which are able to solve uniform planar million-city traveling salesman problems to within a few percent of optimal in several midicomputer CPU hours.
Location ScienceVariable neighborhood search for the p-median
388 Citations1997Pierre Hansen, Nenad Mladenović
Operations Research LettersA new adaptive multi-start technique for combinatorial global optimizations
351 Citations1994Kenneth D. Boese, Andrew B. Kahng +1 more
This work motivates a new adaptive multi-start paradigm for heuristic global optimization, wherein starting points for greedy descent are adaptively derived from the best previously found local minima.
Journal of the Operational Research SocietyOn the Location of Supply Points to Minimize Transport Costs
346 Citations1964F. E. Maranzana
An algorithm applicable to the problem of locating supply points optimally with respect to transport costs is given and may fail to converge to an optimal solution.
ComputingAlgorithms for the maximum satisfiability problem
339 Citations1990Pierre Hansen, Brigitte Jaumard
Two recent local search algorithmic schemes are considered, the Simulated Annealing method of Kirkpatrick, Gelatt and Vecchi and the Steepest Ascent Mildest Descent method, and adapt them to the Maximum Satisfiability problem and are shown empirically to be more efficient than the heuristics previously proposed in the literature.
Pattern RecognitionA Tabu search approach to the clustering problem
301 Citations1995Khaled S. Al‐Sultan
A new algorithm for solving the problem of clustering m objects into c clusters based on a tabu search technique is developed that compares favorably with both the k-means and the simulated annealing algorithms.
Discrete MathematicsOn conjectures of Graffiti
290 Citations1988Siemion Fajtlowicz
CNCL deletes those conjectures of the second and third type in which one of the invariants on the left is always smaller than an invariant on the right that may undoubtedly remove a number of interesting conjectures.
International Transactions in Operational ResearchCapacitated clustering problems by hybrid simulated annealing and tabu search
247 Citations1994Ibrahim H. Osman
Computers & ChemistryVariable neighborhood search for extremal graphs
246 Citations1999Gilles Caporossi, İvan Gutman +1 more
The structure of the chemical trees possessing extremal (maximal and minimal) values for the Randic connectivity index is established by means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization.
Australian Journal of BotanyMultidimensional group analysis
191 Citations1966RC Jancey
A quantitative taxonomic method is described, based on the calculation of distance functions in multidimensional space, and provides objective discrimination and characterization of taxa.
INFOR Information Systems and Operational ResearchA Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
185 Citations1983R.A. Whitaker
A fast algorithm is described for implementing the greedy interchange heuristic for lise in solving large scale clustering and uncapacitated median location problems and an additional heuristic is proposed for solving these set partitioning problems based on an efficient procedure for achieving the interchange.
Pattern RecognitionExperiments in projection and clustering by simulated annealing
178 Citations1989Raymond W. Klein, Richard C. Dubes
The simulated annealing algorithm when applied to the minimization of functions from two common problems encountered in exploratory pattern analysis, projection and clustering yields a better optimization and better retained structure for large data sets containing tight gaussian clusters.
Mathematical ProgrammingExact and approximate solutions to the multisource weber problem
166 Citations1972Robert E. Kuenne, Richard M. Soland
A branch-and-bound algorithm for exact solution of the problem is developed, and computational experience with it is described.
Pattern Recognition LettersA near-optimal initial seed value selection in K-means means algorithm using a genetic algorithm
161 Citations1993G. Phanendra Babu, M. Narasimha Murty
This work uses a genetic algorithm to find a near-optimal partitioning of the given data set by selecting proper initial seed values in the K-means algorithm, and results obtained are very encouraging.
European Journal of Operational ResearchA note on solving large p-median problems
155 Citations1985J. E. Beasley
It is shown that it is possible to enhance a tree search algorithm for the p -median problem to solve (optimally) problems having up to 900 vertices using the Cray-1S computer.
European Journal of Operational ResearchCluster dissection and analysis
115 Citations1986Dennis J. Hand
SIAM Journal on Scientific ComputingAn Interior Point Algorithm for Minimum Sum-of-Squares Clustering
114 Citations1999O. du Merle, Pierre Hansen +2 more
An exact algorithm is proposed for minimum sum-of-squares nonhierarchical clustering, i.e., for partitioning a given set of points from a Euclidean m-space into a given number of clusters in order to minimize the sum of squared distances from all points to the centroid of the cluster to which they belong.
Kent Academic Repository (University of Kent)Studies in Locational Analysis
112 Citations1997Boffey, B., Saı̈d Salhi
INFORMS Journal on ComputingTabu Thresholding: Improved Search by Nonmonotonic Trajectories
104 Citations1995Fred Glover
Embodied particularly in the strategic oscillation component of tabu search, this nonmonotonic control has been shown in a variety of studies to yield outcomes superior to those of simulated annealing and threshold acceptance.
DIMACS series in discrete mathematics and theoretical computer scienceApproximate solution of weighted MAX-SAT problems using GRASP
81 Citations1997Maurício G. C. Resende, Leonidas Pitsoulis +1 more
A greedy randomized adaptive search procedure (GRASP) for computing approximate solutions of weighted MAX-SAT problems and computational experience indicates the suitability of GRASP for this class of problems.
Journal of the Operational Research SocietyProperties and Solution Methods for Large Location—Allocation Problems
77 Citations1982Robert F. Love, Henrik Juel
Five solution methods are developed which utilize the special properties of the location-allocation problem and two of these algorithms achieved optimal solutions in all 102 test problems for which solutions were known.
Les Cahiers du GERADImprovements and Comparison of Heuristics for solving the Multisource Weber Problem
64 Citations1997Jack Brimberg, Pierre Hansen +2 more
IBM Systems JournalOn the location of supply points to minimize transportation costs
59 Citations1963F. E. Maranzana
An algorithm applicable to the problem of locating supply points optimally with respect to transportation costs is given and repeated application with judicious selections of alternative starting values will assure a good, if not optimal, solution.
Discrete Applied MathematicsDistances between traveling salesman tours
58 Citations1995King-Tim Mak, Andrew Morton
Two metrics, based respectively on k- OPT and 2-OPT, for measuring the distance between traveling salesman tours are considered and their relationship worked out.
SIAM Journal on Control and OptimizationOptimization of Globally Convex Functions
52 Citations1989T. C. Hu, Victor Klee +1 more
Artificial IntelligenceMan-machine theorem proving in graph theory
18 Citations1988Dragoš Cvetković, Irena Pevac
The theorem prover of the interactive programming system GRAPH is described at a conceptual level, a new way of handling definition instantiations and rewriting by lemmas, and the possibility of using graph theoretic algorithms to test the validity of subgoals on concrete graphs.
Journal of Symbolic ComputationINGRID: A graph invariant manipulator
14 Citations1989Ronald D. Dutton, Robert C. Brigham +1 more
With the simple user interface provided by INGRID, even a graph theory novice can often discern properties of a graph that might normally require the capabilities of a well-informed expert.
Heuristic Solution of the Multisource Weber Problem as a p -median Problem
2 Citations1996Pierre Hansen, Nenad Mladenović +1 more
