Developments of Variable Neighborhood Search

Proposed just a few years ago, Variable Neighborhood Search (VNS) is a new metaheuristic for combinatorial and global optimization, based upon systematic change of neighborhood within a possibly randomized local search. Its development has been rapid. After reviewing the basic scheme of VNS, several extensions aimed at solving large problem instances are surveyed. Issues in devising a VNS heuristic are discussed. Finally, recent applications are briefly summarized, with special attention given to VNS-based computer-aided discovery of conjectures in graph theory.

[1]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[2]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[3]  M. Randic.  Characterization of molecular branching , 1975 .

[4]  Jeffrey D. Ullman,et al.  NP-Complete Scheduling Problems , 1975, J. Comput. Syst. Sci..

[5]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[6]  R. A. Whitaker,et al.  A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems , 1983 .

[7]  J. Beasley.  A note on solving large p-median problems , 1985 .

[8]  James C. Bezdek,et al.  Efficient Implementation of the Fuzzy c-Means Clustering Algorithms , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  I. Gutman,et al.  Mathematical Concepts in Organic Chemistry , 1986 .

[10]  Siemion Fajtlowicz,et al.  On conjectures of Graffiti , 1988, Discret. Math..

[11]  Miroslav L. Dukic,et al.  A Method of a Spread-Spectrum Radar Polyphase Code Design , 1990, IEEE J. Sel. Areas Commun..

[12]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[13]  Michel Gendreau,et al.  Tabu search algorithms for the maximum clique problem , 1993, Cliques, Coloring, and Satisfiability.

[14]  Edward A. Lee,et al.  A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures , 1993, IEEE Trans. Parallel Distributed Syst..

[15]  Panos M. Pardalos,et al.  A continuous based heuristic for the maximum clique problem , 1993, Cliques, Coloring, and Satisfiability.

[16]  Imtiaz Ahmad,et al.  Multiprocessor Scheduling in a Genetic Paradigm , 1996, Parallel Comput..

[17]  J. M. Moreno-Vega,et al.  THE CHAIN-INTERCHANGE HEURISTIC METHOD1 , 1996 .

[18]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[19]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[20]  Charu C. Aggarwal,et al.  Optimized Crossover for the Independent Set Problem , 1997, Oper. Res..

[21]  É. Taillard,et al.  Improvements and Comparison of Heuristics for solving the Multisource Weber Problem , 1997 .

[22]  Ishfaq Ahmad,et al.  Efficient Scheduling of Arbitrary TAsk Graphs to Multiprocessors Using a Parallel Genetic Algorithm , 1997, J. Parallel Distributed Comput..

[23]  P. Hansen,et al.  Variable neighborhood search for the p-median , 1997 .

[24]  É. Taillard,et al.  Adaptive memories for the Quadratic Assignment Problems , 1997 .

[25]  O. Araujo,et al.  Some Bounds for the Connectivity Index of a Chemical Graph , 1998, J. Chem. Inf. Comput. Sci..

[26]  Ching-Tang Hsieh,et al.  Generalized Fuzzy Kohonen Clustering Networks , 1998 .

[27]  M. Cangalovic,et al.  TABU search methodology in global optimization , 1999 .

[28]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs: IV: Chemical Trees with Extremal Connectivity Index , 1998, Comput. Chem..

[29]  Pierre Hansen,et al.  Finding Relations in Polynomial Time , 1999, IJCAI.

[30]  Silvano Martello,et al.  Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[31]  Pierre Hansen,et al.  An Interior Point Algorithm for Minimum Sum-of-Squares Clustering , 1997, SIAM J. Sci. Comput..

[32]  P. Hansen,et al.  Trees with Palindromic Hosoya Polynomials , 1999 .

[33]  P. Hansen,et al.  Alkanes with small and large Randić connectivity indices , 1999 .

[34]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 2. Finding Graphs with Extremal Energy , 1998, J. Chem. Inf. Comput. Sci..

[35]  J. Potvin,et al.  Tabu Search With Exact Neighbor Evaluation For Multicommodity Location With Balancing Requirements , 1999 .

[36]  Pierre Hansen,et al.  Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem , 2000, Oper. Res..

[37]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system , 1997, Discret. Math..

[38]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[39]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs 8: Variations on Graffiti 105 , 2001 .

[40]  Pierre Hansen,et al.  Variable Neighborhood Decomposition Search , 1998, J. Heuristics.

[41]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[42]  D. Cvetkovic,et al.  Variable neighborhood search for extremal graphs 3 , 2001 .

[43]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graph. 7. Polyenes with Maximum HOMO-LUMO Gap , 2001 .

[44]  P. Hansen,et al.  Polyenes with maximum HOMO–LUMO gap ☆ , 2001 .

[45]  Pierre Hansen,et al.  J-MEANS: a new local search heuristic for minimum sum of squares clustering , 1999, Pattern Recognit..

[46]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[47]  Pierre Hansen,et al.  Fuzzy J-Means: a new heuristic for fuzzy clustering , 2001, Pattern Recognit..

[48]  Celso C. Ribeiro,et al.  Heuristics for the Phylogeny Problem , 2002, J. Heuristics.

[49]  Belén Melián-Batista,et al.  The Parallel Variable Neighborhood Search for the p-Median Problem , 2002, J. Heuristics.

[50]  Pierre Hansen,et al.  Solving the p‐Center problem with Tabu Search and Variable Neighborhood Search , 2000, Networks.

[51]  Pierre Hansen,et al.  An Oil Pipeline Design Problem , 2003, Oper. Res..

[52]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs, 6. Analyzing Bounds for the Connectivity Index , 2001, J. Chem. Inf. Comput. Sci..

[53]  Mirjana Cangalovic,et al.  Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search , 2003, Eur. J. Oper. Res..

[54]  Pierre Hansen,et al.  Cooperative Parallel Variable Neighborhood Search for the p-Median , 2004, J. Heuristics.

[55]  Pierre Hansen,et al.  Variable neighborhood search for the maximum clique , 2001, Discret. Appl. Math..