Abstract
Real life distribution problems present high degree of complexity mostly derived by the need to respect a variety of constraints. Moreover they are not considered by the classical models of the vehicle routing literature. In this paper we consider a vehicle routing problem with heterogeneous vehicle fleet with different capacity, multi-dimensional capacity constraints, order/vehicle, item/vehicle, and item/item compatibility constraints, different start and end locations for vehicles, and multiple time windows restrictions. We propose an evolutionary algorithm based on the combination of a genetic algorithm and local search heuristics. We investigated the performance of the implemented algorithm in the large-scale retail and in the waste collection industries.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
5 References
Toth P. and D. Vigo (2000), The Vehicle Routing Problem, SIAM monographs on Discrete Mathematics and Applications.
Bräysy O. and M. Gendreau (2003a), “Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms”, Forthcoming in Transportation Science.
Bräysy O. and M. Gendreau (2003b), “Vehicle Routing Problem with Time Windows, Part II: Metaheuristics”, Forthcoming in Transportation Science.
Laporte G., M. Gendreau, J.Y. Potvin and F. Semet (2000), “Classical and Modern heuristics for the vehicle routing problem”, International Transactions In Operational Research 7, 285–300.
Tan, K.C., L.H. Lee and K. Q. Zhu (2000), “Heuristic methods for vehicle routing problem with time windows”, Artificial Intelligence in Engineering 15, 281–295.
Psaraftis HN (1988). Dynamic vehicle routing problems. In B.L. Golden and A.A. Assad, editors, Vehicle routing: Methods and studies, pages 233–248. North-Holland Amsterdam.
Psaraftis HN (1995). Dynamic vehicle routing: Status and prospects. Annals of Operations Research, 61:143–164.
Savelsbergh MWP and Sol M (1998). DRIVE: dynamic routing of independent vehicles. Operations Research, 46:474–490.
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-market genetic algorithm. In Langdon, W.B., Cantù-Paz, E., et al., eds.: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002), San Francisco, CA, Morgan Kaufmann (2002) 415–21
Kimbrough, S.O., Lu, M., Wood, D.H., Wu, D.J.: Exploring a two-population genetic algorithm. In Cantù-Paz, E., et al., eds.: Genetic and Evolutionary Computation (GECCO 2003). LNCS 2723, Berlin, Germany, Springer (2003) 1148–1159
Kimbrough, S.O., Lu, M., Safavi, S.M.: Exploring a financial product model with atwo-population genetic algorithm. In: Proceedings of the 2004 Congress on Evolutionary Computation, Piscataway, NJ, IEEE Neural Network Society, IEEE Service Center (June 19–23, 2004) 855–862
Goldberg, D.E. (1989), Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, Reading, MA.
Holland, J.H. (1975), “Adaptation in Natural and Artificial Systems”, University of Michigan Press, Ann Arbor.
Solomon, M.M. (1987), “Algorithm for the Vehicle Routing and Scheduling Problems with Time Window Constraints”, Operation Research 35, 254–265.
Potvin, J.-Y. and S. Bengio (1996), “The Vehicle Routing Problem with Time Windows Part II: Genetic Search”, INFORMS Journal on Computing 8, 165–172.
Confessore, G., Galiano, G., Stecca, G., 2006, General Purpose Application For Vehicle Scheduling And Routing In Complex Distribution Environments, 5th CIRP International Seminar on Intelligent Computation in Manufacturing Engineering, eds. Roberto Teti, pp 299–302, ISBN 88-95028-01-5.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this paper
Cite this paper
Confessore, G., Galiano, G., Stecca, G. (2008). An Evolutionary Algorithm for Vehicle Routing Problem with Real Life Constraints. In: Mitsuishi, M., Ueda, K., Kimura, F. (eds) Manufacturing Systems and Technologies for the New Frontier. Springer, London. https://doi.org/10.1007/978-1-84800-267-8_46
Download citation
DOI: https://doi.org/10.1007/978-1-84800-267-8_46
Publisher Name: Springer, London
Print ISBN: 978-1-84800-266-1
Online ISBN: 978-1-84800-267-8
eBook Packages: EngineeringEngineering (R0)