“Multiple Neighbourhood” Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods

  • Kenneth Sörensen
  • Marc Sevaux
  • Patrick Schittekat
Part of the Studies in Computational Intelligence book series (SCI, volume 136)


All commercial packages for vehicle routing that the authors are aware of use a (meta)heuristic search procedure with several different neighbourhood structures. This paper attempts to answer the question why this is the case. As we will show, “multiple neighbourhood” search (MNS) is able to overcome the myopic behaviour of using only a single neigbourhood and is therefore more powerful. Also, MNS can be considered to be a very adaptable metaheuristic, which makes it especially suitable for the practical problems encountered in real life. We also point out that there is a need for the MNS applications used in commercial packages to evolve towards more self-adaptive systems.


“Multiple neighbourhood” search VRP vehicle routing commercial software 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science 39, 119–139 (2005)CrossRefGoogle Scholar
  2. 2.
    Clark, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)CrossRefGoogle Scholar
  3. 3.
    Cordone, R., Wolfer-Calvo, R.: A heuristic for the vehicle routing problem with time windows. Journal of Heuristics 7, 107–129 (2001)CrossRefzbMATHGoogle Scholar
  4. 4.
    Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) Selected Papers of the Third International Conference on the Practice And Theory of Automated Timetabling PATAT 2000. LNCS, pp. 176–190. Springer, Heidelberg (2001)Google Scholar
  5. 5.
    Cowling, P., Kendall, G., Soubeiga, E.: A parameter-free hyperheuristic for scheduling a sales summit. In: MIC 2001 – Proceedings of the Metaheuristics International Conference, Porto, pp. 127–131 (2001)Google Scholar
  6. 6.
    CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg, 802, Incline Village, NV 89451-9436. Using the CPLEX Callable Library (1995)Google Scholar
  7. 7.
    Crispim, J., Brandao, J.: Reactive tabu search and variable neighborhood descent applied to the vehicle routing problem with backhauls. In: MIC 2001 – Proceedings of the Metaheuristics International Conference, Porto, pp. 631–636 (2001)Google Scholar
  8. 8.
    Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for solving the vrp. Networks 11, 109–124 (1981)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Hall, R.: The 2006 vehicle routing survey. ORMS Today 33(3) (June 2006)Google Scholar
  10. 10.
    Hansen, P., Mladenović, N.: Variable neighborhood search for the p-median. Location Science 5, 207–226 (1997)CrossRefzbMATHGoogle Scholar
  11. 11.
    Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433–458. Kluwer, Boston (1999)Google Scholar
  12. 12.
    Hansen, P., Mladenović, N.: Industrial applications of the variable neighbourhood search metaheuristic. In: Decisions and Control in Management Science, pp. 261–274. Kluwer, Boston (2001)Google Scholar
  13. 13.
    Hansen, P., Mladenović, N.: Variable neighbourhood search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)CrossRefMathSciNetzbMATHGoogle Scholar
  14. 14.
    Mladenović, N.: A variable neighborhood algorithm – a new metaheuristic for combinatorial optimization. In: Optimization Days, p. 112 (1995)Google Scholar
  15. 15.
    Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    Watson, J.P., Howe, A.E., Whitley, L.D.: Deconstructing Nowicki and Smutnicki’s i-TSAB tabu search algorithm for the job-shop scheduling problem. Computers and Operations Research 33, 2623–2644 (2006)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Kenneth Sörensen
    • 1
    • 2
  • Marc Sevaux
    • 2
  • Patrick Schittekat
    • 3
    • 4
  1. 1.Fellow of the Flemish Fund for Scientific ResearchUniversity of Leuven, Centre for Industrial ManagementLeuvenBelgium
  2. 2.University of South Brittany, CNRS, FRE 2734, LESTER Centre de RechercheLorient cedexFrance
  3. 3.Faculty of Applied EconomicsUniversity of AntwerpAntwerpBelgium
  4. 4.ORTEC BelgiumHaachtBelgium

Personalised recommendations