Abstract
This paper deals with a real-life vehicle routing problem concerning the distribution of products to customers. A non-homogenous fleet of trucks with limited capacity and allowed travel time is available to satisfy the stochastic multiple product demand of a set of different types of customers with earliest and latest time for servicing. The objective is to minimize distribution costs while maximizing customer satisfaction and respecting the constraints concerning the vehicle capacity, the time windows for customer service and the driver working hours per day. A model describing all these requirements has been developed as well as a genetic algorithm to solve the problem. High Performance Computing has been used to allow the pursuit for a near-optimal solution in a sensible amount of time, as the parallel chromosome fitness evaluation counterbalances the increased size and complexity of the problem.
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
Michalewicz, Zbigniew, Genetic Algorithms + Data Structures = Evolution Programs (3rd edition) Springer-Verlag, 1996
Savelsbergh M.W.P., Local Search for Routing Problems with Time Windows. Annals of Operations Research 4, 285–305, 1985.
Solomon, Marius M., Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2), 254–265, 1987.
Thangiah, Sam R., Vehicle Routing with Time Windows using Genetic Algorithms, submitted to the book on “Applications Handbook of Genetic Algorithms: New Frontiers”.
Thangiah, Sam R. — Osman, Ibrahim H. — Vinayagamoorthy, Rajini — Sun, Tong, Algorithms for the Vehicle Routing Problems with Time Deadlines. American Journal of Mathematical and Management Sciences, 13(3&4), 323–355.
Golden B. and W. Stewart, Empirical Analysis of Heuristics in the travelling Salesman Problem, E. Lawer, J. Lenstra, A. Rinnooy and D. Shmoys (Eds.), Wiley-Interscience, New York, 1985.
G. Syswerda, Uniform crossover in genetic algorithms, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, June 1989.
D Whitley, GENITOR: a different genetic algorithm, Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver Colorado, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Protonotarios, M., Mourkousis, G., Vyridis, I., Varvarigou, T. (2000). Very Large Scale Vehicle Routing with Time Windows and Stochastic Demand Using Genetic Algorithms with Parallel Fitness Evaluation. In: Bubak, M., Afsarmanesh, H., Hertzberger, B., Williams, R. (eds) High Performance Computing and Networking. HPCN-Europe 2000. Lecture Notes in Computer Science, vol 1823. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45492-6_47
Download citation
DOI: https://doi.org/10.1007/3-540-45492-6_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67553-2
Online ISBN: 978-3-540-45492-2
eBook Packages: Springer Book Archive