Advertisement

Variable Neighborhood Search

  • Pierre Hansen
  • Nenad Mladenović
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 57)

Abstract

Variable neighborhood search (VNS) is a recent metaheuristic for solving combinatorial and global optimization problems whose basic idea is systematic change of neighborhood within a local search. In this survey paper we present basic rules of VNS and some of its extensions. Moreover, applications are briefly summarized. They comprise heuristic solution of a variety of optimization problems, ways to accelerate exact algorithms and to analyze heuristic solution processes, as well as computer-assisted discovery of conjectures in graph theory.

Keywords

Local Search Tabu Search Travel Salesman Problem Travel Salesman Problem Variable Neighborhood 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    I. Ahmad and M. Dhodhi (1996) Multiprocessor scheduling in a genetic paradigm. Parallel Computing 22, 395–406.CrossRefGoogle Scholar
  2. [2]
    M.R. Anderberg (1973) Cluster Analysis for Application. Academic Press, New York.Google Scholar
  3. [3]
    A. Andreatta and C. Ribeiro. Heuristics for the phylogeny problem. Journal of Heuristics (to appear).Google Scholar
  4. [4]
    M. Aouchiche, G. Caporossi and P. Hansen (2001) Variable neighborhood search for extremal graphs. 8. Variations on Graffiti 105, Congressus Numeratium (to appear).Google Scholar
  5. [5]
    O. Araujo and J.A. de la Penã (1998) Some bounds on the connectivity index of a chemical graph. Journal of Chemical Information and Computer Science, 38, 827–831.Google Scholar
  6. [6]
    C. Audet, J. Brimberg, P. Hansen and N. Mladenović (2000) Pooling problem: alternate formulation and solution methods. Les Cahiers du GERAD G-2000 23.Google Scholar
  7. [7]
    R. Battiti and M. Protasi (2001) Reactive local search for the maximum clique problem. Algorithmica, 29(4), 610–637.CrossRefMathSciNetGoogle Scholar
  8. [8]
    J.E. Beasley (1985) A note on solving large p-median problems. European Journal of Operational Research, 21, 270–273.CrossRefzbMATHMathSciNetGoogle Scholar
  9. [9]
    N. Belacel, N. Mladenović and P. Hansen. Fuzzy J-Means: A new heuristic for Fuzzy clustering. Pattern Recognition (to appear).Google Scholar
  10. [10]
    M. den Basten and T. Stutzle (2001) Neighborhoods revisited: Investigation into the effectiveness of Variable neighborhood descent for scheduling, MIC’2001, Porto, pp. 545–549.Google Scholar
  11. [11]
    M. den Basten, T. Stutzle and M. Dorigo (2001) Design of iterated local search, EvoSTIM2001, 2nd EW on Scheduling and Timetabling, Lecture Notes CS (to appear).Google Scholar
  12. [12]
    R. Bent and P. Van Hentenryck (2001) A two stage hybrid local search for the vehicle routing problem with time windows, Technical report, CS-01-06, Department of Computer Science, Brown University.Google Scholar
  13. [13]
    J.C. Bezdek (1981) Pattern Recognition with Fuzzy Objective Function Algorithm. Plenum, New York.Google Scholar
  14. [14]
    O. Braysy (2000) Local Search and Variable Neighborhood Search Algorithms for the Vehicle Routing with Time Windows. Acta Wasaensia 87, Universitas Wasaenis, Vaasa.Google Scholar
  15. [15]
    J. Brimberg, P. Hansen, K.-W. Lih, N. Mladenović and M. Breton (2000) An oil pipeline design problem. Les Cahiers du GERAD G-2000-73, Montréal, Canada.Google Scholar
  16. [16]
    J. Brimberg, P. Hansen, N. Mladenović and É. Taillard (2000) Improvements and comparison of heuristics for solving the Multisource Weber problem. Operation Research, 48(3), 444–60.Google Scholar
  17. [17]
    J. Brimberg and N. Mladenović (1996) A Variable neighborhood algorithm for solving the continuous location-allocation problem. Studies in Location Analysis, 10, 1–12.Google Scholar
  18. [18]
    E.K. Burke, De Causmaecker and G.V. Berghe (1999) A hybrid tabu search algorithm for the nurse rostering problem. Lecture notes in AI, 1585, 187–194.Google Scholar
  19. [19]
    E.K. Burke, P. Cowling and R. Keuthen (1999) Effective local and guided Variable neighborhood search methods for the asymmetric traveling salesman problem, in the Proceedings of the Evo Workshops, Springer, Lecture Notes in Computer Science, pp. 203–212.Google Scholar
  20. [20]
    E. Burke, P. De Causmaecker, S. Petrović and G.V. Berghe (2001) Variable neighborhood search for nurse rostering problem, MIC’2001, Porto, pp. 755–760.Google Scholar
  21. [21]
    P. Brucker, A. Drexl, R. Mohring, K. Neumann and E. Pesch (1999) Resource-constrained project scheduling: notation, classification, models and methods, European Journal of Operational Research, 112, 3–41.CrossRefGoogle Scholar
  22. [22]
    L.M. de Campos and J.M. Puerta (2001) Stochastic local search algorithms for linear belief networks: searching in the space of orderings. In: S. Benferhat and P. Besnard (eds.), ESCQARU 2001, Lecture Notes in AI 2143. Springer-Verlag, Berlin Heidelberg, pp. 228–239.Google Scholar
  23. [23]
    R.L. Canon, J.C. Bezdek and J.V. Dave (1986) Efficient implementation of the fuzzy C-means clustering algorithm. IEEE Transactions on Pattern Recognition Machine Intelligence, 8(2), 248–255.Google Scholar
  24. [24]
    S. Canuto, M. Resende and C. Ribeiro, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Networks (to appear).Google Scholar
  25. [25]
    G. Caporossi, D. Cvetković, I. Gutman and P. Hansen (1999) Variable neighborhood search for extremal graphs. 2. Finding graphs with extremal energy. Journal of Chemical Information Computer Science, 39, 984–996.Google Scholar
  26. [26]
    G. Caporossi, A.A. Dobrynin, I. Gutman and P. Hansen (1999) Trees with palindromic Hosoya polynomials. Graph Theory Notes of New York, 37, 10–16.MathSciNetGoogle Scholar
  27. [27]
    G. Caporossi, I. Gutman and P. Hansen (1999) Variable neighborhood search for extremal graphs. 4. Chemical trees with extremal connectivity index. Computers and Chemistry, 23, 469–477.CrossRefGoogle Scholar
  28. [28]
    G. Caporossi and P. Hansen (1999) Finding relations in polynomial time. In: Proceedings of the XVI International Joint Conference on Artificial Intelligence, pp. 780–785.Google Scholar
  29. [29]
    G. Caporossi and P. Hansen (2000) Variable neighborhood search for extremal graphs. 1. The AutoGraphiX system. Discrete Mathematics, 212, 29–44.CrossRefMathSciNetGoogle Scholar
  30. [30]
    R. Cordone, R.W. Calvo (2001) A Heuristic for the Vehicle routing problem with time windows. Journal of Heuristics, 7(2), 107–129.CrossRefGoogle Scholar
  31. [31]
    M.-C. Costa, F.-R. Monclar and M. Zrikem (2001) Variable neighborhood search for the optimization of cable layout problem. MIC’2001, Porto, pp. 749–753.Google Scholar
  32. [32]
    T. Crainic, M. Gendreau, P. Hansen, N. Hoeb and N. Mladenović (2001) Parallel Variable neighborhood search for the p-Median. MIC’2001, Porto, July 16–21, pp. 595–599.Google Scholar
  33. [33]
    J. Crispim and J. Brandao (2001) Reactive Tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. MIC’2001, Porto, pp. 631–636.Google Scholar
  34. [34]
    D. Cvetković, S. Simić, G. Caporossi and P. Hansen (2001) Variable neighborhood search for extremal graphs. 3. On the largest eigenvalue of color-constrained trees. Linear and Multi-linear Algebra (in press).Google Scholar
  35. [35]
    T. Davidović (2000) Scheduling heuristic for dense task graphs. Yugoslav Journal of Operational Research, 10, 113–136.Google Scholar
  36. [36]
    T. Davidović, P. Hansen and N. Mladenović (2001) Variable neighborhood search for multiprocessor scheduling with communication delays. MIC’2001, Porto, pp. 737–741.Google Scholar
  37. [37]
    T. Davidović, P. Hansen and N. Mladenović (2001) Heuristic methods for multiprocessor scheduling with communication delays (in preparation).Google Scholar
  38. [38]
    G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux and F. Soumis (1997) Crew pairing at air France. European Journal of Operational Research 97, 245–259.CrossRefGoogle Scholar
  39. [39]
    J. Desrosiers, N. Mladenović and D. Villeneuve (2001) Design of balanced MBA student teams. MIC’2001, Porto, July 16–21, pp. 281–285.Google Scholar
  40. [40]
    M. Diaby, H.C. Bahl, M.H. Karwan and S. Zionts (1992) Capacitated lot-sizing and scheduling by Lagrangian relaxation. European Journal of Operational Research, 59, 444–58.CrossRefGoogle Scholar
  41. [41]
    O. du Merle, D. Villeneuve, J. Desrosiers and P. Hansen (1992) Stabilized column generation. Discrete Mathematics, 194, 229–237.Google Scholar
  42. [42]
    J.C. Dunn (1974) A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters. Journal of Cybernetics, 3(3), 32–57.MathSciNetGoogle Scholar
  43. [43]
    M.L. Dukić and Z. S. Dobrosavljević (1990) A method of a spread-spectrum radar polyphase code design. IEEE Journal on Selected areas in Communications, 8(5), 743–749.Google Scholar
  44. [44]
    O. du Merle, P. Hansen, B. Jaumard and N. Mladenović (2000) An interior point algorithm for Minimum sum-of-squares clustering. SIAM Journal Scientific Computing, 21, 1485–1505.Google Scholar
  45. [45]
    M. Ehrgott, J. Freitag, H. Hamacher, and F. Maffioli (1997), Heuristics for the k-cardinality tree and subgraph problems. Asia-Pacific Journal of Operational Research, 14, 87–114.MathSciNetGoogle Scholar
  46. [46]
    S. Fajtlowicz (1988) On conjectures of Graffiti. Discrete Mathematics, 72, 113–118.CrossRefzbMATHMathSciNetGoogle Scholar
  47. [47]
    S. Fajtlowicz (2000) Written on the wall. Version 09-2000 (regularly updated file accessible via e-mail from clarson@math.uh.edu).Google Scholar
  48. [48]
    T. Feo and M. Resende (1995) Greedy randomized adaptive search. Journal of Global Optimization, 6, 109–133.CrossRefMathSciNetGoogle Scholar
  49. [49]
    P. Festa, P. Pardalos, M. Resende and C. Ribeiro (2001), GRASP and VNS for Max-cut, Proceedings of MIC’2001, pp. 371–376.Google Scholar
  50. [50]
    R.A. Fisher. The use of multiple measurements in taxonomic problems. Annals of Eugenics VII part II: 179–188.Google Scholar
  51. [51]
    M. Fischetti, H. Hamacher, K. Jornsten and F. Maffioli (1994) Weighted k-cardinality trees: complexity and polyhedral structure. Networks, 24, 11–21.MathSciNetGoogle Scholar
  52. [52]
    K. Fleszar and K.S. Hindi (2001) New heuristics for one-dimensional bin-packing. Computing and Operational Research (to appear).Google Scholar
  53. [53]
    K. Fleszar and K.S. Hindi (2001) Solving the resource-constrained project scheduling problem by a variable neighborhood search. European Journal of Operational Research (accepted s.t. revision).Google Scholar
  54. [54]
    P. Fowler, P. Hansen, G. Caporossi and A. Sondini (2001) Polyenes with maximum HOMO-LUMO gap. (Variable Neighborhood Search for extremal graphs 7.). Les Cahiers du GERAD, Montréal, Canada, 2001, Chemical Physics Letters (to appear).Google Scholar
  55. [55]
    M.R. Garey and D.S. Johnson (1978) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.Google Scholar
  56. [56]
    L.M. Gambardela, E. Taillard and M. Dorigo (1999) Ant colonies for the quadratic assignment problem. Journal of Operational Research Society, 50, 167–176.Google Scholar
  57. [57]
    M. Gendreau, G. Pesant and L,-M. Rousseau. Using constraint based operators with variable neighborhood search to solve the vehicle routing problem with time windows. Journal of Heuristics (to appear).Google Scholar
  58. [58]
    M. Gendreau, P. Hansen, M. Labbé and N. Mladenović (2001) Variable neighborhood search for the traveling salesman problem (in preparation).Google Scholar
  59. [59]
    M. Gendreau, A. Hertz and G. Laporte (1992) New Insertion and postoptimization procedures for the Traveling salesman problem. Operations Research, 40, 1086–1094.MathSciNetGoogle Scholar
  60. [60]
    M. Gendreau, A. Hertz and G. Laporte (1996), The traveling salesman problem with back-hauls, Computers Operational Research, 23, 501–508.MathSciNetGoogle Scholar
  61. [61]
    G. Ghiani, A. Hertz and G. Laporte (2000) Recent algorithmic advances for arc routing problems. Les Cahiers du GERAD G-2000-40, Montreal, Canada.Google Scholar
  62. [62]
    F. Glover (1989) Tabu search—Part I. ORSA J. Computing, 1, 190–206.zbMATHMathSciNetGoogle Scholar
  63. [63]
    F. Glover (1990) Tabu search—Part II. ORSA J. Computing, 2, 4–32.zbMATHGoogle Scholar
  64. [64]
    F. Glover and M. Laguna (1997) Tabu Search. Kluwer, Boston.Google Scholar
  65. [65]
    C.G. Gonzales and D.P. Brito (2001) A Variable neighborhood search for solving the linear ordering problem, MIC’2001, Porto, pp. 181–185.Google Scholar
  66. [66]
    R.E. Griffith & R.A. Stewart (1961) A nonlinear programming technique for the optimization of continuous processing systems. Management Science, 7, 379–392.MathSciNetGoogle Scholar
  67. [67]
    I. Gutman (1993) A Contribution to the study of palindromic graphs. Graph Theory Notes of New York, XXIV:6, New York Academy of Science, pp. 51–56.Google Scholar
  68. [68]
    I. Gutman and O.E. Polansky (1986) Mathematical Concepts in Organic Chemistry, Springer Berlin.Google Scholar
  69. [69]
    I. Gutman, E. Estrada and O. Ivanciuc (1999) Some properties of the Wiener polynomial of trees. Graph Theory Notes of New York, XXXVI:1, New York Academy of Sciences, pp. 7–13.MathSciNetGoogle Scholar
  70. [70]
    I. Gutman and O. Miljković (2000) Molecules with smallest connectivity index. Match, 41, 57–70.Google Scholar
  71. [71]
    I. Gutman, O. Miljković, G. Caporossi and P. Hansen (1999) Alkanes with small and large connectivity index. Chemical Physics Letters, 306, 366–372.CrossRefGoogle Scholar
  72. [72]
    P. Hansen and B. Jaumard (1990) Algorithms for the maximum satisfiability problem. Computing, 44, 279–303.CrossRefMathSciNetGoogle Scholar
  73. [73]
    P. Hansen and B. Jaumard (1997) Cluster analysis and mathematical programming. Mathematical Programming, 79, 191–215.CrossRefMathSciNetGoogle Scholar
  74. [74]
    P. Hansen, B. Jaumard, N. Mladenović and A. Parreira (2000) Variable neighborhood search for Weighted maximum satisfiability problem. Les Cahiers du GERAD G-2000-62, Montréal, Canada.Google Scholar
  75. [75]
    P. Hansen, S. Krau and O. du Merle. Stabilized column generation algorithm for the multisource Weber problem (in preparation).Google Scholar
  76. [76]
    P. Hansen and H. Melot. Variable neighborhood search for extremal graphs. 6. Analyzing bounds on the connectivity index, Les Cahiers du GERAD (forthcoming).Google Scholar
  77. [77]
    P. Hansen and N. Mladenović (1997) Variable neighborhood search for the p-Median. Location Science, 5, 207–226.CrossRefGoogle Scholar
  78. [78]
    P. Hansen and N. Mladenović (1999) An introduction to variable neighborhood search. In: S. Voss et al. (eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Dordrecht, pp. 433–458.Google Scholar
  79. [79]
    P. Hansen and N. Mladenović (1999) First improvement may be better than best improvement: An empirical study. Les Cahiers du GERAD G-99-40, Montreal, Canada.Google Scholar
  80. [80]
    P. Hansen and N. Mladenović (2001) Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130, 449–467.CrossRefMathSciNetGoogle Scholar
  81. [81]
    P. Hansen and N. Mladenović (2001) J-Means: A new local search heuristic for minimum sum-of-squares clustering. Pattern Recognition, 34, 405–413.CrossRefGoogle Scholar
  82. [82]
    P. Hansen and N. Mladenović (2001) Industrial applications of the variable neighborhood search metaheuristics. In: G. Zaccour (eds.), Decisions & Control in Management Science. Kluwer Academic Publishers, Boston/Dordrecht/London, pp. 261–274.Google Scholar
  83. [83]
    P. Hansen and N. Mladenović (2001) Developments of variable neighborhood search. In: C. Ribeiro, P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston/Dordrecht/London, pp. 415–440.Google Scholar
  84. [84]
    P. Hansen, N. Mladenović and D. Perez-Brito (2001) Variable neighborhood decomposition search. Journal of Heuristics, 7(4) 335–350.CrossRefGoogle Scholar
  85. [85]
    P. Hansen, N. Mladenović and D. Urošević (2001) Variable neighborhood search for the Maximum clique. Les Cahiers du GERAD G-2001-25, Montreal, Canada.Google Scholar
  86. [86]
    A. Hertz, M-C. Costa and M. Mitaz (1999) Bounds and heuristics for the shortest capacitated path problem, MIC’99, Rio de Janeiro.Google Scholar
  87. [87]
    A. Hertz G. Laporte and M. Mittaz (2000) A Tabu search heuristic for the Capacitated arc routing problem. Operations Research, 48, 129–135.CrossRefMathSciNetGoogle Scholar
  88. [88]
    K.S. Hindi, K. Fleszarand C. Charalambous (2001) An effective heuristic forthe CLSP with setup times. European Journal of Operational Research (accepted s.t. revision).Google Scholar
  89. [89]
    C.-T. Hsieh, C.-C. Chin and K.-M. Shen (1998) Generalized fuzzy Kohonen clustering networks, IEICE Trans. Fundamentals, V. E81-A(10).Google Scholar
  90. [90]
    F.K. Hwang, D.S. Richards and P. Winter (1992) The Steiner Tree Problem. North-Holland, Amsterdam.Google Scholar
  91. [91]
    T. Ibaraki, M. Kubo, T. Masuda, T. Uno and M. Yagiura (2001) Effective local search algorithms for the vehicle routing problem with general time windows, MIC’2001, Porto, pp. 293–297.Google Scholar
  92. [92]
    S. Imahori, M. Yagiura and T. Ibaraki (2001) Local search heuristics for the rectangle packing problem with general spatial costs, MIC’2001, Porto, pp. 471–476.Google Scholar
  93. [93]
    R.C. Jancey (1996) Multidimensional group analysis. Australian Journal of Botany, 14, 127–130.Google Scholar
  94. [94]
    Johnson D. and Trick M. (eds.), (1996) Cliques, coloring and satisfiability: Second DIMACS implementation challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 26.Google Scholar
  95. [95]
    J.E. Kelley (1960) The cutting-plane method for solving convex programs. Journal of the SIAM, 8, 703–712.MathSciNetGoogle Scholar
  96. [96]
    R. Kolish and S. Hartman (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis, Project Scheduling: Recent Models, Algorithms and Applications, Kluwer.Google Scholar
  97. [97]
    V. Kovačević, M. Čangalović, M. Ašić, D. Dražić and L. Ivanović (1999) Tabu search methodology in global optimization. Computers & Mathematics with Applications, 37, 125–133.Google Scholar
  98. [98]
    S. Krau (1997) Extensions du problems de Weber, PhD thèse, École Polytechnique de Montréal.Google Scholar
  99. [99]
    M. Krishnamoorthy, A.T. Ernst and Y.M. Sharaiha (1998) Comparison of algorithms for the degree constrained spanning trees, Proceedings of International Conference on Optimisation Techniques and Applications (Perth, Western Australia, 1998), L. Caccetta, et al. (eds.), Curtin University of Technology, pp. 859–866.Google Scholar
  100. [100]
    Y.-K. Kwok and I. Ahmad (1997) Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm. Journal of Parallel and Distributed Computing, 47, 58–77.CrossRefGoogle Scholar
  101. [101]
    M. Labbé, G. Laporte, I. Rodriques and J. Salazar (1999) Median cycle problems. SMG Report, Université Libre de Bruxelles, Belgium, (http://smg.ulb.ac.be).Google Scholar
  102. [102]
    M. Laguna, R. Martin and V. Campos (1999) Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers & Operational Research, 26, 1217–1230.Google Scholar
  103. [103]
    S. Lin and B.W. Kernighan (1973) An effective heuristic for the traveling salesman problem. Operational Research, 21, 498–516.MathSciNetGoogle Scholar
  104. [104]
    K. Jörnsten and A. Lokketangen (1997) Tabu search for weighted k-cardinality trees. Asia-Pacific Journal of Operational Research, 14(2): 9–26.MathSciNetGoogle Scholar
  105. [105]
    L. Lobjois, M. Lemaitre and G. Verfaille (2001) Large neighborhood search using constraint propagation and greedy reconstruction for valued CSP resolution. Research report ONERA, Toulouse, France.Google Scholar
  106. [106]
    EG. Lopez, B.M. Batista, J.A. Moreno Pérez and J.M. Moreno Vega (2000) The parallel variable neighborhood search for the p-median problem. Research Report, University of La Laguna, Spain. Journal of Heuristics, (to appear).Google Scholar
  107. [107]
    S. Loudin and P. Boizumault (2001) VNS/LDS + CP: A hybrid method for constraint optimization in anytime contexts, MIC’2001, Porto, pp. 761–765.Google Scholar
  108. [108]
    S.L. Martins, M.G.C. Resende, C.C. Ribeiro and P. Pardalos (2000) A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization, 17, 267–283.CrossRefMathSciNetGoogle Scholar
  109. [109]
    M. Mittaz. Problèmes de cheminements optimaux dans des réseaux avec contraintes associées aux arcs. PhD thesis, Department of Mathematics, École Polytechnique Fédérate de Lausanne, Switzerland.Google Scholar
  110. [110]
    N. Mladenović (1995) A Variable neighborhood algorithm—a new metaheuristic for combinatorial optimization. Abstracts of papers presented at Optimization Days, Montréal, p. 112.Google Scholar
  111. [111]
    N. Mladenović, M. Labbé and P. Hansen (2001) Solving the p-center problem by Tabu search and Variable neighborhood search Networks (to appear).Google Scholar
  112. [112]
    N. Mladenović and P. Hansen (1997) Variable neighborhood search. Computers Operations Research, 24, 1097–1100.MathSciNetGoogle Scholar
  113. [113]
    N. Mladenović, J.P. Moreno, and J. Moreno-Vega (1996) A Chain-interchange heuristic method. Yugoslav Journal of Operational Research, 6, 41–54.Google Scholar
  114. [114]
    N. Mladenović, J. Petrović, V. Kovačević-Vujčić and M. Čangalović (2000) Solving Spread spectrum radar polyphase code design problem by Tabu search and Variable neighborhood search. SMG Report, R-00-09, Universite libre Bruxelles, Belgium. European Journal of Operational Research (to appear).Google Scholar
  115. [115]
    N. Mladenović and D. Urošević (2001) Variable neighborhood search for the k-cardinality tree, MIC’2001, Porto, pp. 749–753.Google Scholar
  116. [116]
    L.S. Ochi, M.B. Silva and L. Drummond (2001) Metaheuristics based on GRASP and VNS for solving Traveling purchaser problem, MIC’2001, Porto, pp. 489–494.Google Scholar
  117. [117]
    J. Pearl (1998) Probabilistic Reasoning in Intelligent Systems. Morgan and Kaufman.Google Scholar
  118. [118]
    G. Pesant and M. Gendreau (1996) A View of local search in Constraint programming, principles and practice of Constraint Programming, Lecture Notes in Computer Science, volume 1118. Springer-Verlag, pp. 353–366.Google Scholar
  119. [119]
    G. Pesant and M. Gendreau (1999) A Constraint programming framework for Local search methods. Journal of Heuristics, 5, 255–279.CrossRefGoogle Scholar
  120. [120]
    M. Randić (1975) On characterization of molecular branching. Journal of the American Chemical Society, 97, 6609–6615.Google Scholar
  121. [121]
    R. Ravi and F.S. Salman (1999) Approximation algorithms for the traveling purchaser problem and its variants in network design, Lecture Notes in Computer Science, volume 1643. Springer, pp. 29–40.MathSciNetGoogle Scholar
  122. [122]
    G. Reinelt (1991) TSLIB — A Traveling salesman library. ORSA Journal of Computing, 3, 376–384.zbMATHGoogle Scholar
  123. [123]
    M.G.C. Resende, L.S. Pitsoulis and P.M. Pardalos (1997) Approximate solution of Weighted max-sat problems using GRASP, In: Dingzhu Du et al. (eds.), Satisfiability Problem: Theory and Applications. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 35, American Mathematical Society, Providence, Rhode Island.Google Scholar
  124. [124]
    C. Ribeiro and C. Souza (2001) Variable neighborhood descent for the degree-constrained minimum spanning tree problem. Discrete Applied Mathematics (to appear).Google Scholar
  125. [125]
    C. Ribeiro, E. Uchoa and R. Werneck (2001) A hybrid GRASP with perturbations for the Steiner problem in graphs. Technical report, Computer Science Department, Catholic University of Rio de Janeiro.Google Scholar
  126. [126]
    I. Rodriguez, M. Moreno-Vega and J. Moreno-Perez (1999) Heuristics for Routing-median problems. SMG Report, Université Libre de Bruxelles, Belgium.Google Scholar
  127. [127]
    A. Scholl, R. Klein and C. Jurgens (1997) BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem. Computers & Operational Research, 24, 627–645.Google Scholar
  128. [128]
    P. Shaw (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming (CP’98), pp. 417–431.Google Scholar
  129. [129]
    M.B. Silva, L. Drummond and L.S. Ochi (2000) Variable neighborhood search for the Traveling purchacer problem, 27th Int. Conf. on Comp. Indust. Engineering.Google Scholar
  130. [130]
    E. Taillard and L. Gambardella (1999) Adaptive memories for the quadratic assignment problem. Technical report I-87-97, IDSIA, Lugano, Switzerland.Google Scholar
  131. [131]
    E. Taillard and S. Voss. POPMUSIC—Partial optimization metaheuristic under special intensification conditions. In: C. Ribeiro, P. Hansen (eds.), Essays and Surveys in Metaheuristics. Kluwer Academic Publishers, Boston/Dordrecht/London, pp. 613–630.Google Scholar
  132. [132]
    W. Trigeiro, J. Thomas and J. McClain (1989) Capacitated lot-sizing with setup times. Management Science, 35, 353–366.Google Scholar
  133. [133]
    J. D. Ullman (1975) NP-complete scheduling problems. Journal of Computing System Sciences 10(3), 384–393.zbMATHMathSciNetGoogle Scholar
  134. [134]
    M.G.A. Verhoeven, M.E.M. Severens and E.H.L. Aarts (1996) Local search for Steiner trees in graphs. In: V.J. Rayward-Smith et al. (eds.), Modern Heuristic Search Methods. John Wiley and Sons, pp. 117–129.Google Scholar
  135. [135]
    S. Voss (1996) Dynamic Tabu search strategies for the traveling purchaser problem. Annals of Operational Research 63, 253–275.zbMATHGoogle Scholar
  136. [136]
    R. Whittaker (1983) A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR, 21, 95–108.Google Scholar
  137. [137]
    N. Zufferey, C. Avanthay and A. Hertz. Variable neighborhood search for graph colouring (submitted).Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Pierre Hansen
    • 1
  • Nenad Mladenović
    • 2
  1. 1.GERAD and Ecole des Hautes Etudes CommercialesMontréalCanada
  2. 2.Mathematical InstituteSerbian Academy of ScienceBelgradeYugoslavia

Personalised recommendations