Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bräysy, O., Gendreau, M.: Vehicle routing problem with time windows, part II: Metaheuristics. Transportation Science 39, 119–139 (2005)
Clark, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
Cordone, R., Wolfer-Calvo, R.: A heuristic for the vehicle routing problem with time windows. Journal of Heuristics 7, 107–129 (2001)
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)
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)
CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg, 802, Incline Village, NV 89451-9436. Using the CPLEX Callable Library (1995)
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)
Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for solving the vrp. Networks 11, 109–124 (1981)
Hall, R.: The 2006 vehicle routing survey. ORMS Today 33(3) (June 2006)
Hansen, P., Mladenović, N.: Variable neighborhood search for the p-median. Location Science 5, 207–226 (1997)
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)
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)
Hansen, P., Mladenović, N.: Variable neighbourhood search: Principles and applications. European Journal of Operational Research 130, 449–467 (2001)
Mladenović, N.: A variable neighborhood algorithm – a new metaheuristic for combinatorial optimization. In: Optimization Days, p. 112 (1995)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Sörensen, K., Sevaux, M., Schittekat, P. (2008). “Multiple Neighbourhood” Search in Commercial VRP Packages: Evolving Towards Self-Adaptive Methods. In: Cotta, C., Sevaux, M., Sörensen, K. (eds) Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol 136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79438-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-79438-7_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79437-0
Online ISBN: 978-3-540-79438-7
eBook Packages: EngineeringEngineering (R0)