Variable neighbourhood search: methods and applications
 Pierre Hansen,
 Nenad Mladenović,
 José A. Moreno Pérez
 … show all 3 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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.
 Abraham A, Liu H, Zhao M (2008) Particle swarm scheduling for workflow applications in distributed computing environments. Stud Comput Intell 128: 327–342
 Alba E, Domínguez E (2006) Comparative analysis of modern optimization tools for the pmedian problem. Stat Comput 16(3): 251–260
 AlmadaLobo B, Oliveira JF, Carravilla MA (2008) Production planning and scheduling in the glass container industry: A VNS approach. Int J Prod Econ 114(1): 363–375
 Aloise DJ, Aloise D, Rocha CTM, Ribeiro CC, Ribeiro JC, Moura LSS (2006) Scheduling workover rigs for onshore oil production. Discrete Appl Math 154(5): 695–702
 Andreatta A, Ribeiro C (2002) Heuristics for the phylogeny problem. J Heuristics 8(4): 429–447
 Anghinolfi D, Paolucci M (2007) Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Comput Oper Res 34(11): 3471–3490
 Aouchiche M, Hansen P (2005) Recherche à voisinage variable de graphes extrèmes 13. À propos de la maille (French). RAIRO Oper Res 39: 275–293
 Aouchiche M, Hansen P (2007a) Automated results and conjectures on average distance in graphs. Graph Theory Paris Trends Math VI: 21–36
 Aouchiche M, Hansen P (2007b) On a conjecture about the Randic index. Discrete Math 307: 262–265
 Aouchiche M, Hansen P (2008) NordhausGaddum relations for proximity and remoteness in graphs. Les Cahiers du GERAD G200836
 Aouchiche M, Hansen P (2009) Bounding average distance using minimum degree. Graph Theory Notes New York (in press)
 Aouchiche M, Caporossi G, Cvetković D (2001) Variable neighborhood search for extremal graphs 8. Variations on Graffiti 105. Congressus Numerantium 148: 129–144
 Aouchiche M, Bonnefoy JM, Fidahoussen A, Caporossi G, Hansen P, Hiesse L, Lacheré J, Monhait A (2005) Variable neighborhood search for extremal graphs 14. The AutoGraphiX 2 system. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 281–309
 Aouchiche M, Caporossi G, Hansen P, Laffay M (2005b) AutoGraphiX: a survey. Electron Notes Discrete Math 22: 515–520
 Aouchiche M, Hansen P, Zheng M (2006) Variable neighborhood search for extremal graphs 18. Conjectures and results about the Randic index MATCH. Commun Math Comput Chem 56(3): 541–550
 Aouchiche M, Caporossi G, Hansen P (2007a) Variable Neighborhood search for extremal graphs 20. Automated comparison of graph invariants. MATCH. Commun Math Comput Chem 58(2): 365–384
 Aouchiche M, Caporossi G, Hansen P (2007b) Variable neighborhood search for extremal graphs 27. Families of extremal graphs. Les Cahiers du GERAD G200787
 Aouchiche M, Favaron O, Hansen P (2007c) Recherche à voisinage variable de graphes extrèmes 26. Nouveaux résultats sur la maille (French). Les Cahiers du GERAD G200755
 Aouchiche M, Hansen P, Zheng M (2007d) Variable Neighborhood Search for Extremal Graphs 19. Further Conjectures and Results about the Randic Index. MATCH. Commun Math Comput Chem 58(1): 83–102
 Aouchiche M, Bell FK, Cvetković D, Hansen P, Rowlinson P, Simić SK, Stevanović D (2008a) Variable neighborhood search for extremal graphs 16. Some conjectures related to the largest eigenvalue of a graph. Eur J Oper Res 191(3): 661–676
 Aouchiche M, Brinkmann G, Hansen P (2008b) Variable neighborhood search for extremal graphs 21. Conjectures and results about the independence number. Discrete Appl Math 156(13): 2530–2542
 Aouchiche M, Favaron O, Hansen P (2009a) Variable neighborhood search for extremal graphs 22. Extending bounds for independence to upper irredundance. Discrete Appl Math (in press)
 Aouchiche M, Hansen P, Stevanović D (2009b) Variable neighborhood search for extremal graphs 17. Further conjectures and results about the index Discusiones Mathematicae: Graph Theory (in press)
 Archetti C, Hertz A, Speranza MG (2007) Metaheuristics for the team orienteering problem. J Heuristics 13(1): 49–76
 Audet C, Brimberg J, Hansen P, Mladenović N (2004) Pooling problem: alternate formulation and solution methods. Manage Sci 50: 761–776
 Audet C, Báchard V, Le Digabel S (2008) Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search. J Global Optim 41(2): 299–318
 Avanthay C, Hertz A, Zufferey N (2003) A variable neighborhood search for graph coloring. Eur J Oper Res 151(2): 379–388
 Aydin ME, Sevkli M (2008) Sequential and parallel variable neighborhood search algorithms for job shop scheduling. Stud Comput Intell 128: 125–144
 Baum EB (1986) Toward practical ‘neural’ computation for combinatorial optimization problems. In: Denker J (ed) Neural networks for computing. American Institute of Physics, College Park (1986)
 Belacel N, Hansen P, Mladenović N (2002) Fuzzy Jmeans: a new heuristic for fuzzy clustering. Pattern Recognit 35(10): 2193–2200
 Belacel N, ČuperlovićCulf M, Laflamme M, Ouellette R (2004a) Fuzzy Jmeans and VNS methods for clustering genes from microarray data. Bioinformatics 20(11): 1690–1701
 Belacel N, ČuperlovićCulf M, Ouellette R, Boulassel MR (2004b) The variable neighborhood search metaheuristic for fuzzy clustering cDNA microarray gene expression data. In: Hamza MH (eds) Artificial Intelligence and Applications. Acta Press, Calgary
 Belacel N, Raval HB, Punnen AP (2007) Learning multicriteria fuzzy classification method PROAFTN from data. Comput Oper Res 34(7): 1885–1898
 Belhaiza S, de Abreu N, Hansen P, Oliveira C (2007) Variable neighborhood search for extremal graphs 11. Bounds on algebraic connectivity. In: Avis D, Hertz A, Marcotte O (eds) Graph Theory and Combinatorial Optimization, pp 1–16
 Beltrán JD, Calderón JE, JorgeCabrera R, MorenoPérez JA, MorenoVega JM (2004) GRASPVNS hybrid for the strip packing problem. In Hybrid Metaheuristics 2004, pp 79–90
 Benati S (2008) Categorical data fuzzy clustering: an analysis of local search heuristics. Comput Oper Res 35(3): 766–775
 Benati S, Hansen P (2002) The maximum capture problem with random utilities: problem formulation and algorithms. Eur J Oper Res 143(3): 518–530
 Bischoff M, Dächert K (2008) Allocation search methods for a generalized class of locationallocation problems. Eur J Oper Res 192(3): 793–807
 Blazewicz J, Pesch E, Sterna M, Werner F (2005) Metaheuristics for late work minimization in twomachine flow shop with common due date. Lect Notes Artif Intell 3698: 222–234
 Blazewicz J, Pesch E, Sterna M, Werner F (2008) Metaheuristic approaches for the twomachine flowshop problem with weighted late work criterion and common due date. Comput Oper Res 35(2): 574–599
 Bock S, Hoberg K (2007) Detailed layout planning for irregularlyshaped machines with transportation path design. Eur J Oper Res 177(2): 693–718
 Bouffard V, Ferland JA (2007) Improving simulated annealing with variable neighborhood search to solve the resourceconstrained scheduling problem. J Scheduling 10(6): 375–386
 Bräysy O (2003) A reactive variable neighborhood search for the vehicle routing problem with time windows. INFORMS J Comput 15(4): 347–368
 Brimberg J, Mladenović N (1996) A variable neighborhood algorithm for solving the continuous locationallocation problem. Stud Locational Anal 10: 1–12
 Brimberg J, Hansen P, Mladenović N, Taillard É (2000) Improvements and comparison of heuristics for solving the multisource Weber problem. Oper Res 48(3): 444–460
 Brimberg J, Hansen P, Lih KW, Mladenović N, Breton M (2003) An oil pipeline design problem. Oper Res 51(2): 228–239
 Brimberg J, Mladenović N, Salhi S (2004) The multisource Weber problem with constant opening cost. J Oper Res Soc 55: 640–646
 Brimberg J, Hansen P, Mladenović N (2006a) Decomposition strategies for largescale continuous location–allocation problems. IMA J Manage Math 17: 307–316
 Brimberg J, Urošević D, Mladenović N (2006b) Variable neighborhood search for the vertex weighted kcardinality tree problem. Eur J Oper Res 171(1): 74–84
 Brimberg J, Hansen P, Laporte G, Mladenović N, Urošević D (2008a) The maximum returnoninvestment plant location problem with market share. J Oper Res Soc 59(3): 399–406
 Brimberg J, Mladenović N, Urošević D (2008b) Local and variable neighborhood search for the kcardinality subgraph problem. J Heuristics 14(5): 501–517
 Brusco M, Steinley D (2007a) A variable neighborhood search method for generalized blockmodeling of twomode binary matrices. J Math Psychol 51(5): 325–338
 Brusco MJ, Steinley D (2007b) A comparison of heuristic procedures for minimum withincluster sums of squares partitioning. Psychometrika 72(4): 583–600
 Brusco MJ, Köhn HF, Stahl S (2008) Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis. Psychometrika 73(3): 503–522
 Burke EK, Kendall G (2005) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, Berlin (2005)
 Burke EK, Cowling P, Keuthen R (2001) Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem. Lect Notes Comput Sci 2037: 203–212
 Burke EK, De Causmaecker P, Petrovic S, Vanden Berghe G et al (2004) Variable neighborhood search for nurse rostering problems. In: Resende M (eds) Metaheuristics: computer decisionmaking. Kluwer, Dordrecht, pp 153–172
 Burke EK, Curtois T, Post G, Qu R, Veltman B (2008) A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. Eur J Oper Res 188(2): 330–341
 Canuto S, Resende M, Ribeiro C (2001) Local search with perturbations for the prizecollecting Steiner tree problem in graphs. Networks 31(3): 201–206
 Caporossi G, Hansen P (2000) Variable neighborhood search for extremal graphs 1. The AutoGraphiX system. Discrete Math 212: 29–44
 Caporossi G, Hansen P (2004) Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures. Discrete Math 276(1–3): 81–94
 Caporossi G, Cvetković D, Gutman I, Hansen P (1999a) Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy. J Chem Inform Comput Sci 39: 984–996
 Caporossi G, Dobrynin AA, Gutman I, Hansen P (1999b) Trees with palindromic Hosoya polynomials. Graph Theory Notes New York 37: 10–16
 Caporossi G, Gutman I, Hansen P (1999c) Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index. Comput Chem 23(5): 469–477
 Caporossi G, Gutman I, Hansen P, Pavlović L (2003) Graphs with maximum connectivity index. Comput Biol Chem 27: 85–90
 Caporossi G, Alamargot D, Chesnet D (2004) Using the computer to study the dynamics of the handwriting processes. Lect Notes Comput Sci 3245: 242–254
 Carrabs F, Cordeau JF, Laporte G (2007) Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J Comput 19(4): 618–632
 Carrizosa E, MartínBarragán B, Plastria F, Romero Morales D (2007) On the selection of the globally optimal prototype subset for nearestneighbor classification. INFORMS J Comput 19(3): 470–479
 Chen CL, Chen CL (2008) Hybrid metaheuristic for unrelated parallel machine scheduling with sequencedependent setup times. Int J Adv Manufact Technol (in press). Published online: 26 August 2008. doi:10.1007/s0017000816921
 Chyu CC, Chen ZJ (2008) Scheduling jobs under constant periodbyperiod resource availability to maximize project profit at a due date. Int J Adv Manufact Technol (in press). Published online: 18 July 2008. doi:10.1007/s0017000816142
 Claro J, de Sousa JP (2008) A multiobjective metaheuristic for a meanrisk multistage capacity investment problem. J Heuristics (in press). Published online: 24 July 2008. doi:10.1007/s1073200890902
 Consoli S, DarbyDowman K, Mladenović N, Moreno Pérez JA (2008) Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem. Eur J Oper Res. Available online 15 March 2008. doi:10.1016/j.ejor.2008.03.014
 Costa MC, Monclar FR, Zrikem M (2002) Variable neighborhood decomposition search for the optimization of power plant cable layout. J Intell Manufact 13(5): 353–365
 Cote P, Wong T, Sabourin R (2005) A hybrid multiobjective evolutionary algorithm for the uncapacitated exam proximity problem. Lect Notes Comput Sci 3616: 294–312
 Cowling PI, Keuthen R (2005) Embedded local search approaches for routing optimization. Comput Oper Res 32(3): 465–490
 Crainic T, Gendreau M, Hansen P, Mladenović N (2004) Cooperative parallel variable neighborhood search for the pmedian. J Heuristics 10: 289–310
 Crispim J, Brandao J (2001) Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In: MIC’2001, pp 631–636, Porto. 2001
 Cvetkovic D, Simic S, Caporossi G, Hansen P (2001) Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of colorconstrained trees. Linear Multilinear Algebra 49: 143–160
 Czogalla J, Fink A (2008) On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flowshop scheduling problem. Stud Comput Intell 128: 61–89
 Dahal K, Remde S, Cowling P, Colledge N (2008) Improving metaheuristic performance by evolving a variable fitness function. Lect Notes Comput Sci 4972: 170–181
 Davidon WC (1959) Variable metric algorithm for minimization. Argonne National Laboratory Report ANL5990
 Davidović T, Hansen P, Mladenović N (2005) Permutationbased genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays. AsiaPacific J Oper Res 22(3): 297–326
 De Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequencedependent setup times using Variable Neighbourhood Search. IMA J Manage Math 18(2): 101–115
 De Souza MC, Martins P (2008) Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem. Eur J Oper Res 191(3): 677–690
 Degila JR, Sansò B (2004) Topological design optimization of a Yottabitpersecond lattice network. IEEE J Selected Areas Commun 22(9): 1613–1625
 Del Pia A, Filippi C (2006) A variable neighborhood descent algorithm for a real waste collection problem with mobile depots. Int Trans Oper Res 13(2): 125–141
 Desrosiers J, Mladenović N, Villeneuve D (2005) Design of balanced MBA student teams. J Oper Res Soc 56(1): 60–66
 Dias TCS, De Sousa GF, Macambira EM, Cabral LDAF, Fampa MHC (2006) An efficient heuristic for the ring star problem. Lect Notes Comput Sci 4007: 24–35
 DomínguezMarín P, Nickel S, Hansen P, Mladenović N (2005) Heuristic procedures for solving the discrete ordered median problem. Ann Oper Res 136(1): 145–173
 Dražić M, KovacevicVujcić V, Cangalović M, Mladenović N (2006) GLOB—A new VNSbased software for global optimization. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 135–144
 Dražić M, Lavor C, Maculan N, Mladenović N (2008) A continuous variable neighborhood search heuristic for finding the threedimensional structure of a molecule. Eur J Oper Res 185(3): 1265–1273
 Drezner Z, Hahn PM, Taillard ED (2005) Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for metaheuristic methods. Ann Oper Res 139(1): 65–94
 Duarte A, Sanchez A, Fernandez F, Cabido R (2005) A lowlevel hybridization between memetic algorithm and VNS for the maxcut problem. GECCO 2005—Genetic and Evolutionary Computation Conference 999–1006
 Du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math 194(1–3): 229–237
 Du Merle O, Hansen P, Jaumard B, Mladenović N (2000) An interior point algorithm for minimum sumofsquares clustering. SIAM J Sci Comput 21: 1485–1505
 Fathali J, Kakhki HT (2006) Solving the pmedian problem with pos/neg weights by variable neighborhood search and some results for special cases. Eur J Oper Res 170(2): 440–462
 Festa P, Pardalos PM, Resende MGC, Ribeiro CC (2002) Randomized heuristics for the MAXCUT problem. Optim Methods Softw 17(6): 1033–1058
 Fischetti M, Lodi A (2003) Local branching. Math Program 98(1–3): 23–47
 Fischetti M, Polo C, Scantamburlo M (2004) A local branching heuristic for mixedinteger programs with 2level variables, with an application to a telecommunication network design problem. Networks 44(2): 61–72
 Fletcher R, Powell MJD (1963) Rapidly convergent descent method for minimization. Comput J 6: 163–168
 Fleszar K, Hindi KS (2002) New heuristics for onedimensional binpacking. Comput Oper Res 29: 821–839
 Fleszar K, Hindi KS (2004) Solving the resourceconstrained project scheduling problem by a variable neighborhood search. Eur J Oper Res 155(2): 402–413
 Fleszar K, Hindi KS (2008) An effective VNS for the capacitated pmedian problem. Eur J Oper Res 191(3): 612–622
 Fleszar K, Osman IH, Hindi KS (2008) A variable neighbourhood search algorithm for the open vehicle routing problem. Eur J Oper Res. Available online 22 November 2007. doi:10.1016/j.ejor.2007.06.064
 Fowler PW, Hansen P, Caporossi G, Soncini A (2001) Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMOLUMO gap. Chem Phys Lett 49: 143–146
 Gagné C, Gravel M, Price WL (2005) Using metaheuristic compromise programming for the solution of multipleobjective scheduling problems. J Oper Res Soc 56: 687–698
 Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput Oper Res 33(9): 2547–2562
 Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9): 2892–2907
 GarcíaLópez F, MeliánBatista B, MorenoPérez JA, MorenoVega JM (2002) The parallel variable neighborhood search for the pmedian problem. J Heuristics 8(3): 375–388
 García CG, PérezBrito D, Campos V, Martí R (2006) Variable neighborhood search for the linear ordering problem. Comput Oper Res 33(12): 3549–3565
 Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NPcompleteness. Freeman, New York
 Garroi JJ, Goos P, Sörensen K (2008) A variableneighbourhood search algorithm for finding optimal run orders in the presence of serial correlation. J Stat Plan Inference 139(1): 30–44
 Gavranović H (2008) Local search and suffix tree for carsequencing problem with colors. Eur J Oper Res 191(3): 972–980
 Geiger MJ, Wenger W (2007) On the interactive resolution of multiobjective vehicle routing problems. Lect Notes Comput Sci 4403: 687–699
 Ghiani G, Hertz A, Laporte G (2002) Recent algorithmic advances for arc routing problems. In: Kozan E, Ohuchir A (eds) Operations Research/Management Science at Work. Kluwer, Boston, pp 1–20
 Gill P, Murray W, Wright M (1981) Practical optimization. Academic Press, London
 Glover, F, Kochenberger, G (eds) (2003) Handbook of Metaheuristics. Kluwer, Dordrecht
 Goel A, Gruhn V (2008) A general vehicle routing problem. Eur J Oper Res 191(3): 650–660
 Griffith RE, Stewart RA (1961) A nonlinear programming technique for the optimization of continuous processing systems. Manage Sci 7: 379–392 CrossRef
 Gupta SR, Smith JS (2006) Algorithms for single machine total tardiness scheduling with sequence dependent setups. Eur J Oper Res 175(2): 722–739
 Gutjahr WJ, Katzensteiner S, Reiter P (2007) A VNS algorithm for noisy problems and its application to project portfolio analysis. Lect Notes Comput Sci 4665: 93–104
 Gutman I, Miljković O, Caporossi G, Hansen P (1999) Alkanes with small and large Randić connectivity indices. Chem Phys Lett 306: 366–372
 Gutman I, Hansen P, Mélot H (2005) Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees. J Chem Inform Model 45: 222–230
 Han H, Ye J, Lv Q (2007) A VNSANT Algorithm to QAP. In: Third International Conference on Natural Computation, vol 3, pp 426–430
 Hansen P (2002) Computers in Graph Theory. Graph Theory Notes, New York XLIII: 20–39
 Hansen P (2005) How far is, should and could be conjecturemaking in graph theory an automated process?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 189–229
 Hansen P, Mélot H (2002) Computers and discovery in algebraic graph theory. Linear Algebra Appl 356 (1–3): 211–230
 Hansen P, Mélot H (2003) Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index. J Chem Inform Comput Sci 43: 1–14
 Hansen P, Mélot H (2005) Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph. Graphs Discov 69: 253–264
 Hansen P, Mladenović N (1997) Variable neighborhood search for the pmedian. Location Sci 5: 207–226
 Hansen P, Mladenović N et al (1999) An introduction to variable neighborhood search. In: Voss S (eds) Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp 433–458
 Hansen P, Mladenović N (2001a) Variable neighborhood search: principles and applications. Eur J Oper Res 130: 449–467
 Hansen P, Mladenović N (2001b) JMeans: a new local search heuristic for minimum sumofsquares clustering. Pattern Recognit 34: 405–413
 Hansen P, Mladenović N (2001) Developments of variable neighborhood search. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Dordrecht, pp 415–440
 Hansen P, Mladenović N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 145–184
 Hansen P, Mladenović N (2005) Variable Neighbourhood Search. In: Burke EK, Kendall G (eds) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, pp 211–238
 Hansen P, Mladenović N (2006) First improvement may be better than best improvement: An empirical study. Discrete Appl Math 154: 802–817
 Hansen P, Mladenović N (2008) Complement to a comparative analysis of heuristics for the pmedian problem. Stat Comput 18(1): 41–46
 Hansen P, Perron S (2007) Algorithms for \({\mathcal {L}_1}\) embeddability and related problems. J Classification 24(2): 251–275
 Hansen P, Perron S (2008) Merging the local and global approaches to probabilistic satisfiability. Int J Approx Reason 47(2): 125–140
 Hansen P, Stevanović D (2005) Variable neighborhood search for extremal graphs 15. On bags and bugs. Discrete Appl Math 156(7): 986–997
 Hansen P, Vukičević D (2009) Variable neighborhood search for extremal graphs 23. On the Randic index and the chromatic number. Discrete Math (in press)
 Hansen P, Jaumard B, Mladenović N, Parreira A (2000) Variable neighborhood search for weighted maximum satisfiability problem. Les Cahiers du GERAD G–2000–62, HEC Montréal, Canada
 Hansen P, Mladenović N, PérezBrito D (2001) Variable neighborhood decomposition search. J Heuristics 7(4): 335–350
 Hansen P, Mladenović N, Urošević D (2004) Variable neighborhood search for the maximum clique. Discrete Appl Math 145(1): 117–125
 Hansen P, Aouchiche M, Caporossi G, Mélot H, Stevanović D (2005a) What forms do interesting conjectures have in graph theory?. Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69: 231–251
 Hansen P, Mélot H, Gutman I (2005b) Variable neighborhood search for extremal graphs 12. A note on the variance of bounded degrees in graphs. MATCH Commun Math Comput Chem 54: 221–232
 Hansen P, Mladenović N, Urošević D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10): 3034–3045
 Hansen P, Brimberg J, Urošević D, Mladenović N (2007a) Primaldual variable neighborhood search for the simple plant location problem. INFORMS J Comput 19(4): 552–564
 Hansen P, Lazić J, Mladenović N (2007b) Variable neighbourhood search for colour image quantization. IMA J Manage Math 18(2): 207–221
 Hansen P, Mladenović N, Moreno Pérez JA (2008a) Variable neighborhood search. Eur J Oper Res 191(3): 593–595
 Hansen P, Oguz C, Mladenović N (2008b) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res 191(3): 636–649
 Haugland D (2007) A bidirectional greedy heuristic for the subspace selection problem. Lect Notes Comput Sci 4638: 162–176
 Hemmelmayr VC, Doerner KF, Hartl RF (2008a) A variable neighborhood search heuristic for the periodic routing problems. Eur J Oper Res. Available online 13 November 2007. doi:10.1016/j.ejor.2007.08.048
 Hemmelmayr V, Doerner KF, Hartl RF, Savelsbergh MWP (2008b) Delivery strategies for blood products supplies OR Spectrum. Available online 19 March 2008. doi:10.1007/s0029100801347
 Hertz A, Mittaz M (2001) A variable neighborhood descent algorithm for the undirected capacitated arc routing problem. Transp Sci 35(4): 425–434
 Hertz A, Plumettaz M, Zufferey N (2008) Variable space search for graph coloring. Discrete Appl Math 156(13): 2551–2560
 Higgins A, Beashel G, Harrison A (2006) Scheduling of brand production and shipping within a sugar supply chain. J Oper Res Soc 57: 490–498
 Hindi KS, Fleszar K, Charalambous C (2003) An effective heuristic for the CLSP with setup times. J Oper Res Soc 54(5): 490–498
 Höller H, Melián B, Voss S (2008) Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks. Eur J Oper Res 191(3): 691–704
 Hu B, Raidl GR (2008) Effective neighborhood structures for the generalized traveling salesman problem. Lect Notes Comput Sci 4972: 36–47
 Hu B, Leitner M, Raidl GR (2008) Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J Heuristics 14(5): 501–517
 Imran A, Salhi S, Wassan NA (2008) A variable neighborhoodbased heuristic for the heterogeneous fleet vehicle routing problem. Eur J Oper Res (in press). Published online: 29 July 2008. doi:10.1016/j.ejor.2008.07.022
 Irnich S, Funke B, Grünert T (2006) Sequential search and its application to vehiclerouting problems. Comput Oper Res 33(8): 2405–2429
 Jabalameli MS, Ghaderi A (2008) Hybrid algorithms for the uncapacitated continuous locationallocation problem. The Int J Adv Manufact Technol 37(1–2): 202–209
 Jovanović D, Mladenović N, Ognjanović Z (2007) Variable neighborhood search for the probabilistic satisfiability problem. In: Doerner KF, Gendreau M, Greistorfer P, Gutjahr W, Hartl RF, Reimann M (eds) Metaheuristics. Progress in Complex Systems Optimization. Springer, Berlin, pp 173–188
 Joly A, Frein Y (2008) Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives. Comput Ind Eng 55(2): 295–310
 Jornsten K, Lokketangen A (1997) Tabu search for weighted kcardinality trees. AsiaPac J Oper Res 14(2): 9–26
 Karam A, Caporossi G, Hansen P (2007) Arbitrarynorm hyperplane separation by Variable Neighbourhood Search. IMA J Manage Math 18(2): 173–190
 Kawashimo S, Ono H, Sadakane K, Yamashita M (2006) DNA sequence design by dynamic neighborhood searches. Lect Notes Comput Sci 4287: 157–171
 Kolisch R, Hartmann S (2006) Experimental investigation of heuristics for resourceconstrained project scheduling: An update European. J Oper Res 174(1): 23–37
 Kucherenko S, Belotti P, Liberti L, Maculan N (2007) New formulations for the Kissing number problem. Discrete Appl Math 155(14): 1837–1841
 Kytöjoki J, Nuortio T, Bräysy O, Gendreau M (2007) An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9): 2743–2757
 Lapierre SD, Ruiz AB, Soriano P (2004) Designing distribution networks: Formulations and solution heuristic. Transp Sci 38(2): 174–187
 Lejeune MA (2006) A variable neighborhood decomposition search method for supply chain management planning problems. Eur J Oper Res 175(2): 959–976
 Liang YC, Chen YC (2007) Redundancy allocation of seriesparallel systems using a variable neighborhood search algorithm. Reliab Eng Syst Saf 92(3): 323–331
 Liang YC, Lo MH, Chen YC (2007) Variable neighbourhood search for redundancy allocation problems. IMA J Manage Math 18(2): 135–156
 Liao CJ, Cheng CC (2007) A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Comput Ind Eng 52(4): 404–413
 Liao CJ, Liao CC (2008) An ant colony optimisation algorithm for scheduling in agile manufacturing. Int J Prod Res 46(7): 1813–1824
 Liao CJ, ChaoTang T, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34(10): 3099–3111
 Liberti L, Lavor C, Maculan N, Marinelli F (2008) Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J Global Optim. Available online 8 August 2007. doi:10.1007/s1089800792181
 Lin SW, Ying KC (2008) A hybrid approach for singlemachine tardiness problems with sequencedependent setup times. J Oper Res Soc 59(8): 1109–1119
 Ling A, Xu C, Tang L (2008) A modified VNS metaheuristic for maxbisection problems. J Comput Appl Math 220(1–2): 413–421
 Liu H, Abraham A (2007) An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems. J Universal Comput Sci 13(9): 1309–1331
 Liu SC, Chung CH (2008) A heuristic method for the vehicle routing problem with backhauls and inventory. J Intell Manufact (in press). Published online: 8 April 2008. doi:10.1007/s1084500801019
 Liu HB, Abraham A, Choi O, Moon SH (2006) Variable neighborhood particle swarm optimization for multiobjective flexible jobshop scheduling problems. Lect Notes Comput Sci 4247: 197–204
 Liu SX, Liu L, Zhang T (2008) Variable neighborhood search for solving vehicle routing problems with backhauls and time windows. J Northeast Univ 29(3): 316–319
 Ljubic I (2007) A hybrid VNS for connected facility location. Lect Notes Comput Sci 4771: 157–169
 Loudni S, Boizumault P (2008) Combining VNS with constraint programming for solving anytime optimization problems. Eur J Oper Res 191(3): 705–735
 Loudni S, Boizumault P, David P (2006) Online resources allocation for ATM networks with rerouting. Comput Oper Res 33(10): 2891–2917
 Lusa A, Potts CN (2008) A variable neighbourhood search algorithm for the constrained task allocation problem. J Oper Res Soc 59: 812–822
 Melechovsky J, Prins C, Calvo R (2005) A metaheuristic to solve a locationrouting problem with nonlinear costs. J Heuristics 11(5–6): 375–391
 Melián B (2006) Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks. Lect Notes Comput Sci 4030: 82–93
 Melián B, Mladenović N (2007) Editorial. IMA J Manage Math 18(2): 99–100
 MeliánBatista B, Höller H, Voss S (2008) Designing WDM networks by a variable neighborhood search. J Telecommun Inform Technol 4/2006:15–20
 Meric L, Pesant G, Pierre S (2004) Variable neighborhood search for optical routing in networks using latin routers. Ann Telecommun 59(3–4): 261–286
 Mladenović N (1995) A variable neighborhood algorithm – a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montréal, p 112
 Mladenović N (2005) Formulation space search—a new approach to optimization (plenary talk). In: Vuleta J (eds) Proceedings of XXXII SYMOPIS’05. Vrnjacka Banja, Serbia, p 3
 Mladenović N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24: 1097–1100
 Mladenović N, Urošević D (2003) Variable neighborhood search for the kcardinality tree. Appl Optim 86: 481–500
 Mladenović N, Labbé M, Hansen P (2003a) Solving the pcenter problem by Tabu search and Variable Neighborhood Search. Networks 42: 48–64
 Mladenović N, Petrović J, KovačevićVujčić V, Čangalović M (2003b) Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search. Eur J Oper Res 151: 389–399
 Mladenović N, Plastria F, Urošević D (2005) Reformulation descent applied to circle packing problems. Comput Oper Res 32: 2419–2434
 Mladenović N, Brimberg J, Hansen P, Moreno Pérez JA (2007a) The pmedian problem: a survey of metaheuristic approaches. Eur J Oper Res 179(3): 927–939
 Mladenović N, Plastria F, Uroševic D (2007b) Formulation space search for circle packing problems. Lect Notes Comput Sci 4638: 212–216
 Mladenović N, Dražić M, KovačevicVujčić V, Čangalović M (2008) General variable neighborhood search for the continuous optimization. Eur J Oper Res 191(3): 753–770
 Montemanni R, Smith DH (2008) Construction of Constant GCContent DNA Codes via a Variable Neighbourhood Search Algorithm. J Math Model Algorithms 7(3): 311–326
 MorenoPérez JA, MorenoVega JM, RodríguezMartín I (2003) Variable neighborhood tabu search and its application to the median cycle problem. Eur J Oper Res 151(2): 365–378
 MorenoPérez JA, Hansen P, Mladenović N (2005) Parallel variable neighborhood search. In: Alba E (eds) Parallel metaheuristics: a new class of algorithms. Wiley, New York
 MorenoVega JM, Melián B (2008) Introduction to the special issue on variable neighborhood search. J Heuristics 14(5): 403–404
 Mori H, Tsunokawa S (2005) Variable neighborhood tabu search for capacitor placement in distribution systems. IEEE Int Symp Circuits Syst 5: 4747–4750
 Naderi B, Zandieh M, Fatemi Ghomi SMT (2008) A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling. J Intell Manufact (in press). Published online: 31 August 2008. doi:10.1007/s1084500801576
 Negreiros M, Palhano A (2006) The capacitated centred clustering problem. Comput Oper Res 33(6): 1639–1663
 Nuortio T, Kytöjoki J, Niska H, Bräysy O (2006) Improved route planning and scheduling of waste collection and transport. Expert Syst Appl 30(2): 223–232
 Ochi LS, Silva MB, Drummond L (2001) Metaheuristics based on GRASP and VNS for solving traveling purchaser problem. MIC’2001, pp 489–494, Porto
 Ognjanović Z, Midić S, Mladenović N (2005) A hybrid genetic and variable neighborhood descent for probabilistic SAT problem. Lect Notes Comput Sci 3636: 42–53 CrossRef
 Osman IH, Ahmadi S (2007) Guided construction search metaheuristics for the capacitated pmedian problem with single source constraint. J Oper Res Soc 58(1): 100–114
 Pacheco J, Casado S, Nuñez L (2007) Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients. IMA J Manage Math 18(2): 191–206
 Pacheco JA, Casado S, Alegre JF, Álvarez A (2008) Heuristic solutions for locating health resources. IEEE Intell Syst 23(1): 57–63
 Pan QK, Wang WH, Zhu JY (2007a) Some metaheuristics for nowait flow shop problem. Comput Integr Manufact Syst, CIMS 13(5): 967–970
 Pan QK, Wang WH, Zhu JY, Zhao BH (2007b) Hybrid heuristics based on particle swarm optimization and variable neighborhood search for job shop scheduling. Comput Integr Manufact Syst, CIMS 13(2): 323–328
 Papadimitriou C (1994) Computational Complexity. Addison Wesley
 Paraskevopoulos DC, Repoussis PP, Tarantilis CD, Ioannou G, Prastacos GP (2008) A reactive variable neighborhood tabu search for the heterogeneous fleet routing problem with time windows. J Heuristics 14(5): 425–455
 Parreño F, AlvarezValdes R, Oliveira JF, Tamarit JM (2008) Neighborhood structures for the container loading problem: a VNS implementation. J Heuristics (in press). Published online: 24 May 2008. doi:10.1007/s1073200890813
 Pelta D, González JR, MorenoVega JM (2008) A simple and fast heuristic for protein structure comparison. BMC Bioinformatics 9: 161
 Pérez MP, Rodríguez FA, MorenoVega JM (2007) A hybrid VNSpath relinking for the phub median problem. IMA J Manage Math 18(2): 157–172
 Plastria F, Mladenović N, Urošević D (2005) Variable neighborhood formulation space search for circle packing. 18th Mini Euro Conference VNS, Tenerife, Spain
 Plastria F, De Bruyne S, Carrizosa E (2007) Alternating local search based VNS for linear classification. Available at Optimizationonline as http://www.optimizationonline.org/DB_HTML/2008/02/1910.html
 Polacek M, Hartl RF, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6): 613–627
 Polacek M, Doerner KF, Hartl RF, Kiechle G, Reimann M (2007) Scheduling periodic customer visits for a traveling salesperson. Eur J Oper Res 179(3): 823–837
 Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5): 405–423
 Popper K (1959) The logic of scientific discovery. Hutchinson, London
 Prandtstetter M, Raidl GR (2008) An integer linear programming approach and a hybrid variable neighborhood search for the car sequencing problem. Eur J Oper Res 191(3): 1004–1022
 Puchinger J, Raidl G (2008) Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J Heuristics 14(5): 405–423
 Puchinger J, Raidl GR, Pferschy U (2006) The core concept for the multidimensional knapsack problem. Lect Notes Comput Sci 3906: 195–208
 Qian B, Wang L, Huang DX, Wang X (2006) Multiobjective flow shop scheduling using differential evolution. Lect Notes Control Inform Sci 345: 1125–1136
 RahimiVahed A, Dangchi M, Rafiei H, Salimi E (2008) A novel hybrid multiobjective shuffled frogleaping algorithm for a bicriteria permutation flow shop scheduling problem. Int J Adv Manufact Technol (in press). Published online: 7 June 2008. doi:10.1007/s0017000815586
 Reeves, CR (eds) (1993) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford, UK
 Reinelt G (1991) TSLIB—a traveling salesman library. ORSA J Comput 3: 376–384
 Remde S, Cowling P, Dahal K, Colledge N (2007) Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. Lect Notes Comput Sci 4446: 188–197
 Repoussis PP, Paraskevopoulos DC, Tarantilis CD, Ioannou G (2006) A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows. Lect Notes Comput Sci 4030: 124–138
 Repoussis PP, Tarantilis CD, Ioannouo G (2007) A hybrid metaheuristic for a real life vehicle routing problem. Lect Notes Comput Sci 4310: 247–254
 Ribeiro CC, de Souza MC (2002) Variable neighborhood search for the degreeconstrained minimum spanning tree problem. Discrete Appl Math 118(1–2): 43–54
 Ribeiro CC, Vianna DS (2005) A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure. Int Trans Oper Res 12(3): 325–338
 Ribeiro CC, Uchoa E, Werneck R (2002) A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J Comput 14(3): 228–246
 Ribeiro CC, Martins SL, Rosseti I (2007) Metaheuristics for optimization problems in computer communications. Comput Commun 30(4): 656–669
 Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008a) A hybrid heuristic for a multiobjective reallife car sequencing problem with painting and assembly line constraints. Eur J Oper Res 191(3): 981–992
 Ribeiro CC, Aloise D, Noronha TF, Rocha C, Urrutia S (2008b) An efficient implementation of a VNS/ILS heuristic for a reallife car sequencing problem. Eur J Oper Res 191(3): 596–611
 Rousseau LM, Gendreau M, Pesant G (2002) Using constraintbased operators to solve the vehicle routing problem with time windows. J Heuristics 8(1): 43–58
 Santana R, Larrañaga P, Lozano JA (2008) Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem. J Heuristics 14(5): 519–547
 Schmid V, Doerner KF, Hartl RF, SalazarGonzález JJ (2008) Hybridization of very large neighborhood search for readymixed concrete delivery problems Comput Oper Res (in press). Published online: 3 August 2008. doi:10.1016/j.cor.2008.07.010
 Sedlar J, Vukicevic D, Aouchiche M, Hansen P (2007a) Variable neighborhood search for extremal graphs 24. Conjectures and results about the clique number Les Cahiers du GERAD G200733
 Sedlar J, Vukicevic D, Aouchiche M, Hansen P (2007b) Variable neighborhood search for extremal graphs 25. Products of connectivity and distance measures Les Cahiers du GERAD G200747
 Sevkli M, Aydin ME (2006a) A variable neighbourhood search algorithm for job shop scheduling problems. Lect Notes Comput Sci 3906: 261–271
 Sevkli M, Aydin ME (2006b) Variable Neighbourhood Search for job shop scheduling problems. J Softw 1(2): 34–39
 Sevkli M, Aydin ME (2007) Parallel variable neighbourhood search algorithms for job shop scheduling problems. IMA J Manage Math 18(2): 117–134
 Sevkli Z, Sevilgen FE (2006) Variable neighborhood search for the orienteering problem. Lect Notes Comput Sci 4263: 134–143
 Sevkli Z, Sevilgen FE (2008) A hybrid particle swarm optimization algorithm for function optimization. Lect Notes Comput Sci 4974: 585–595
 Stevanovic D, Aouchiche M, Hansen P (2008) On the spectral radius of graphs with a given domination number. Linear Algebra Appl 428(8–9): 1854–1864
 Subramanian A, Dos Anjos Formiga Cabral L (2008) An ILS based heuristic for the vehicle routing problem with simultaneous pickup and delivery and time limit. Lect Notes Comput Sci 4972: 135–146
 Tagawa K, Ohtani T, Igaki T, Seki S, Inoue K (2007) Robust optimum design of SAW filters by the penalty function method. Electrical Eng Jpn 158(3): 45–54
 Tasgetiren MF, Sevkli M, Liang YC, Gencyilmaz G (2004) Particle swarm optimization algorithm for permutation flowshop sequencing problem. Lect Notes Comput Sci 3172: 382–389
 Tasgetiren MF, Liang YC, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177(3): 1930–1947
 Toksari AD, Güner E (2007) Solving the unconstrained optimization problem by a variable neighborhood search. J Math Anal Appl 328(2): 1178–1187
 Tseng CT, Liao CJ, Huang KL (2008) Minimizing total tardiness on a single machine with controllable processing times. Comput Oper Res (in press). Published online: 27 May 2008. doi:10.1016/j.cor.2008.05.009
 Urošević D, Brimberg J, Mladenović N (2004) Variable neighborhood decomposition search for the edge weighted kcardinality tree problem. Comput Oper Res 31(8): 1205–1213
 Villa G, Lozano S, Racero J, Canca D (2006) A hybrid VNS/Tabu search algorithm for apportioning the European Parliament. Lect Notes Comput Sci 3906: 284–292
 Vogt L, Poojari CA, Beasley JE (2007) A tabu search algorithm for the single vehicle routing allocation problem. J Oper Res Soc 58: 467–480
 Wang X, Tang L (2008) A populationbased variable neighborhood search for the single machine total weighted tardiness problem. Comput Oper Res (in press). Published online: 31 July 2008. doi:10.1016/j.cor.2008.07.009
 Whitaker R (1983) A fast algorithm for the greedy interchange of largescale clustering and median location problems. INFOR 21: 95–108
 Wollenweber J (2008) A multistage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application. OR Spectrum 30(4): 655–673
 Xhafa F (2007) A hybrid evolutionary heuristic for job scheduling on computational grids. Stud Comput Intell 75: 269–311
 Yang J, Zhang J, Aydin ME, Wu JY (2007) A novel programming model and optimisation algorithms for WCDMA networks. IEEE Vehicular Technology Conference, pp 1182–1187
 Yepes V, Medina J (2006) Economic heuristic optimization for heterogeneous fleet VRPHESTW. J Transp Eng 132(4): 303–311
 Zhang C, Lin Z, Lin Z (2005) Variable neighborhood search with permutation distance for QAP. Lect Notes Comput Sci 3684: 81–88
 Zhao QH, Chen S, Zang CY (2008) Model and algorithm for inventory/routing decision in a threeechelon logistics system. Eur J Oper Res 191(3): 627–635
 Zobolas GI, Tarantilis CD, Ioannou G (2008) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res. Available online 8 February 2008. doi:10.1016/j.cor.2008.01.007
 Title
 Variable neighbourhood search: methods and applications
 Journal

4OR
Volume 6, Issue 4 , pp 319360
 Cover Date
 20081201
 DOI
 10.1007/s1028800800891
 Print ISSN
 16194500
 Online ISSN
 16142411
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Keywords

 Variable neighbourhood search
 Metaheuristic
 Heuristic
 90C59
 68T20
 68W25
 Authors

 Pierre Hansen ^{(1)}
 Nenad Mladenović ^{(2)}
 José A. Moreno Pérez ^{(3)}
 Author Affiliations

 1. GERAD and HEC Montréal, Montréal, QC, H3T 2A7, Canada
 2. GERAD and School of Mathematics, Brunel University, Uxbridge, UK
 3. IUDR and Dep. Estadística, I.O. y Computación, University of La Laguna, 38271, La Laguna, Spain