Variable neighbourhood search: Methods and applications

4OR

Volumn 6, Issue 4, 2008, Pages 319-360

  Hansen, Pierre ^a   Mladenović, Nenad ^b   Moreno Pérez, José A ^c  

^a HEC MONTRÉAL   (Canada)

^b BRUNEL UNIVERSITY   (United Kingdom)

^c UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

Heuristic; Metaheuristic; Variable neighbourhood search

Indexed keywords

EID: 57049126157     PISSN: 16194500     EISSN: 16142411     Source Type: Journal    
DOI: 10.1007/s10288-008-0089-1     Document Type: Article

References (277)

1. A Abraham H Liu M Zhao 2008 Particle swarm scheduling for work-flow applications in distributed computing environments Stud Comput Intell 128 327 342
2. E Alba E Domínguez 2006 Comparative analysis of modern optimization tools for the p-median problem Stat Comput 16 3 251 260
3. B Almada-Lobo JF Oliveira MA Carravilla 2008 Production planning and scheduling in the glass container industry: A VNS approach Int J Prod Econ 114 1 363 375
4. DJ Aloise D Aloise CTM Rocha CC Ribeiro JC Ribeiro LSS Moura 2006 Scheduling workover rigs for onshore oil production Discrete Appl Math 154 5 695 702
5. A Andreatta C Ribeiro 2002 Heuristics for the phylogeny problem J Heuristics 8 4 429 447
6. D Anghinolfi M Paolucci 2007 Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach Comput Oper Res 34 11 3471 3490
7. M Aouchiche P Hansen 2005 Recherche à voisinage variable de graphes extrèmes 13. À propos de la maille (French) RAIRO Oper Res 39 275 293
8. M Aouchiche P Hansen 2007 Automated results and conjectures on average distance in graphs Graph Theory Paris Trends Math VI 21 36
9. M Aouchiche P Hansen 2007 On a conjecture about the Randic index Discrete Math 307 262 265
10. Aouchiche M, Hansen P (2008) Nordhaus-Gaddum relations for proximity and remoteness in graphs. Les Cahiers du GERAD G-2008-36
11. Aouchiche M, Hansen P (2009) Bounding average distance using minimum degree. Graph Theory Notes New York (in press)
12. M Aouchiche G Caporossi D Cvetković 2001 Variable neighborhood search for extremal graphs 8. Variations on Graffiti 105 Congressus Numerantium 148 129 144
13. 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
14. M Aouchiche G Caporossi P Hansen M Laffay 2005 AutoGraphiX: a survey Electron Notes Discrete Math 22 515 520
15. M Aouchiche P Hansen M Zheng 2006 Variable neighborhood search for extremal graphs 18. Conjectures and results about the Randic index MATCH Commun Math Comput Chem 56 3 541 550
16. M Aouchiche G Caporossi P Hansen 2007 Variable Neighborhood search for extremal graphs 20. Automated comparison of graph invariants. MATCH Commun Math Comput Chem 58 2 365 384
17. Aouchiche M, Caporossi G, Hansen P (2007b) Variable neighborhood search for extremal graphs 27. Families of extremal graphs. Les Cahiers du GERAD G-2007-87
18. 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 G-2007-55
19. M Aouchiche P Hansen M Zheng 2007 Variable Neighborhood Search for Extremal Graphs 19. Further Conjectures and Results about the Randic Index. MATCH Commun Math Comput Chem 58 1 83 102
20. M Aouchiche FK Bell D Cvetković P Hansen P Rowlinson SK Simić D Stevanović 2008 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
21. M Aouchiche G Brinkmann P Hansen 2008 Variable neighborhood search for extremal graphs 21. Conjectures and results about the independence number Discrete Appl Math 156 13 2530 2542
22. 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)
23. 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)
24. C Archetti A Hertz MG Speranza 2007 Metaheuristics for the team orienteering problem J Heuristics 13 1 49 76
25. C Audet J Brimberg P Hansen N Mladenović 2004 Pooling problem: alternate formulation and solution methods Manage Sci 50 761 776
26. C Audet V Báchard S Le Digabel 2008 Nonsmooth optimization through mesh adaptive direct search and variable neighborhood search J Global Optim 41 2 299 318
27. C Avanthay A Hertz N Zufferey 2003 A variable neighborhood search for graph coloring Eur J Oper Res 151 2 379 388
28. ME Aydin M Sevkli 2008 Sequential and parallel variable neighborhood search algorithms for job shop scheduling Stud Comput Intell 128 125 144
29. 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)
30. N Belacel P Hansen N Mladenović 2002 Fuzzy J-means: a new heuristic for fuzzy clustering Pattern Recognit 35 10 2193 2200
31. N Belacel M Čuperlović-Culf M Laflamme R Ouellette 2004 Fuzzy J-means and VNS methods for clustering genes from microarray data Bioinformatics 20 11 1690 1701
32. 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
33. N Belacel HB Raval AP Punnen 2007 Learning multicriteria fuzzy classification method PROAFTN from data Comput Oper Res 34 7 1885 1898
34. 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
35. Beltrán JD, Calderón JE, Jorge-Cabrera R, Moreno-Pérez JA, Moreno-Vega JM (2004) GRASP-VNS hybrid for the strip packing problem. In Hybrid Metaheuristics 2004, pp 79-90
36. S Benati 2008 Categorical data fuzzy clustering: an analysis of local search heuristics Comput Oper Res 35 3 766 775
37. S Benati P Hansen 2002 The maximum capture problem with random utilities: problem formulation and algorithms Eur J Oper Res 143 3 518 530
38. M Bischoff K Dächert 2008 Allocation search methods for a generalized class of location-allocation problems Eur J Oper Res 192 3 793 807
39. J Blazewicz E Pesch M Sterna F Werner 2005 Metaheuristics for late work minimization in two-machine flow shop with common due date Lect Notes Artif Intell 3698 222 234
40. J Blazewicz E Pesch M Sterna F Werner 2008 Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date Comput Oper Res 35 2 574 599
41. S Bock K Hoberg 2007 Detailed layout planning for irregularly-shaped machines with transportation path design Eur J Oper Res 177 2 693 718
42. V Bouffard JA Ferland 2007 Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem J Scheduling 10 6 375 386
43. O Bräysy 2003 A reactive variable neighborhood search for the vehicle routing problem with time windows INFORMS J Comput 15 4 347 368
44. J Brimberg N Mladenović 1996 A variable neighborhood algorithm for solving the continuous location-allocation problem Stud Locational Anal 10 1 12
45. J Brimberg P Hansen N Mladenović É Taillard 2000 Improvements and comparison of heuristics for solving the multisource Weber problem Oper Res 48 3 444 460
46. J Brimberg P Hansen K-W Lih N Mladenović M Breton 2003 An oil pipeline design problem Oper Res 51 2 228 239
47. J Brimberg N Mladenović S Salhi 2004 The multi-source Weber problem with constant opening cost J Oper Res Soc 55 640 646
48. J Brimberg P Hansen N Mladenović 2006 Decomposition strategies for large-scale continuous location-allocation problems IMA J Manage Math 17 307 316
49. J Brimberg D Urošević N Mladenović 2006 Variable neighborhood search for the vertex weighted k-cardinality tree problem Eur J Oper Res 171 1 74 84
50. J Brimberg P Hansen G Laporte N Mladenović D Uroš ević 2008 The maximum return-on-investment plant location problem with market share J Oper Res Soc 59 3 399 406
51. J Brimberg N Mladenović D Urošević 2008 Local and variable neighborhood search for the k-cardinality subgraph problem J Heuristics 14 5 501 517
52. M Brusco D Steinley 2007 A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices J Math Psychol 51 5 325 338
53. MJ Brusco D Steinley 2007 A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning Psychometrika 72 4 583 600
54. MJ Brusco H-F Köhn S Stahl 2008 Heuristic implementation of dynamic programming for matrix permutation problems in combinatorial data analysis Psychometrika 73 3 503 522
55. Burke EK, Kendall G (2005) Search methodologies. Introductory tutorials in optimization and decision support techniques. Springer, Berlin (2005)
56. EK Burke P Cowling R Keuthen 2001 Effective local and guided variable neighborhood search methods for the asymmetric travelling salesman problem Lect Notes Comput Sci 2037 203 212
57. 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 decision-making. Kluwer, Dordrecht, pp 153-172
58. EK Burke T Curtois G Post R Qu B Veltman 2008 A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem Eur J Oper Res 188 2 330 341
59. S Canuto M Resende C Ribeiro 2001 Local search with perturbations for the prize-collecting Steiner tree problem in graphs Networks 31 3 201 206
60. G Caporossi P Hansen 2000 Variable neighborhood search for extremal graphs 1. The AutoGraphiX system Discrete Math 212 29 44
61. G Caporossi P Hansen 2004 Variable neighborhood search for extremal graphs 5. Three ways to automate finding conjectures Discrete Math 276 1-3 81 94
62. G Caporossi D Cvetković I Gutman P Hansen 1999 Variable neighborhood search for extremal graphs 2. Finding graphs with extremal energy J Chem Inform Comput Sci 39 984 996
63. G Caporossi AA Dobrynin I Gutman P Hansen 1999 Trees with palindromic Hosoya polynomials Graph Theory Notes New York 37 10 16
64. G Caporossi I Gutman P Hansen 1999 Variable neighborhood search for extremal graphs 4. Chemical trees with extremal connectivity index Comput Chem 23 5 469 477
65. G Caporossi I Gutman P Hansen L Pavlović 2003 Graphs with maximum connectivity index Comput Biol Chem 27 85 90
66. G Caporossi D Alamargot D Chesnet 2004 Using the computer to study the dynamics of the handwriting processes Lect Notes Comput Sci 3245 242 254
67. F Carrabs J-F Cordeau G Laporte 2007 Variable neighbourhood search for the pickup and delivery traveling salesman problem with LIFO loading INFORMS J Comput 19 4 618 632
68. E Carrizosa B Martín-Barragán F Plastria D Romero Morales 2007 On the selection of the globally optimal prototype subset for nearest-neighbor classification INFORMS J Comput 19 3 470 479
69. Chen C-L, Chen C-L (2008) Hybrid metaheuristic for unrelated parallel machine scheduling with sequence-dependent setup times. Int J Adv Manufact Technol (in press). Published online: 26 August 2008. doi: 10.1007/s00170-008- 1692-1
70. Chyu C-C, Chen Z-J (2008) Scheduling jobs under constant period-by-period 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/s00170-008-1614-2
71. Claro J, de Sousa JP (2008) A multiobjective metaheuristic for a mean-risk multistage capacity investment problem. J Heuristics (in press). Published online: 24 July 2008. doi: 10.1007/s10732-008-9090-2
72. Consoli S, Darby-Dowman 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
73. MC Costa FR Monclar M Zrikem 2002 Variable neighborhood decomposition search for the optimization of power plant cable layout J Intell Manufact 13 5 353 365
74. P Cote T Wong R Sabourin 2005 A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem Lect Notes Comput Sci 3616 294 312
75. PI Cowling R Keuthen 2005 Embedded local search approaches for routing optimization Comput Oper Res 32 3 465 490
76. T Crainic M Gendreau P Hansen N Mladenović 2004 Cooperative parallel variable neighborhood search for the p-median J Heuristics 10 289 310
77. 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
78. D Cvetkovic S Simic G Caporossi P Hansen 2001 Variable neighborhood search for extremal graphs 3. On the largest eigenvalue of color-constrained trees Linear Multilinear Algebra 49 143 160
79. J Czogalla A Fink 2008 On the effectiveness of particle swarm optimization and variable neighborhood descent for the continuous flow-shop scheduling problem Stud Comput Intell 128 61 89
80. K Dahal S Remde P Cowling N Colledge 2008 Improving metaheuristic performance by evolving a variable fitness function Lect Notes Comput Sci 4972 170 181
81. Davidon WC (1959) Variable metric algorithm for minimization. Argonne National Laboratory Report ANL-5990
82. T Davidović P Hansen N Mladenović 2005 Permutation-based genetic, tabu, and variable neighborhood search heuristics for multiprocessor scheduling with communication delays Asia-Pacific J Oper Res 22 3 297 326
83. MR De Paula MG Ravetti GR Mateus PM Pardalos 2007 Solving parallel machines scheduling problems with sequence-dependent setup times using Variable Neighbourhood Search IMA J Manage Math 18 2 101 115
84. MC De Souza P Martins 2008 Skewed VNS enclosing second order algorithm for the degree constrained minimum spanning tree problem Eur J Oper Res 191 3 677 690
85. JR Degila B Sansò 2004 Topological design optimization of a Yottabit-per-second lattice network IEEE J Selected Areas Commun 22 9 1613 1625
86. A Del Pia C Filippi 2006 A variable neighborhood descent algorithm for a real waste collection problem with mobile depots Int Trans Oper Res 13 2 125 141
87. J Desrosiers N Mladenović D Villeneuve 2005 Design of balanced MBA student teams J Oper Res Soc 56 1 60 66
88. TCS Dias GF De Sousa EM Macambira LDAF Cabral MHC Fampa 2006 An efficient heuristic for the ring star problem Lect Notes Comput Sci 4007 24 35
89. P Domínguez-Marín S Nickel P Hansen N Mladenović 2005 Heuristic procedures for solving the discrete ordered median problem Ann Oper Res 136 1 145 173
90. Dražić M, Kovacevic-Vujcić V, Cangalović M, Mladenović N (2006) GLOB-A new VNS-based software for global optimization. In: Liberti L, Maculan N (eds) Global Optimization: from Theory to Implementation. Springer, Berlin, pp 135-144
91. M Dražić C Lavor N Maculan N Mladenović 2008 A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule Eur J Oper Res 185 3 1265 1273
92. Z Drezner PM Hahn ED Taillard 2005 Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods Ann Oper Res 139 1 65 94
93. Duarte A, Sanchez A, Fernandez F, Cabido R (2005) A low-level hybridization between memetic algorithm and VNS for the max-cut problem. GECCO 2005-Genetic and Evolutionary Computation Conference 999-1006
94. O Du Merle D Villeneuve J Desrosiers P Hansen 1999 Stabilized column generation Discrete Math 194 1-3 229 237
95. O Du Merle P Hansen B Jaumard N Mladenović 2000 An interior point algorithm for minimum sum-of-squares clustering SIAM J Sci Comput 21 1485 1505
96. J Fathali HT Kakhki 2006 Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases Eur J Oper Res 170 2 440 462
97. P Festa PM Pardalos MGC Resende CC Ribeiro 2002 Randomized heuristics for the MAX-CUT problem Optim Methods Softw 17 6 1033 1058
98. M Fischetti A Lodi 2003 Local branching Math Program 98 1-3 23 47
99. M Fischetti C Polo M Scantamburlo 2004 A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem Networks 44 2 61 72
100. R Fletcher MJD Powell 1963 Rapidly convergent descent method for minimization Comput J 6 163 168
101. K Fleszar KS Hindi 2002 New heuristics for one-dimensional bin-packing Comput Oper Res 29 821 839
102. K Fleszar KS Hindi 2004 Solving the resource-constrained project scheduling problem by a variable neighborhood search Eur J Oper Res 155 2 402 413
103. K Fleszar KS Hindi 2008 An effective VNS for the capacitated p-median problem Eur J Oper Res 191 3 612 622
104. 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
105. PW Fowler P Hansen G Caporossi A Soncini 2001 Variable neighborhood search for extremal graphs 7. Polyenes with maximum HOMO-LUMO gap Chem Phys Lett 49 143 146
106. C Gagné M Gravel WL Price 2005 Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems J Oper Res Soc 56 687 698
107. P Galinier A Hertz 2006 A survey of local search methods for graph coloring Comput Oper Res 33 9 2547 2562
108. J Gao L Sun M Gen 2008 A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Comput Oper Res 35 9 2892 2907
109. F García-López B Melián-Batista JA Moreno-Pérez JM Moreno-Vega 2002 The parallel variable neighborhood search for the p-median problem J Heuristics 8 3 375 388
110. CG García D Pérez-Brito V Campos R Martí 2006 Variable neighborhood search for the linear ordering problem Comput Oper Res 33 12 3549 3565
111. Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York
112. J-J Garroi P Goos K Sörensen 2008 A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation J Stat Plan Inference 139 1 30 44
113. H Gavranović 2008 Local search and suffix tree for car-sequencing problem with colors Eur J Oper Res 191 3 972 980
114. MJ Geiger W Wenger 2007 On the interactive resolution of multi-objective vehicle routing problems Lect Notes Comput Sci 4403 687 699
115. 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
116. Gill P, Murray W, Wright M (1981) Practical optimization. Academic Press, London
117. Glover, F, Kochenberger, G (eds) (2003) Handbook of Metaheuristics. Kluwer, Dordrecht
118. A Goel V Gruhn 2008 A general vehicle routing problem Eur J Oper Res 191 3 650 660
119. RE Griffith RA Stewart 1961 A nonlinear programming technique for the optimization of continuous processing systems Manage Sci 7 379 392
120. SR Gupta JS Smith 2006 Algorithms for single machine total tardiness scheduling with sequence dependent setups Eur J Oper Res 175 2 722 739
121. WJ Gutjahr S Katzensteiner P Reiter 2007 A VNS algorithm for noisy problems and its application to project portfolio analysis Lect Notes Comput Sci 4665 93 104
122. I Gutman O Miljković G Caporossi P Hansen 1999 Alkanes with small and large Randić connectivity indices Chem Phys Lett 306 366 372
123. I Gutman P Hansen H Mélot 2005 Variable neighborhood search for extremal graphs 10. Comparison of irregularity indices for chemical trees J Chem Inform Model 45 222 230
124. Han H, Ye J, Lv Q (2007) A VNS-ANT Algorithm to QAP. In: Third International Conference on Natural Computation, vol 3, pp 426-430
125. P Hansen 2002 Computers in Graph Theory Graph Theory Notes, New York XLIII 20 39
126. P Hansen 2005 How far is, should and could be conjecture-making in graph theory an automated process? Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69 189 229
127. P Hansen H Mélot 2002 Computers and discovery in algebraic graph theory Linear Algebra Appl 356 1-3 211 230
128. P Hansen H Mélot 2003 Variable neighborhood search for extremal graphs 6. Analysing bounds for the connectivity index J Chem Inform Comput Sci 43 1 14
129. P Hansen H Mélot 2005 Variable neighborhood search for extremal graphs 9. Bounding the irregularity of a graph Graphs Discov 69 253 264
130. P Hansen N Mladenović 1997 Variable neighborhood search for the p-median Location Sci 5 207 226
131. 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
132. P Hansen N Mladenović 2001 Variable neighborhood search: principles and applications Eur J Oper Res 130 449 467
133. P Hansen N Mladenović 2001 J-Means: a new local search heuristic for minimum sum-of-squares clustering Pattern Recognit 34 405 413
134. 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
135. Hansen P, Mladenović N (2003) Variable neighborhood search. In: Glover F, Kochenberger G (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp 145-184
136. 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
137. P Hansen N Mladenović 2006 First improvement may be better than best improvement: An empirical study Discrete Appl Math 154 802 817
138. P Hansen N Mladenović 2008 Complement to a comparative analysis of heuristics for the p-median problem Stat Comput 18 1 41 46
139. 1 -embeddability and related problems J Classification 24 2 251 275
140. P Hansen S Perron 2008 Merging the local and global approaches to probabilistic satisfiability Int J Approx Reason 47 2 125 140
141. P Hansen D Stevanović 2005 Variable neighborhood search for extremal graphs 15. On bags and bugs Discrete Appl Math 156 7 986 997
142. 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)
143. 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
144. P Hansen N Mladenović D Pérez-Brito 2001 Variable neighborhood decomposition search J Heuristics 7 4 335 350
145. P Hansen N Mladenović D Urošević 2004 Variable neighborhood search for the maximum clique Discrete Appl Math 145 1 117 125
146. P Hansen M Aouchiche G Caporossi H Mélot D Stevanović 2005 What forms do interesting conjectures have in graph theory? Graph Discov Dimacs Ser Discrete Math Theor Comput Sci 69 231 251
147. P Hansen H Mélot I Gutman 2005 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
148. P Hansen N Mladenović D Urošević 2006 Variable neighborhood search and local branching Comput Oper Res 33 10 3034 3045
149. P Hansen J Brimberg D Urošević N Mladenović 2007 Primal-dual variable neighborhood search for the simple plant location problem INFORMS J Comput 19 4 552 564
150. P Hansen J Lazić N Mladenović 2007 Variable neighbourhood search for colour image quantization IMA J Manage Math 18 2 207 221
151. P Hansen N Mladenović JA Moreno Pérez 2008 Variable neighborhood search Eur J Oper Res 191 3 593 595
152. P Hansen C Oguz N Mladenović 2008 Variable neighborhood search for minimum cost berth allocation Eur J Oper Res 191 3 636 649
153. D Haugland 2007 A bidirectional greedy heuristic for the subspace selection problem Lect Notes Comput Sci 4638 162 176
154. 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
155. 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/s00291-008-0134-7
156. A Hertz M Mittaz 2001 A variable neighborhood descent algorithm for the undirected capacitated arc routing problem Transp Sci 35 4 425 434
157. A Hertz M Plumettaz N Zufferey 2008 Variable space search for graph coloring Discrete Appl Math 156 13 2551 2560
158. A Higgins G Beashel A Harrison 2006 Scheduling of brand production and shipping within a sugar supply chain J Oper Res Soc 57 490 498
159. KS Hindi K Fleszar C Charalambous 2003 An effective heuristic for the CLSP with setup times J Oper Res Soc 54 5 490 498
160. H Höller B Melián S Voss 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
161. B Hu GR Raidl 2008 Effective neighborhood structures for the generalized traveling salesman problem Lect Notes Comput Sci 4972 36 47
162. B Hu M Leitner GR Raidl 2008 Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem J Heuristics 14 5 501 517
163. Imran A, Salhi S, Wassan NA (2008) A variable neighborhood-based 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
164. S Irnich B Funke T Grünert 2006 Sequential search and its application to vehicle-routing problems Comput Oper Res 33 8 2405 2429
165. MS Jabalameli A Ghaderi 2008 Hybrid algorithms for the uncapacitated continuous location-allocation problem The Int J Adv Manufact Technol 37 1-2 202 209
166. 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
167. A Joly Y Frein 2008 Heuristics for an industrial car sequencing problem considering paint and assembly shop objectives Comput Ind Eng 55 2 295 310
168. K Jornsten A Lokketangen 1997 Tabu search for weighted k-cardinality trees Asia-Pac J Oper Res 14 2 9 26
169. A Karam G Caporossi P Hansen 2007 Arbitrary-norm hyperplane separation by Variable Neighbourhood Search IMA J Manage Math 18 2 173 190
170. S Kawashimo H Ono K Sadakane M Yamashita 2006 DNA sequence design by dynamic neighborhood searches Lect Notes Comput Sci 4287 157 171
171. R Kolisch S Hartmann 2006 Experimental investigation of heuristics for resource-constrained project scheduling: An update European J Oper Res 174 1 23 37
172. S Kucherenko P Belotti L Liberti N Maculan 2007 New formulations for the Kissing number problem Discrete Appl Math 155 14 1837 1841
173. J Kytöjoki T Nuortio O Bräysy M Gendreau 2007 An efficient variable neighborhood search heuristic for very large scale vehicle routing problems Comput Oper Res 34 9 2743 2757
174. SD Lapierre AB Ruiz P Soriano 2004 Designing distribution networks: Formulations and solution heuristic Transp Sci 38 2 174 187
175. MA Lejeune 2006 A variable neighborhood decomposition search method for supply chain management planning problems Eur J Oper Res 175 2 959 976
176. Y-C Liang YC Chen 2007 Redundancy allocation of series-parallel systems using a variable neighborhood search algorithm Reliab Eng Syst Saf 92 3 323 331
177. Y-C Liang M-H Lo YC Chen 2007 Variable neighbourhood search for redundancy allocation problems IMA J Manage Math 18 2 135 156
178. CJ Liao CC Cheng 2007 A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date Comput Ind Eng 52 4 404 413
179. C-J Liao C-C Liao 2008 An ant colony optimisation algorithm for scheduling in agile manufacturing Int J Prod Res 46 7 1813 1824
180. CJ Liao T Chao-Tang P Luarn 2007 A discrete version of particle swarm optimization for flowshop scheduling problems Comput Oper Res 34 10 3099 3111
181. 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/s10898-007-9218-1
182. S-W Lin K-C Ying 2008 A hybrid approach for single-machine tardiness problems with sequence-dependent setup times J Oper Res Soc 59 8 1109 1119
183. A Ling C Xu L Tang 2008 A modified VNS metaheuristic for max-bisection problems J Comput Appl Math 220 1-2 413 421
184. H Liu A Abraham 2007 An hybrid fuzzy variable neighborhood particle swarm optimization algorithm for solving quadratic assignment problems J Universal Comput Sci 13 9 1309 1331
185. Liu S-C, Chung C-H (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/s10845-008-0101-9
186. HB Liu A Abraham O Choi SH Moon 2006 Variable neighborhood particle swarm optimization for multi-objective flexible job-shop scheduling problems Lect Notes Comput Sci 4247 197 204
187. S-X Liu L Liu T Zhang 2008 Variable neighborhood search for solving vehicle routing problems with backhauls and time windows J Northeast Univ 29 3 316 319
188. I Ljubic 2007 A hybrid VNS for connected facility location Lect Notes Comput Sci 4771 157 169
189. S Loudni P Boizumault 2008 Combining VNS with constraint programming for solving anytime optimization problems Eur J Oper Res 191 3 705 735
190. S Loudni P Boizumault P David 2006 On-line resources allocation for ATM networks with rerouting Comput Oper Res 33 10 2891 2917
191. A Lusa CN Potts 2008 A variable neighbourhood search algorithm for the constrained task allocation problem J Oper Res Soc 59 812 822
192. J Melechovsky C Prins R Calvo 2005 A metaheuristic to solve a location-routing problem with non-linear costs J Heuristics 11 5-6 375 391
193. B Melián 2006 Using memory to improve the VNS metaheuristic for the design of SDH/WDM networks Lect Notes Comput Sci 4030 82 93
194. B Melián N Mladenović 2007 Editorial IMA J Manage Math 18 2 99 100
195. Melián-Batista B, Höller H, Voss S (2008) Designing WDM networks by a variable neighborhood search. J Telecommun Inform Technol 4/2006:15-20
196. L Meric G Pesant S Pierre 2004 Variable neighborhood search for optical routing in networks using latin routers Ann Telecommun 59 3-4 261 286
197. Mladenović N (1995) A variable neighborhood algorithm - a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montréal, p 112
198. 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
199. N Mladenović P Hansen 1997 Variable neighborhood search Comput Oper Res 24 1097 1100
200. N Mladenović D Urošević 2003 Variable neighborhood search for the k-cardinality tree Appl Optim 86 481 500
201. N Mladenović M Labbé P Hansen 2003 Solving the p-center problem by Tabu search and Variable Neighborhood Search Networks 42 48 64
202. N Mladenović J Petrović V Kovačević- Vujčić M Čangalović 2003 Solving spread spectrum radar polyphase code design problem by tabu search and variable neighborhood search Eur J Oper Res 151 389 399
203. N Mladenović F Plastria D Urošević 2005 Reformulation descent applied to circle packing problems Comput Oper Res 32 2419 2434
204. N Mladenović J Brimberg P Hansen JA Moreno Pérez 2007 The p-median problem: a survey of metaheuristic approaches Eur J Oper Res 179 3 927 939
205. N Mladenović F Plastria D Uroševic 2007 Formulation space search for circle packing problems Lect Notes Comput Sci 4638 212 216
206. N Mladenović M Dražić V Kovačevic- Vujčić M Čangalović 2008 General variable neighborhood search for the continuous optimization Eur J Oper Res 191 3 753 770
207. R Montemanni DH Smith 2008 Construction of Constant GC-Content DNA Codes via a Variable Neighbourhood Search Algorithm J Math Model Algorithms 7 3 311 326
208. JA Moreno-Pérez JM Moreno-Vega I Rodríguez-Martín 2003 Variable neighborhood tabu search and its application to the median cycle problem Eur J Oper Res 151 2 365 378
209. Moreno-Pé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
210. JM Moreno-Vega B Melián 2008 Introduction to the special issue on variable neighborhood search J Heuristics 14 5 403 404
211. H Mori S Tsunokawa 2005 Variable neighborhood tabu search for capacitor placement in distribution systems IEEE Int Symp Circuits Syst 5 4747 4750
212. 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/s10845-008-0157-6
213. M Negreiros A Palhano 2006 The capacitated centred clustering problem Comput Oper Res 33 6 1639 1663
214. T Nuortio J Kytöjoki H Niska O Bräysy 2006 Improved route planning and scheduling of waste collection and transport Expert Syst Appl 30 2 223 232
215. Ochi LS, Silva MB, Drummond L (2001) Metaheuristics based on GRASP and VNS for solving traveling purchaser problem. MIC'2001, pp 489-494, Porto
216. Z Ognjanović S Midić N Mladenović 2005 A hybrid genetic and variable neighborhood descent for probabilistic SAT problem Lect Notes Comput Sci 3636 42 53
217. IH Osman S Ahmadi 2007 Guided construction search metaheuristics for the capacitated p-median problem with single source constraint J Oper Res Soc 58 1 100 114
218. J Pacheco S Casado L Nuñez 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
219. JA Pacheco S Casado JF Alegre A Álvarez 2008 Heuristic solutions for locating health resources IEEE Intell Syst 23 1 57 63
220. Q-K Pan W-H Wang J-Y Zhu 2007 Some meta-heuristics for no-wait flow shop problem Comput Integr Manufact Syst, CIMS 13 5 967 970
221. Q-K Pan W-H Wang J-Y Zhu B-H Zhao 2007 Hybrid heuristics based on particle swarm optimization and variable neighborhood search for job shop scheduling Comput Integr Manufact Syst, CIMS 13 2 323 328
222. Papadimitriou C (1994) Computational Complexity. Addison Wesley
223. DC Paraskevopoulos PP Repoussis CD Tarantilis G Ioannou GP Prastacos 2008 A reactive variable neighborhood tabu search for the heterogeneous fleet routing problem with time windows J Heuristics 14 5 425 455
224. Parreño F, Alvarez-Valdes 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/s10732-008-9081-3
225. D Pelta JR González JM Moreno-Vega 2008 A simple and fast heuristic for protein structure comparison BMC Bioinformatics 9 161
226. MP Pérez FA Rodríguez JM Moreno-Vega 2007 A hybrid VNS-path relinking for the p-hub median problem IMA J Manage Math 18 2 157 172
227. Plastria F, Mladenović N, Urošević D (2005) Variable neighborhood formulation space search for circle packing. 18th Mini Euro Conference VNS, Tenerife, Spain
228. Plastria F, De Bruyne S, Carrizosa E (2007) Alternating local search based VNS for linear classification. Available at Optimization-online as http://www.optimization-online.org/DB-HTML/2008/02/1910.html
229. M Polacek RF Hartl K Doerner M Reimann 2004 A variable neighborhood search for the multi depot vehicle routing problem with time windows J Heuristics 10 6 613 627
230. M Polacek KF Doerner RF Hartl G Kiechle M Reimann 2007 Scheduling periodic customer visits for a traveling salesperson Eur J Oper Res 179 3 823 837
231. M Polacek KF Doerner RF Hartl V Maniezzo 2008 A variable neighborhood search for the capacitated arc routing problem with intermediate facilities J Heuristics 14 5 405 423
232. Popper K (1959) The logic of scientific discovery. Hutchinson, London
233. M Prandtstetter GR Raidl 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
234. J Puchinger G Raidl 2008 Bringing order into the neighborhoods: relaxation guided variable neighborhood search J Heuristics 14 5 405 423
235. J Puchinger GR Raidl U Pferschy 2006 The core concept for the multidimensional knapsack problem Lect Notes Comput Sci 3906 195 208
236. B Qian L Wang DX Huang X Wang 2006 Multi-objective flow shop scheduling using differential evolution Lect Notes Control Inform Sci 345 1125 1136
237. Rahimi-Vahed A, Dangchi M, Rafiei H, Salimi E (2008) A novel hybrid multi-objective shuffled frog-leaping algorithm for a bi-criteria permutation flow shop scheduling problem. Int J Adv Manufact Technol (in press). Published online: 7 June 2008. doi: 10.1007/s00170-008-1558-6
238. Reeves, CR (eds) (1993) Modern heuristic techniques for combinatorial problems. Blackwell, Oxford, UK
239. G Reinelt 1991 TSLIB-a traveling salesman library ORSA J Comput 3 376 384
240. S Remde P Cowling K Dahal N Colledge 2007 Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling Lect Notes Comput Sci 4446 188 197
241. PP Repoussis DC Paraskevopoulos CD Tarantilis G Ioannou 2006 A reactive greedy randomized variable neighborhood tabu search for the vehicle routing problem with time windows Lect Notes Comput Sci 4030 124 138
242. PP Repoussis CD Tarantilis G Ioannouo 2007 A hybrid metaheuristic for a real life vehicle routing problem Lect Notes Comput Sci 4310 247 254
243. CC Ribeiro MC de Souza 2002 Variable neighborhood search for the degree-constrained minimum spanning tree problem Discrete Appl Math 118 1-2 43 54
244. CC Ribeiro DS Vianna 2005 A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure Int Trans Oper Res 12 3 325 338
245. CC Ribeiro E Uchoa R Werneck 2002 A hybrid GRASP with perturbations for the Steiner problem in graphs INFORMS J Comput 14 3 228 246
246. CC Ribeiro SL Martins I Rosseti 2007 Metaheuristics for optimization problems in computer communications Comput Commun 30 4 656 669
247. CC Ribeiro D Aloise TF Noronha C Rocha S Urrutia 2008 A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints Eur J Oper Res 191 3 981 992
248. CC Ribeiro D Aloise TF Noronha C Rocha S Urrutia 2008 An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem Eur J Oper Res 191 3 596 611
249. LM Rousseau M Gendreau G Pesant 2002 Using constraint-based operators to solve the vehicle routing problem with time windows J Heuristics 8 1 43 58
250. R Santana P Larrañaga JA Lozano 2008 Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem J Heuristics 14 5 519 547
251. Schmid V, Doerner KF, Hartl RF, Salazar-González JJ (2008) Hybridization of very large neighborhood search for ready-mixed concrete delivery problems Comput Oper Res (in press). Published online: 3 August 2008. doi: 10.1016/j.cor.2008.07.010
252. 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 G-2007-33
253. 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 G-2007-47
254. M Sevkli ME Aydin 2006 A variable neighbourhood search algorithm for job shop scheduling problems Lect Notes Comput Sci 3906 261 271
255. M Sevkli ME Aydin 2006 Variable Neighbourhood Search for job shop scheduling problems J Softw 1 2 34 39
256. M Sevkli ME Aydin 2007 Parallel variable neighbourhood search algorithms for job shop scheduling problems IMA J Manage Math 18 2 117 134
257. Z Sevkli FE Sevilgen 2006 Variable neighborhood search for the orienteering problem Lect Notes Comput Sci 4263 134 143
258. Z Sevkli FE Sevilgen 2008 A hybrid particle swarm optimization algorithm for function optimization Lect Notes Comput Sci 4974 585 595
259. D Stevanovic M Aouchiche P Hansen 2008 On the spectral radius of graphs with a given domination number Linear Algebra Appl 428 8-9 1854 1864
260. A Subramanian L Dos Anjos Formiga Cabral 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
261. K Tagawa T Ohtani T Igaki S Seki K Inoue 2007 Robust optimum design of SAW filters by the penalty function method Electrical Eng Jpn 158 3 45 54
262. MF Tasgetiren M Sevkli Y-C Liang G Gencyilmaz 2004 Particle swarm optimization algorithm for permutation flowshop sequencing problem Lect Notes Comput Sci 3172 382 389
263. MF Tasgetiren Y-C Liang M Sevkli G Gencyilmaz 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
264. AD Toksari E Güner 2007 Solving the unconstrained optimization problem by a variable neighborhood search J Math Anal Appl 328 2 1178 1187
265. Tseng C-T, Liao C-J, Huang K-L (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
266. D Urošević J Brimberg N Mladenović 2004 Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem Comput Oper Res 31 8 1205 1213
267. G Villa S Lozano J Racero D Canca 2006 A hybrid VNS/Tabu search algorithm for apportioning the European Parliament Lect Notes Comput Sci 3906 284 292
268. L Vogt CA Poojari JE Beasley 2007 A tabu search algorithm for the single vehicle routing allocation problem J Oper Res Soc 58 467 480
269. Wang X, Tang L (2008) A population-based 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
270. R Whitaker 1983 A fast algorithm for the greedy interchange of large-scale clustering and median location problems INFOR 21 95 108
271. J Wollenweber 2008 A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application OR Spectrum 30 4 655 673
272. F Xhafa 2007 A hybrid evolutionary heuristic for job scheduling on computational grids Stud Comput Intell 75 269 311
273. 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
274. V Yepes J Medina 2006 Economic heuristic optimization for heterogeneous fleet VRPHESTW J Transp Eng 132 4 303 311
275. C Zhang Z Lin Z Lin 2005 Variable neighborhood search with permutation distance for QAP Lect Notes Comput Sci 3684 81 88
276. QH Zhao S Chen CY Zang 2008 Model and algorithm for inventory/routing decision in a three-echelon logistics system Eur J Oper Res 191 3 627 635
277. 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