Abstract
Recently proved successful for variants of the vehicle routing problem (VRP) involving time windows, genetic algorithms have not yet shown to compete or challenge current best search techniques in solving the classical capacitated VRP. In this paper, a hybrid genetic algorithm to address the capacitated vehicle routing problem is proposed. The basic scheme consists in concurrently evolving two populations of solutions to minimize total traveled distance using genetic operators combining variations of key concepts inspired from routing techniques and search strategies used for a time-variant of the problem to further provide search guidance while balancing intensification and diversification. Results from a computational experiment over common benchmark problems report the proposed approach to be very competitive with the best-known methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Toth, P. and D. Vigo (2002), “The Vehicle Routing Problem”, SIAM Monographs Discrete Mathematics and Applications, edited by P. Toth and D. Vigo, Philadelphia, USA.
Laporte, G., M. Gendreau, J.-Y. Potvin and F. Semet (1999), “Classical and Modern Heuristics for the Vehicle Routing Problem”, Les Cahiers du GERAD, G-99-21, Montreal, Canada.
Gendreau, M., G. Laporte and J.-Y. Potvin (1998), “Metaheuristics for the Vehicle Routing: Problem”, Les Cahiers du GERAD, G-98-52, Montreal, Canada.
Gendreau, M., G. Laporte and J.-Y. Potvin (1997), “Vehicle routing: modern heuristics. Local Search in Combinatorial Optimization”, eds.: E. Aarts and J.K. Lenstra, 311–336, Wiley: Chichester.
Glover, F. (1986), “Future Paths for Integer Programming and Links to Artificial Intelligence”, Computers and Operations Research 13, 533–549.
Glover, F. and M. Laguna (1997), Tabu Search, Kluwer Academic Publishers, Boston.
Holland, J. H. (1975), Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor.
Jong De, K. A. (1975), An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. Dissertation, University of Michigan, U.S.A.
Goldberg, D.E (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, New York.
Cordeau, J.-F., M. Gendreau, G. Laporte, J.-Y. Potvin and F. Semet (2002), “A Guide to Vehicle Routing Heuristics”, Journal of the Operational Research Society 53, 512–522.
Cordeau, J.-F. and G. Laporte (2002), “Tabu Search Heuristics for the Vehicle Routing Problems”, Les Cahiers du GERAD, G-2002-15, Montreal, Canada.
Bräysy, O. and M. Gendreau (2001), “Vehicle Routing Problem with Time Windows, Part II: Metaheuristics”, Internal Report STF 42 A01025, SINTEF Applied Mathematics, Department of Optimization, Norway.
Dalessandro, S.V., L.S. Ochi and L.M. de A. Drummond (1999), A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem. IPPS/SPDP 1999, 2 nd Workshop on Biologically Inspired Solutions to Parallel Processing Problems, San Juan, Puerto Rico, USA, 183–191.
Berger, J. and M. Barkaoui (2000), “An Improved Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows”, International ICSC Symposium on Computational Intelligence, part of the International ICSC Congress on Intelligent Systems and Applications (ISA’2000), University of Wollongong, Wollongong, Australia.
Machado, P., J. Tavares, F. Pereira and E. Costa (2002), “Vehicle Routing Problem: Doing it the Evolutionary Way”, Proc. of the Genetic and Evolutionary Computation Conference, New York, USA.
Gehring, H. and J. Homberger (2001), “Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows”, Asia-Pacific Journal of Operational Research 18, 35–47.
Tan, K.C., L.H. Lee and K. Ou (2001), “Hybrid Genetic Algorithms in Solving Vehicle Routing Problems with Time Window Constraints”, Asia-Pacific Journal of Operational Research 18, 121–130.
Thangiah, S.R., I.H. Osman, R. Vinayagamoorthy and T. Sun (1995), “Algorithms for the Vehicle Routing Problems with Time Deadlines”, American Journal of Mathematical and Management Sciences 13, 323–355.
Thangiah, S.R. (1995), “Vehicle Routing with Time Windows Using Genetic Algorithms”, In Application Handbook of Genetic Algorithms: New Frontiers, Volume II, 253–277, L. Chambers (editor), CRC Press, Boca Raton.
Thangiah, S.R. (1995), “An Adaptive Clustering Method using a Geometric Shape for Vehicle Routing Problems with Time Windows”, In Proceedings of the 6th International Conference on Genetic Algorithms, L.J. Eshelman (editor), 536–543 Morgan Kaufmann, San Francisco.
Blanton, J.L. and R.L. Wainwright (1993), “Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms”, In Proceedings of the 5th International Conference on Genetic Algorithms, S. Forrest (editor), 452–459 Morgan Kaufmann, San Francisco.
Sangheon, H. (2001), “A Genetic Algorithm Approach for the Vehicle Routing Problem”, Journal of Economics, Osaka University, Japan.
Peiris, P. and S.H. Zak (2000), “Solving Vehicle Routing Problem Using Genetic Algorithms”, Annual Research Summary — Part I — Research, Section 1
Automatic Control, School of Electrical and Computer Engineering, Purdue University, http://www.ece.purdue.edu/ECE/Research/ARS/ARS2000/PART_I/Section1/1_19.whtml.
Shaw, P. (1998), “Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems”, In Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, M. Maher and J.-F. Puget. (eds.), 417–431, Springer-Verlag, New York.
Liu, F.-H. and S.-Y. Shen (1999), “A Route-Neighborhood-based Metaheuristic for Vehicle Routing Problem with Time Windows”, European Journal of Operational Research 118, 485–504.
Osman, I.H. (1993), “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem”, Annal of Operations Research 41, 421–451.
Solomon, M.M. (1987), “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints”, Operations Research 35, 254–265.
Harvey, W.D. and M.L. Ginsberg (1995), “Limited Discrepancy Search”, In Proceedings of the 14th IJCAI, Montreal, Canada.
Christofides N., A. Mingozzi and P. Toth (1979), “The Vehicle Routing Problem”, in Christofides N., Mingozzi A., Toth P. and Sandi C. (eds). Combinatorial Optimization, Wiley, Chichester 315–338.
Wall, M. (1995), GAlib-A C++ Genetic Algorithms Library, version 2.4. (http://lancet.mit.edu/galib-2.4/), MIT, Boston.
Gendreau, M., A. Hertz and G. Laporte (1994), “A Tabu Search Heuristic for the Vehicle Routing: Problem”, Management Science 40, 1276–1290.
Cordeau, J.-F., M. Gendreau and G. Laporte (1997), “A Tabu Search Heuristic for the Periodic and Multi-depot Vehicle Routing Problems”, Networks 30, 105–119.
Toth, P. and D. Vigo (1998), “The Granular Tabu Search and its Application to the Vehicle Routing Problem”, Technical Report OR/98/9, DEIS, University of Bologna, Bologna, Italy.
Wark, P. and J. Holt (1994), “A Repeated Matching Heuristic for the Vehicle Routing Problem”, Journal of Operational Research Society 45, 1156–1167.
Rego, C. and C. Roucairol (1996), “A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem”, In: Osman IH and Kelly JP (eds). Meta-Heuristics: Theory and Applications, Kluwer, Boston, 661–675.
Rochat, Y. and E.D. Taillard (1995), “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing”, Journal of Heuristics 1, 147–167.
Taillard E.D. (1993), “Parallel Iterative Search Methods for Vehicle Routing Problems”, Networks 23, 661–673.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berger, J., Barkaoui, M. (2003). A Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_80
Download citation
DOI: https://doi.org/10.1007/3-540-45105-6_80
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40602-0
Online ISBN: 978-3-540-45105-1
eBook Packages: Springer Book Archive