Abstract
Vehicle routing algorithms can be divided into three broad classes: route construction heuristics that “build” routes through the insertion of new customers, route improvement heuristics that modify the location of customers within the existing routes through exchange procedures, and composite heuristics that mix route construction and route improvement procedures. In this paper, a greedy route construction heuristic for the vehicle routing problem with time windows is described. This heuristic inserts customers one by one into the routes using a fixed a priori ordering of the customers. Then, a genetic algorithm is proposed to identify the ordering that produces the best routes.
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
Baker J.E., “Reducing Bias and Inefficiency in the Selection Algorithm”, Proceedings of the Second Int. Conf. on Genetic Algorithms, July 1987, Cambridge, MA, pp. 14–21.
Blanton J.L. and R.L. Wainwright, “Multiple Vehicle Routing with Time and Capacity Constraints using Genetic Algorithms”, Proceedings of the Fifth International Conference on Genetic Algorithms, July 1993, Champaign, IL, pp. 452–459.
Davis L., “Applying Adaptive Algorithms to Epistactic Domains”, Proceedings of the Int. Joint Conf. on Artificial Intelligence, August 1985, Los Angeles, CA, pp. 162–164.
Desrosiers J., Y. Dumas., M.M. Solomon and F. Soumis, “Time Constrained Routing and Scheduling”, Technical Report G-92-42, Groupe d’études et de recherche en analyse des décisions, Université de Montréal, Montréal, Canada, 1992.
Eshelman L.J., “The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination”, Foundations of Genetic Algorithms, G.J.E. Rawlins Eds, Morgan Kaufmann, 1991, San Mateo, CA, pp. 265–283.
Gélinas S., M. Desrochers, J. Desrosiers and M.M. Solomon, “A New Branching Strategy for Time Constrained Routing Problems with Application to Backhauling”, Technical Report G-92-13, Groupe d’études et de recherche en analyse des décisions, Université de Montréal, Montréal, Canada, 1994.
Kontoravdis G. and J. Bard, “A GRASP for the Vehicle Routing Problem with Time Windows”, ORSA Journal on Computing 7, 1995, pp. 10–23.
Oliver I.M., D.J. Smith and J.R.C. Holland, “A Study of Permutation Crossover Operators on the Traveling Salesman Problem”, Proceedings of the Second Int. Conf. on Genetic Algorithms, July 1987, Cambridge, MA, pp. 224–230.
Potvin J.Y. and S. Bengio, “A Genetic Approach to the Vehicle Routing Problem with Time Windows”, Technical Report CRT-953, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada, 1993.
Rochat Y. and E. Taillard, “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing”, Technical Report CRT-95-13, Centre de recherche sur les transports, Université de Montréal, Montréal, Canada, 1995.
Smith D., “Bin Packing with Adaptive Search”, in Proceedings of the First Int. Conf. on Genetic Algorithms and their Applications, July 1985, Pittsburgh, PA, pp. 202–207.
Solomon M.M., “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints”, Operations Research 35, 1987, pp. 254–265.
Thangiah S.R., “Vehicle Routing with Time Windows using Genetic Algorithms”, Technical Report SRU-CpSc-TR-93–23, Computer Science Department, Slippery Rock University, Slippery Rock, PA, 1993.
Thompson P. and H. Psaraftis, “Cyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems”, Operations Research 41, 1993, pp. 935–946.
Whitley D., “The Genitor Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best”, Proceedings of the Third Int. Conf. on Genetic Algorithms, June 1989, Fairfax, VA, pp. 116–121.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Potvin, JY., Guertin, F. (1997). Coupling a Greedy Route Construction Heuristic with a Genetic Algorithm for the Vehicle Routing Problem with Time Windows. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds) Interfaces in Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4102-8_19
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4102-8_19
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6837-3
Online ISBN: 978-1-4615-4102-8
eBook Packages: Springer Book Archive