Journal of Heuristics

, Volume 7, Issue 4, pp 335–350

Variable Neighborhood Decomposition Search

  • Pierre Hansen
  • Nenad Mladenović
  • Dionisio Perez-Britos


The recent Variable Neighborhood Search (VNS) metaheuristic combines local search with systematic changes of neighborhood in the descent and escape from local optimum phases. When solving large instances of various problems, its efficiency may be enhanced through decomposition. The resulting two level VNS, called Variable Neighborhood Decomposition Search (VNDS), is presented and illustrated on the p-median problem. Results on 1400, 3038 and 5934 node instances from the TSP library show VNDS improves notably upon VNS in less computing time, and gives much better results than Fast Interchange (FI), in the same time that FI takes for a single descent. Moreover, Reduced VNS (RVNS), which does not use a descent phase, gives results similar to those of FI in much less computing time.

y-median metaheuristic variable neighborhood search decomposition 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Baum, E.B. (1986). “Toward Practical ‘Neural’ Computation for Combinatorial Optimization Problems.” In J. Denker (ed.), Neural Networks for Computing. New York: American Institute of Physics.Google Scholar
  2. Beasley, J.E. (1985). “A Note on Solving Large p-Median Problems.” European Journal of Operational Research 21, 270–273.Google Scholar
  3. Bellman, R. and S. Dreyfuss. (1962). Applied Dynamic Programming, Princeton: Princeton University Press.Google Scholar
  4. Boese, K.D., A.B. Kahng, and S. Muddu. (1994). “A New Adaptive Multi-Start Technique for Combinatorial Global Optimizations.” Operations Research Letters 16, 101–113.Google Scholar
  5. Brandeau, M.L. and S.S. Chiu. (1989). “An Overview of Representative Problems in Location Research.” Management Science 35(6), 645–674.Google Scholar
  6. Captivo, E.M. (1991). “Fast Primal and Dual Heuristics for the p-Median Location Problem.” European Journal of Operational Research 52, 65–74.Google Scholar
  7. Carraghan, R. and P.M. Pardalos. (1990). “An Exact Algorithm for the Maximum Clique Problem.” Operations Research Letters 9, 375–382.Google Scholar
  8. Christofides, N. (1975). Graph Theory: An Algorithmic Approach. New York: Academic Press.Google Scholar
  9. Cornuejols, G., M.L. Fisher, and G.L. Nemhauser. (1977). “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms.” Management Science 23, 789–810.Google Scholar
  10. Densham, P.J. and G. Rushton. (1992). “A More Efficient Heuristic for Solving Large p-Median Problems.” Papers in Regional Science 71(3), 307–329.Google Scholar
  11. Drezner, Z. (ed.). (1995). Facility Location. A survey of Applications and Methods. New York: Springer.Google Scholar
  12. du Merle, O., D. Villeneuve, J. Desrosiers, and P. Hansen. (1999). “Stabilized Column Generation.” Discrete Mathematics 194, 229–237.Google Scholar
  13. Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operations Research 26, 992–1009.Google Scholar
  14. Galvao, R.D. (1980). “A Dual-Bounded Algorithm for the p-Median Problem.” Operations Research 28, 1112–1121.Google Scholar
  15. Glover, F. (1989). “Tabu Search—Part I.” ORSA Journal on Computing 1, 190–206.Google Scholar
  16. Glover, F. (1990). “Tabu Search—Part II.” ORSA Journal on Computing 2, 4–32.Google Scholar
  17. Glover, F. and M. Laguna. (1993). “Tabu Search.” In C. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Ch. 3, Oxford: Blackwell.Google Scholar
  18. Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers.Google Scholar
  19. Glover, F., C. McMillan, and R. Glover. (1984). “A Heuristic Approach to the Employee Scheduling Problem and Some Thoughts on “Managerial Robots.” Journal of Operations Management 4, 113–128.Google Scholar
  20. Griffith, R.E. and R.A. Stewart. (1961). “A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems.” Management Science 7, 379–392.Google Scholar
  21. Hanjoul, P. and D. Peeters. (1985). “A Comparison of Two Dual-Based Procedures for Solving the p-Median Problem.” European Journal of Operational Research 20, 387–396.Google Scholar
  22. Hansen, P. and B. Jaumard. (1990). “Algorithms for the Maximum Satisfiability Problem.” Computing 44, 279–303.Google Scholar
  23. Hansen, P. and B. Jaumard. (1997). “Cluster Analysis and Mathematical Programming.” Mathematical Programming 79, 191–215.Google Scholar
  24. Hansen, P. and L. Kaufman. (1972). “Comparaison d'Algorithmes Pour le Problème de la Localisation des Enterpôts.” In J. Brennan (ed.), Operational Research in Industrial Systems. London: English University Press, pp. 281–294.Google Scholar
  25. Hansen, P. and N. Mladenović. (1997). “Variable Neighborhood Search for the p-Median.” Location Science 5, 207–226.Google Scholar
  26. Hansen, P. and N. Mladenović. (1998). “An Introduction to Variable Neighborhood Search.” In S. Voss et al. (eds.), Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer, pp. 433–458.Google Scholar
  27. Kariv, O. and S.L. Hakimi. (1969). “An Algorithmic Approach to Network Location Problems; Part 2. The p-Medians.” SIAM Journal on Applied Mathematics 37, 539–560.Google Scholar
  28. Kirkpatrick, S., C.D. Gelatt, and M.P. Vecchi. (1983). “Optimization by Simulated Annealing.” Science 220, 671–680.Google Scholar
  29. Kuehn, A.A. and M.J. Hamburger. (1963). “A Heuristic Program for Locating Warehouses.” Management Science 9(4), 643–666.Google Scholar
  30. Maranzana, F.E. (1964). “On the Location of Supply Points to Minimize Transportation Costs.” Operations Research Quarterly 12, 138–139.Google Scholar
  31. Mirchandani, P. and R. Francis (eds.). (1990). Discrete Location Theory. Wiley-Interscience.Google Scholar
  32. Mladenović, N. (1995). “A Variable Neighborhood Algorithm—A New Metaheuristic for Combinatorial Optimization.” Presented at Optimization Days, Montreal.Google Scholar
  33. Mladenović, N. and P. Hansen. (1997). “Variable Neighborhood Search.” Computers and Operations Research 24, 1097–1100.Google Scholar
  34. Mladenović, N., J.P. Moreno, and J. Moreno-Vega. (1995). “Tabu Search in Solving p-Facility Location – Allocation Problems.” Les Cahiers du GERAD, G-95–38, Montreal.Google Scholar
  35. Mladenović, N., J.P. Moreno, and J. Moreno-Vega. (1996). “A Chain-Interchange Heuristic Method.” Yugoslav Journal of Operations Research 6(1), 41–54.Google Scholar
  36. Moreno, J., C. Rodrigez, and N. Jimenez. (1991). “Heuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem.” RAIRO—Recherche Operationnelle/Operations Research 25, 97–107.Google Scholar
  37. Osman, I. and N. Christofides. (1994). “Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search.” Int. Trans. Oper. Res. 1(3), 317–336.Google Scholar
  38. Pizzolato, N.D. (1994). “A Heuristic for Large-Size p-Median Location Problems with Application to School Location.” Annals of Operations Research 50, 473–485.Google Scholar
  39. Reinelt, G. (1991). “TSPLIB—A Traveling Salesman Problem Library.” ORSA Journal on Computing 3, 376–384.Google Scholar
  40. Rolland, E., D.A. Schilling, and J.R. Current. (1996). “An Efficient Tabu Search Procedure for the p-Median Problem.” European Journal of Operational Research 96, 329–342.Google Scholar
  41. Rosing, K.E. and C.S. ReVelle. (1997). “Heuristic Concentration: Two Stage Solution Construction.” European Journal of Operational Research 97, 75–86.Google Scholar
  42. Rosing, K.E., C.S. ReVelle, E. Rolland, D.A. Schilling, and J.R. Current. (1998). “Heuristic Concentration and Tabu Search: A Head to Head Comparison.” European Journal of Operational Research 104, 93–99.Google Scholar
  43. Rosing, K.E. (1998). Private communication.Google Scholar
  44. Teitz, M.B. and P. Bart. (1968). “Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph.” Operations Research 16(5), 955–961.Google Scholar
  45. Voss, S. (1996). “A Reverse Elimination Approach for the p-Median Problem.” Studies in Locational Analysis 8, 49–58.Google Scholar
  46. Whitaker, R. (1983). “A Fast Algorithm for the Greedy Interchange for Large-Scale Clustering and Median Location Problems.” INFOR 21, 95–108.Google Scholar

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Pierre Hansen
    • 1
  • Nenad Mladenović
    • 1
  • Dionisio Perez-Britos
    • 2
  1. 1.Ecole des Hautes Etudes CommercialesGeradMontrealCanada
  2. 2.University “La Laguna”TencrifeSpain

Personalised recommendations