Variable neighbourhood search: methods and applications

Variable neighbourhood search (VNS) is a metaheuristic, or a framework for building heuristics, based upon systematic changes of neighbourhoods both in descent phase, to find a local minimum, and in perturbation phase to emerge from the corresponding valley. It was first proposed in 1997 and has since then rapidly developed both in its methods and its applications. In the present paper, these two aspects are thoroughly reviewed and an extensive bibliography is provided. Moreover, one section is devoted to newcomers. It consists of steps for developing a heuristic for any particular problem. Those steps are common to the implementation of other metaheuristics.

[1]  M. Kendall,et al.  The Logic of Scientific Discovery. , 1959 .

[2]  R. E. Griffith,et al.  A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems , 1961 .

[3]  Roger Fletcher,et al.  A Rapidly Convergent Descent Method for Minimization , 1963, Comput. J..

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Philip E. Gill,et al.  Practical optimization , 1981 .

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

[7]  E. Baum.  Towards practical `neural' computation for combinatorial optimization problems , 1987 .

[8]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[9]  C. Reeves.  Modern heuristic techniques for combinatorial problems , 1993 .

[10]  Nenad Mladenović,et al.  A Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem , 1995 .

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

[12]  Michael O. Albertson,et al.  The Irregularity of a Graph , 1997, Ars Comb..

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

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

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

[16]  Pierre Hansen,et al.  Stabilized column generation , 1998, Discret. Math..

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

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

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

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

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

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

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

[24]  P. Hansen,et al.  Computers and discovery in algebraic graph theory , 2001 .

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

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

[27]  Pierre Hansen,et al.  How Far Is, Should and Could Be Conjecture-Making in Graph Theory an Automated Process? , 2001, Graphs and Discovery.

[28]  Alain Hertz,et al.  A Variable Neighborhood Descent Algorithm for the Undirected Capacitated Arc Routing Problem , 2001, Transp. Sci..

[29]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

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

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

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

[33]  Peter I. Cowling,et al.  Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem , 2001, EvoWorkshops.

[34]  Mustapha Aouchiche,et al.  What Forms Do Interesting Conjectures Have in Graph Theory? , 2001, Graphs and Discovery.

[35]  Celso C. Ribeiro,et al.  Variable neighborhood search for the degree-constrained minimum spanning tree problem , 2002, Discret. Appl. Math..

[36]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

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

[38]  Panos M. Pardalos,et al.  Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[39]  Maria Zrikem,et al.  Variable neighborhood decomposition search for the optimization of power plant cable layout , 2002, J. Intell. Manuf..

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

[41]  Lúcia Maria de A. Drummond,et al.  Distributed parallel metaheuristics based on GRASP and VNS for solving the traveling purchaser problem , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[42]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[43]  Pierre Hansen,et al.  Computers in Graph Theory , 2002 .

[44]  Pierre Hansen,et al.  The maximum capture problem with random utilities: Problem formulation and algorithms , 2002, Eur. J. Oper. Res..

[45]  P. Hansen,et al.  Developments of Variable Neighborhood Search , 2002 .

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

[47]  Krzysztof Fleszar,et al.  New heuristics for one-dimensional bin-packing , 2002, Comput. Oper. Res..

[48]  Krzysztof Fleszar,et al.  An effective heuristic for the CLSP with set-up times , 2003, J. Oper. Res. Soc..

[49]  Olli Bräysy,et al.  A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows , 2003, INFORMS J. Comput..

[50]  Inmaculada Rodríguez Martín,et al.  Variable neighborhood tabu search and its application to the median cycle problem , 2003, Eur. J. Oper. Res..

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

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

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

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

[55]  Pierre Hansen,et al.  Graphs with maximum connectivity index , 2003, Comput. Biol. Chem..

[56]  Alain Hertz,et al.  A variable neighborhood search for graph coloring , 2003, Eur. J. Oper. Res..

[57]  Pierre Hansen,et al.  Decomposition Strategies for Large Scale Continuous Location-Allocation Problems , 2004 .

[58]  Richard F. Hartl,et al.  A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows , 2004, J. Heuristics.

[59]  José A. Moreno-Pérez,et al.  GRASP-VNS hybrid for the Strip Packing Problem , 2004, Hybrid Metaheuristics.

[60]  Angel B. Ruiz,et al.  Designing Distribution Networks: Formulations and Solution Heuristic , 2004, Transp. Sci..

[61]  N. Mladenović,et al.  Variable neighborhood search for the k-cardinality tree , 2004 .

[62]  Pierre Hansen,et al.  Pooling Problem: Alternate Formulations and Solution Methods , 2000, Manag. Sci..

[63]  Gilles Pesant,et al.  Recherche locale à voisinage variable pour le routage optique dans des réseaux utilisant des routeurs latins , 2004, Ann. des Télécommunications.

[64]  Robert Sabourin,et al.  A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem , 2004, PATAT.

[65]  Krzysztof Fleszar,et al.  Solving the resource-constrained project scheduling problem by a variable neighbourhood search , 2004, Eur. J. Oper. Res..

[66]  Jack Brimberg,et al.  Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem , 2004, Comput. Oper. Res..

[67]  Gilles Caporossi,et al.  Using the Computer to Study the Dynamics of the Handwriting Processes , 2004, Discovery Science.

[68]  Jules R. Dégila,et al.  Topological design optimization of a yottabit-per-second lattice network , 2004, IEEE Journal on Selected Areas in Communications.

[69]  Nabil Belacel,et al.  Fuzzy J-Means and VNS methods for clustering genes from microarray data , 2004, Bioinform..

[70]  Matteo Fischetti,et al.  A local branching heuristic for mixed‐integer programs with 2‐level variables, with an application to a telecommunication network design problem , 2004, Networks.

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

[72]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures , 2000, Discret. Math..

[73]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 12. A Note on the Variance of Bounded Degrees in Graphs , 2004 .

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

[75]  J Brimberg,et al.  The multi-source Weber problem with constant opening cost , 2004, J. Oper. Res. Soc..

[76]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. XI. Bounds on Algebraic Connectivity , 2004 .

[77]  P. Hansen,et al.  Parallel Variable Neighborhood Search , 2004 .

[78]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.

[79]  Marc Gravel,et al.  Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems , 2005, J. Oper. Res. Soc..

[80]  Nenad Mladenovic,et al.  Reformulation descent applied to circle packing problems , 2003, Comput. Oper. Res..

[81]  Zvi Drezner,et al.  Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods , 2005, Ann. Oper. Res..

[82]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 20. Automated Comparison of Graph Invariants , 2005 .

[83]  P. Hansen,et al.  Arbitrary-Norm Hyperplane Separation by Variable Neighborhood Search , 2005 .

[84]  Mustapha Aouchiche,et al.  AutoGraphiX: a survey , 2005, Electron. Notes Discret. Math..

[85]  Zuoquan Lin,et al.  Variable Neighborhood Search with Permutation Distance for QAP , 2005, KES.

[86]  Christian Prins,et al.  A Metaheuristic to Solve a Location-Routing Problem with Non-Linear Costs , 2005, J. Heuristics.

[87]  Hiroyuki Mori,et al.  Variable neighborhood tabu search for capacitor placement in distribution systems , 2005, 2005 IEEE International Symposium on Circuits and Systems.

[88]  Peter I. Cowling,et al.  Embedded local search approaches for routing optimization , 2005, Comput. Oper. Res..

[89]  Graham Kendall,et al.  Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques , 2013 .

[90]  Celso C. Ribeiro,et al.  A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure , 2005, Int. Trans. Oper. Res..

[91]  Malgorzata Sterna,et al.  Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date , 2005, KI.

[92]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 15. On Bags and Bugs , 2005 .

[93]  Nenad Mladenovic,et al.  Mic'2001 -4th Metaheuristics International Conference Design of Balanced Mba Student Teams , 2022 .

[94]  Mustapha Aouchiche,et al.  Recherche à voisinage variable de graphes extrémaux 13. à propos de la maille , 2005, RAIRO Oper. Res..

[95]  Pierre Hansen,et al.  Heuristic Procedures for Solving the Discrete Ordered Median Problem , 2005, Ann. Oper. Res..

[96]  TATJANA DAVIDOVIĆ,et al.  Permutation-Based Genetic, Tabu, and Variable Neighborhood Search Heuristics for Multiprocessor Scheduling with Communication delays , 2004, Asia Pac. J. Oper. Res..

[97]  Abraham Duarte,et al.  A low-level hybridization between memetic algorithm and VNS for the max-cut problem , 2005, GECCO '05.

[98]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 10. Comparison of Irregularity Indices for Chemical Trees , 2003, J. Chem. Inf. Model..

[99]  Zoran Ognjanovic,et al.  A Hybrid Genetic and Variable Neighborhood Descent for Probabilistic SAT Problem , 2005, Hybrid Metaheuristics.

[100]  Mustapha Aouchiche,et al.  Variable Neighborhood Search for Extremal Graphs 14: The AutoGraphiX 2 System , 2006 .

[101]  Jeffrey S. Smith,et al.  Algorithms for single machine total tardiness scheduling with sequence dependent setups , 2006, Eur. J. Oper. Res..

[102]  Christos D. Tarantilis,et al.  A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem , 2006, Numerical Methods and Applications.

[103]  Mehmet Emin Aydin,et al.  A Variable Neighbourhood Search Algorithm for Job Shop Scheduling Problems , 2006, EvoCOP.

[104]  A. Higgins,et al.  Scheduling of brand production and shipping within a sugar supply chain , 2006, J. Oper. Res. Soc..

[105]  Mehmet Emin Aydin,et al.  Variable Neighbourhood Search for Job Shop Scheduling Problems , 2006, J. Softw..

[106]  P. Goos,et al.  A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation and time trends , 2006 .

[107]  P. Hansen,et al.  Automated Results and Conjectures on Average Distance in Graphs , 2006 .

[108]  Víctor Yepes,et al.  Economic Heuristic Optimization for Heterogeneous Fleet VRPHESTW , 2006 .

[109]  Bertrand Estellon,et al.  Large neighborhood improvements for solving car sequencing problems , 2006, RAIRO Oper. Res..

[110]  Patrice Boizumault,et al.  On-line resources allocation for ATM networks with rerouting , 2006, Comput. Oper. Res..

[111]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 19. Further Conjectures and Results about the Randic Index , 2006 .

[112]  Tore Grünert,et al.  Sequential search and its application to vehicle-routing problems , 2006, Comput. Oper. Res..

[113]  Martin Josef Geiger,et al.  On the Interactive Resolution of Multi-objective Vehicle Routing Problems , 2006, EMO.

[114]  Pierre Hansen,et al.  Variable Neighbourhood Search for Colour Image Quantization , 2006 .

[115]  Panagiotis P. Repoussis,et al.  A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows , 2006, Hybrid Metaheuristics.

[116]  Rafael Martí,et al.  Variable neighborhood search for the linear ordering problem , 2006, Comput. Oper. Res..

[117]  Ling Wang,et al.  Multi-objective Flow Shop Scheduling Using Differential Evolution , 2006 .

[118]  Ajith Abraham,et al.  Variable Neighborhood Particle Swarm Optimization for Multi-objective Flexible Job-Shop Scheduling Problems , 2006, SEAL.

[119]  Lucídio dos Anjos Formiga Cabral,et al.  An Efficient Heuristic for the Ring Star Problem , 2006, WEA.

[120]  Alberto Del Pia,et al.  A variable neighborhood descent algorithm for a real waste collection problem with mobile depots , 2006, Int. Trans. Oper. Res..

[121]  Kunihiko Sadakane,et al.  DNA Sequence Design by Dynamic Neighborhood Searches , 2006, DNA.

[122]  Celso C. Ribeiro,et al.  Scheduling workover rigs for onshore oil production , 2006, Discret. Appl. Math..

[123]  Marcos Negreiros,et al.  The capacitated centred clustering problem , 2006, Comput. Oper. Res..

[124]  Günther R. Raidl,et al.  The Core Concept for the Multidimensional Knapsack Problem , 2006, EvoCOP.

[125]  Alain Hertz,et al.  A survey of local search methods for graph coloring , 2004, Comput. Oper. Res..

[126]  B. Melian-Batista,et al.  Designing WDM networks by a variable neighborhood search , 2006 .

[127]  Belén Melián.  Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks , 2006 .

[128]  Pierre Hansen,et al.  Variable neighborhood search and local branching , 2004, Comput. Oper. Res..

[129]  Harri Niska,et al.  Improved route planning and scheduling of waste collection and transport , 2006, Expert Syst. Appl..

[130]  Enrique Alba,et al.  Comparative analysis of modern optimization tools for the p-median problem , 2006, Stat. Comput..

[131]  Miguel A. Lejeune,et al.  Production , Manufacturing and Logistics A variable neighborhood decomposition search method for supply chain management planning problems , 2006 .

[132]  Nenad Mladenović,et al.  GLOB — A new VNS-based Software for Global Optimization , 2006 .

[133]  Aise Zülal Sevkli,et al.  Variable Neighborhood Search for the Orienteering Problem , 2006, ISCIS.

[134]  Pierre Hansen,et al.  First vs. best improvement: An empirical study , 1999, Discret. Appl. Math..

[135]  Jafar Fathali,et al.  Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases , 2006, Eur. J. Oper. Res..

[136]  Rainer Kolisch,et al.  Experimental investigation of heuristics for resource-constrained project scheduling: An update , 2006, Eur. J. Oper. Res..

[137]  N. Mladenović,et al.  Variable neighborhood search for the vertex weighted k , 2006, Eur. J. Oper. Res..

[138]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..

[139]  Kiyoharu Tagawa,et al.  Robust optimum design of SAW filters by the penalty function method , 2007 .

[140]  J. Pacheco,et al.  Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients , 2007 .

[141]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 27. Families of Extremal Graphs , 2007 .

[142]  Zhao Bao-hua.  Hybrid heuristics based on particle swarm optimization and variableneighborhood search for Job Shop scheduling , 2007 .

[143]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[144]  Mustapha Aouchiche,et al.  On a conjecture about the Randic index , 2007, Discret. Math..

[145]  Samad Ahmadi,et al.  Guided construction search metaheuristics for the capacitated p-median problem with single source constraint , 2007, J. Oper. Res. Soc..

[146]  Peter I. Cowling,et al.  Exact/Heuristic Hybrids Using rVNS and Hyperheuristics for Workforce Scheduling , 2007, EvoCOP.

[147]  M. Brusco,et al.  A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices , 2007 .

[148]  Abraham P. Punnen,et al.  Learning multicriteria fuzzy classification method PROAFTN from data , 2007, Comput. Oper. Res..

[149]  Ivana Ljubic,et al.  A Hybrid VNS for Connected Facility Location , 2007, Hybrid Metaheuristics.

[150]  M. Brusco,et al.  A Comparison of Heuristic Procedures for Minimum Within-Cluster Sums of Squares Partitioning , 2007 .

[151]  Pierre Hansen,et al.  Algorithms for ℓ1-Embeddability and Related Problems , 2007, J. Classif..

[152]  Pierre Hansen,et al.  Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem , 2003, INFORMS J. Comput..

[153]  Nenad Mladenovic,et al.  Formulation Space Search for Circle Packing Problems , 2007, SLS.

[154]  Mehmet Emin Aydin,et al.  Parallel variable neighbourhood search algorithms for job shop scheduling problems , 2007 .

[155]  Melquíades Pérez Pérez,et al.  A hybrid VNS–path relinking for the p-hub median problem , 2007 .

[156]  Emilio Carrizosa,et al.  On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification , 2007, INFORMS J. Comput..

[157]  Pin Luarn,et al.  A discrete version of particle swarm optimization for flowshop scheduling problems , 2007, Comput. Oper. Res..

[158]  Yi-Ching Chen,et al.  Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm , 2007, Reliab. Eng. Syst. Saf..

[159]  Ching-Jong Liao,et al.  A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date , 2007, Comput. Ind. Eng..

[160]  Richard F. Hartl,et al.  Scheduling periodic customer visits for a traveling salesperson , 2007, Eur. J. Oper. Res..

[161]  M. Brusco,et al.  Heuristic Implementation of Dynamic Programming for Matrix Permutation Problems in Combinatorial Data Analysis , 2008 .

[162]  J. Marcos Moreno-Vega,et al.  A simple and fast heuristic for protein structure comparison , 2008, BMC Bioinformatics.

[163]  P. Hansen,et al.  On the spectral radius of graphs with a given domination number , 2007 .

[164]  Jacques A. Ferland,et al.  Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem , 2007, J. Sched..

[165]  L Hongbo,et al.  An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems , 2007 .

[166]  Zoran Ognjanovic,et al.  Variable Neighborhood Search for the Probabilistic Satisfiability Problem , 2007, Metaheuristics.

[167]  P. Pardalos,et al.  Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search , 2007 .

[168]  Fatos Xhafa,et al.  A Hybrid Evolutionary Heuristic for Job Scheduling on Computational Grids , 2007 .

[169]  Dag Haugland.  A Bidirectional Greedy Heuristic for the Subspace Selection Problem , 2007, SLS.

[170]  Celso C. Ribeiro,et al.  Metaheuristics for optimization problems in computer communications , 2007, Comput. Commun..

[171]  Yi-Ching Chen,et al.  Variable neighbourhood search for redundancy allocation problems , 2007 .

[172]  John E. Beasley,et al.  A tabu search algorithm for the single vehicle routing allocation problem , 2007, J. Oper. Res. Soc..

[173]  Qiang Lv,et al.  A VNS-ANT Algorithm to QAP , 2007, Third International Conference on Natural Computation (ICNC 2007).

[174]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 24. Conjectures and Results About the Clique Number , 2007 .

[175]  P. Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 25. Products of Connectivity and Distance Measures , 2007 .

[176]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[177]  Massimo Paolucci,et al.  Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach , 2007, Comput. Oper. Res..

[178]  Jie Zhang,et al.  A Novel Programming Model and Optimisation Algorithms for WCDMA Networks , 2007, 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring.

[179]  Walter J. Gutjahr,et al.  A VNS Algorithm for Noisy Problems and Its Application to Project Portfolio Analysis , 2007, SAGA.

[180]  Michel Gendreau,et al.  An efficient variable neighborhood search heuristic for very large scale vehicle routing problems , 2007, Comput. Oper. Res..

[181]  Leo Liberti,et al.  New formulations for the Kissing Number Problem , 2007, Discret. Appl. Math..

[182]  M. Toksari,et al.  Solving the unconstrained optimization problem by a variable neighborhood search , 2007 .

[183]  Pierre Hansen,et al.  The p-median problem: A survey of metaheuristic approaches , 2005, Eur. J. Oper. Res..

[184]  Zhu Jian-ying.  Some meta-heuristics for no-wait flow shop problem , 2007 .

[185]  Stefano Benati.  Categorical data fuzzy clustering: An analysis of local search heuristics , 2008, Comput. Oper. Res..

[186]  Roberto Montemanni,et al.  Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm , 2008, J. Math. Model. Algorithms.

[187]  Shuang Chen,et al.  Model and algorithm for inventory/routing decision in a three-echelon logistics system , 2008, Eur. J. Oper. Res..

[188]  Krzysztof Fleszar,et al.  An effective VNS for the capacitated p-median problem , 2008, Eur. J. Oper. Res..

[189]  Mehmet Emin Aydin,et al.  Sequential and Parallel Variable Neighborhood Search Algorithms for Job Shop Scheduling , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[190]  Matthias Prandtstetter,et al.  An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem , 2008, Eur. J. Oper. Res..

[191]  Mustapha Aouchiche,et al.  Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number , 2006, Discret. Appl. Math..

[192]  Pierre Hansen,et al.  Complement to a comparative analysis of heuristics for the p-median problem , 2008, Stat. Comput..

[193]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[194]  Charles Audet,et al.  Nonsmooth optimization through Mesh Adaptive Direct Search and Variable Neighborhood Search , 2006, J. Glob. Optim..

[195]  Chiuh-Cheng Chyu,et al.  Scheduling jobs under constant period-by-period resource availability to maximize project profit at a due date , 2009 .

[196]  Andreas Fink,et al.  On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[197]  Patrice Boizumault,et al.  Combining VNS with constraint programming for solving anytime optimization problems , 2008, Eur. J. Oper. Res..

[198]  Nenad Mladenovic,et al.  Local and variable neighborhood search for the k-cardinality subgraph problem , 2008, J. Heuristics.

[199]  Christos D. Tarantilis,et al.  A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows , 2008, J. Heuristics.

[200]  Belén Melián-Batista,et al.  Introduction to the special issue on variable neighborhood search , 2008, J. Heuristics.

[201]  Pierre Hansen,et al.  Variable neighborhood search , 1997, Eur. J. Oper. Res..

[202]  Anand Subramanian,et al.  An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit , 2008, EvoCOP.

[203]  Maria Antónia Carravilla,et al.  Production planning and scheduling in the glass container industry: A VNS approach , 2008 .

[204]  Pierre Hansen,et al.  Merging the local and global approaches to probabilistic satisfiability , 2004, Int. J. Approx. Reason..

[205]  Jens Wollenweber,et al.  A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application , 2008, OR Spectr..

[206]  Pierre Hansen,et al.  On bags and bugs , 2005, Discret. Appl. Math..

[207]  Richard F. Hartl,et al.  A variable neighborhood search for the capacitated arc routing problem with intermediate facilities , 2008, J. Heuristics.

[208]  Amaia Lusa,et al.  A variable neighbourhood search algorithm for the constrained task allocation problem , 2008, J. Oper. Res. Soc..

[209]  Nenad Mladenovic,et al.  A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule , 2008, Eur. J. Oper. Res..

[210]  Haris Gavranovic.  Local search and suffix tree for car-sequencing problem with colors , 2008, Eur. J. Oper. Res..

[211]  Fatih Erdogan Sevilgen,et al.  A Hybrid Particle Swarm Optimization Algorithm for Function Optimization , 2008, EvoWorkshops.

[212]  Bertrand Estellon,et al.  Two local search approaches for solving real-life car sequencing problems , 2008, Eur. J. Oper. Res..

[213]  Joaquín A. Pacheco,et al.  Heuristic Solutions for Locating Health Resources , 2008, IEEE Intelligent Systems.

[214]  Malgorzata Sterna,et al.  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..

[215]  Yannick Frein,et al.  Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives , 2008, Comput. Ind. Eng..

[216]  Volker Gruhn,et al.  A General Vehicle Routing Problem , 2008, Eur. J. Oper. Res..

[217]  M. Jabalameli,et al.  Hybrid algorithms for the uncapacitated continuous location-allocation problem , 2008 .

[218]  Shih-Wei Lin,et al.  A hybrid approach for single-machine tardiness problems with sequence-dependent setup times , 2008, J. Oper. Res. Soc..

[219]  Mustapha Aouchiche,et al.  Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph , 2005, Eur. J. Oper. Res..

[220]  Ajith Abraham,et al.  Particle Swarm Scheduling for Work-Flow Applications in Distributed Computing Environments , 2008, Metaheuristics for Scheduling in Industrial and Manufacturing Applications.

[221]  Liu Shi-xin.  Variable Neighborhood Search for Solving Vehicle Routing Problems with Backhauls and Time Windows , 2008 .

[222]  Markus Leitner,et al.  Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem , 2008, J. Heuristics.

[223]  Celso C. Ribeiro,et al.  An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem , 2008, Eur. J. Oper. Res..

[224]  Ching-Jong Liao,et al.  An ant colony optimisation algorithm for scheduling in agile manufacturing , 2008 .

[225]  Pierre Hansen,et al.  The maximum return-on-investment plant location problem with market share , 2005, J. Oper. Res. Soc..

[226]  Pedro Martins,et al.  Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem , 2008, Eur. J. Oper. Res..

[227]  Günther R. Raidl,et al.  Bringing order into the neighborhoods: relaxation guided variable neighborhood search , 2008, J. Heuristics.

[228]  Chuen-Lung Chen,et al.  Hybrid metaheuristics for unrelated parallel machine scheduling with sequence-dependent setup times , 2009 .

[229]  Günther R. Raidl,et al.  Effective Neighborhood Structures for the Generalized Traveling Salesman Problem , 2008, EvoCOP.

[230]  Mirjana Cangalovic,et al.  General variable neighborhood search for the continuous optimization , 2006, Eur. J. Oper. Res..

[231]  Peter I. Cowling,et al.  Improving Metaheuristic Performance by Evolving a Variable Fitness Function , 2008, EvoCOP.

[232]  Belén Melián-Batista,et al.  Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks , 2008, Eur. J. Oper. Res..

[233]  Pedro Larrañaga,et al.  Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem , 2007, J. Heuristics.

[234]  Alain Hertz,et al.  Variable space search for graph coloring , 2006, Discret. Appl. Math..

[235]  Celso C. Ribeiro,et al.  A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints , 2008, Eur. J. Oper. Res..

[236]  P. Hansen,et al.  Bounding Average Distance Using Order and Minimum Degree , 2008 .

[237]  Ai-fan Ling,et al.  A modified VNS metaheuristic for max-bisection problems , 2008 .

[238]  Pierre Hansen,et al.  Variable neighborhood search for minimum cost berth allocation , 2003, Eur. J. Oper. Res..

[239]  Mostafa Zandieh,et al.  A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling , 2009, J. Intell. Manuf..

[240]  Pierre Hansen,et al.  Solving large p-median clustering problems by primal–dual variable neighborhood search , 2009, Data Mining and Knowledge Discovery.

[241]  Shu-Chu Liu,et al.  A heuristic method for the vehicle routing problem with backhauls and inventory , 2009, J. Intell. Manuf..

[242]  Richard F. Hartl,et al.  A variable neighborhood search heuristic for periodic routing problems , 2009, Eur. J. Oper. Res..

[243]  Mostafa Zandieh,et al.  Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm , 2009, Expert Syst. Appl..

[244]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[245]  Mustapha Aouchiche,et al.  Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance , 2009, Discret. Appl. Math..

[246]  Pierre Hansen,et al.  Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number , 2009, Discret. Math..

[247]  Krzysztof Fleszar,et al.  A variable neighbourhood search algorithm for the open vehicle routing problem , 2009, Eur. J. Oper. Res..

[248]  Xianpeng Wang,et al.  A population-based variable neighborhood search for the single machine total weighted tardiness problem , 2009, Comput. Oper. Res..

[249]  Fariborz Jolai,et al.  A variable neighborhood search for job shop scheduling with set-up times to minimize makespan , 2009, Future Gener. Comput. Syst..

[250]  Leo Liberti,et al.  Double variable neighbourhood search with smoothing for the molecular distance geometry problem , 2009, J. Glob. Optim..

[251]  Chao-Tang Tseng,et al.  Minimizing total tardiness on a single machine with controllable processing times , 2009, Comput. Oper. Res..

[252]  Nenad Mladenovic,et al.  Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem , 2009, Eur. J. Oper. Res..

[253]  Nenad Mladenovic,et al.  Variable neighbourhood search for the minimum labelling Steiner tree problem , 2009, Ann. Oper. Res..

[254]  Nenad Mladenovic,et al.  Variable neighborhood search for the heaviest k-subgraph , 2009, Comput. Oper. Res..

[255]  Mostafa Zandieh,et al.  A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic , 2009, Expert Syst. Appl..

[256]  Ángel M. Pérez-Bellido,et al.  Curve fitting using heuristics and bio-inspired optimization algorithms for experimental data processing in chemistry , 2009 .

[257]  Martin W. P. Savelsbergh,et al.  Delivery strategies for blood products supplies , 2009, OR Spectr..

[258]  Renata Mansini,et al.  The traveling purchaser problem with budget constraint , 2009, Comput. Oper. Res..

[259]  Saïd Salhi,et al.  A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem , 2009, Eur. J. Oper. Res..

[260]  Christos D. Tarantilis,et al.  A hybrid evolutionary algorithm for the job shop scheduling problem , 2009, J. Oper. Res. Soc..

[261]  Kerstin Dächert,et al.  Allocation search methods for a generalized class of location-allocation problems , 2009, Eur. J. Oper. Res..

[262]  Abraham P. Punnen,et al.  Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem , 2009, Discret. Optim..

[263]  A. Rahimi-Vahed,et al.  A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem , 2009 .

[264]  Richard F. Hartl,et al.  Metaheuristics for the bi-objective orienteering problem , 2009, Swarm Intelligence.

[265]  Gregorio Tirado,et al.  The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..

[266]  Reza Tavakkoli-Moghaddam,et al.  A memetic algorithm for the flexible flow line scheduling problem with processor blocking , 2009, Comput. Oper. Res..

[267]  Pedro Martins,et al.  VNS and second order heuristics for the min-degree constrained minimum spanning tree problem , 2009, Comput. Oper. Res..

[268]  Bassem Jarboui,et al.  An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems , 2009, Comput. Oper. Res..

[269]  Francesco Maffioli,et al.  Edge-swapping algorithms for the minimum fundamental cycle basis problem , 2009, Math. Methods Oper. Res..

[270]  M. Brusco,et al.  Variable Neighborhood Search Heuristics for Selecting a Subset of Variables in Principal Component Analysis , 2009 .

[271]  Martin Josef Geiger,et al.  On the assignment of students to topics: A Variable Neighborhood Search approach , 2010 .

[272]  Frank Plastria,et al.  Alternating local search based VNS for linear classification , 2010, Ann. Oper. Res..

[273]  Jorge Pinho de Sousa,et al.  A multiobjective metaheuristic for a mean-risk multistage capacity investment problem , 2010, J. Heuristics.

[274]  Dragan Urosevic,et al.  Variable neighbourhood search for bandwidth reduction , 2008, Eur. J. Oper. Res..

[275]  Ramón Alvarez-Valdés,et al.  Neighborhood structures for the container loading problem: a VNS implementation , 2010, J. Heuristics.

[276]  Juan José Salazar González,et al.  Hybridization of very large neighborhood search for ready-mixed concrete delivery problems , 2010, Comput. Oper. Res..

[277]  Mustapha Aouchiche,et al.  Nordhaus-Gaddum relations for proximity and remoteness in graphs , 2010, Comput. Math. Appl..

[278]  Chun-Lung Chen,et al.  Iterated hybrid metaheuristic algorithms for unrelated parallel machines problem with unequal ready times and sequence-dependent setup times , 2012 .

[279]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.