Variable Neighborhood Search : Methods and Applications

Variable neighborhood search (VNS) is a metaheuristic, or framework for building heuristics, based upon systematic change of neighborhoods both in a decent phase to find a local minimum, and in a perturbation phase to get out of the corresponding valley. It was first proposed in 1997 and since has rapidly developed both in its methods and its applications. Both of these aspects are thouroughly reviewed and a large bibliography is given.

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

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

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

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

[5]  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..

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

[7]  Mustapha Aouchiche,et al.  Variable Neighborhood Search for Extremal Graphs, 24. Results about the clique number , 2010, Stud. Inform. Univ..

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

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

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

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

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

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

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

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

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

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

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

[19]  Hadrien Mélot,et al.  Computers and discovery in algebraic graph theory , 2001 .

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

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

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

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

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

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

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

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

[28]  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..

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

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

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

[32]  Gary James Jason,et al.  The Logic of Scientific Discovery , 1988 .

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

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

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

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

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

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

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

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

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

[42]  Stefan Bock,et al.  Detailed layout planning for irregularly-shaped machines with transportation path design , 2007, Eur. J. Oper. Res..

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

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

[45]  Ajith Abraham,et al.  An Hybrid Fuzzy Variable Neighborhood Particle Swarm Optimization Algorithm for Solving Quadratic Assignment Problems , 2007, J. Univers. Comput. Sci..

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

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

[48]  A. D. Parreira,et al.  Variable Neighbourhood Search for Maximum Weight Satisfiability Problem , 2000 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[72]  J. Crispim,et al.  Reactive tabu search and variable neighbourhood descent applied to the vehicle routing problem with , 2001 .

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

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

[75]  Michel Gendreau,et al.  Metaheuristics in Combinatorial Optimization , 2022 .

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

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

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

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

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

[81]  E. Burke,et al.  Variable neighborhood search for nurse rostering problems , 2004 .

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

[83]  Pierre Hansen,et al.  First improvement may be better than best improvment: an empirical study , 2005 .

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

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

[86]  N. T. Hoai-Phuong,et al.  Optimization under Composite Monotonic Constraints and Constrained Optimization over the Efficient Set , 2006 .

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

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

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

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

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

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

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

[94]  Matteo Fischetti,et al.  Local branching , 2003, Math. Program..

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

[96]  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..

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

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

[99]  Nottingham Ng,et al.  A Hybrid Heuristic Ordering and Variable Neighbourhood Search for the Nurse Rostering Problem , 2005 .

[100]  P. Hansen,et al.  Variable neighbourhood search for extremal graphs , 1999 .

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

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

[103]  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..

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

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

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

[107]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with , 2007 .

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

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

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

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

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

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

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

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

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

[117]  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..

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

[119]  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.

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

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

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

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

[124]  Mustapha Aouchiche,et al.  Variable neighborhood search for extremal graphs.17. Futher conjectures and results about the index , 2009, Discuss. Math. Graph Theory.

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

[126]  Pierre Hansen,et al.  Variable Neighborhood Search for Extremal Graphs. 9. Bounding the Irregularity of a Graph , 2001, Graphs and Discovery.

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

[128]  Tatjana Davidovi.  EXHAUSTIVE LIST-SCHEDULING HEURISTIC FOR DENSE TASK GRAPHS* , 2000 .

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

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

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

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

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

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

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

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

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

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

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

[140]  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..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[158]  Nenad Mladenović,et al.  Variable Neighborhood Search for the Vertex Weighted k -Cardinality Tree , 2004 .

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

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

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

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

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

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

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

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

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

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

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

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

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

[172]  Pierre Hansen,et al.  Algorithms for l 1 -Embeddability and Related Problems , 2003 .

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

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

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

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

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

[178]  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..

[179]  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..

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

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

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

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

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

[185]  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..

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

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

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

[189]  Mustapha Aouchiche,et al.  Recherche à voisinage variable de graphes extrémaux 26. Nouveaux résultats sur la maille , 2009, RAIRO Oper. Res..

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

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

[192]  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..

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

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

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

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

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

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

[199]  Gilles Caporossi,et al.  On the (1, 2)-Spectral Spread of Fullerenes , 2001, Graphs and Discovery.

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

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

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

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

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

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

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

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

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

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

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

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

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

[213]  Christos D. Tarantilis,et al.  A Reactive Greedy Randomized Variable Neighborhood Tabu Search for the Vehicle Routing Problem with Time Windows , 2006, Hybrid Metaheuristics.

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

[215]  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..

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

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

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

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

[220]  Roberto Musmanno,et al.  Recent algorithmic advances for Arc Routing Problems , 2000, Comput. Oper. Res..

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

[222]  Nabil Belacel,et al.  HE VARIABLE NEIGHBORHOOD SEARCH METAHEURISTIC FOR FUZZY CLUSERING cDNA MICROARRAY GENE EXPRESSION DATA , 2003 .

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

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

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

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

[227]  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..

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

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

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

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

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

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

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

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

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

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

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

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

[240]  Sebastián Lozano,et al.  A Hybrid VNS/Tabu Search Algorithm for Apportioning the European Parliament , 2006, EvoCOP.