Abstract
In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to minimise the total distance travelled by all vehicles. This paper describes some experiments with multiple ant colony systems, in particular a Triple Ant Colony System TACS, in which one colony (VMIN) tries to minimise the number of vehicles, one (DMIN) tries to minimise the total distance and a third (CWTsMAX) tries to maximise customer waiting time. The inclusion of this third colony improves the results very significantly, compared to not using it and to a range of other options. Experiments are conducted on Solomon’s 56 benchmark problems. The results are comparable to those obtained by other state-of-the-art approaches.
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
Gambardella, L.M., Taillard, E., Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 63–76. McGraw-Hill, UK (1999); Also available as Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland
Larsen, J.: Parallelization of the vehicle routing problem time windows. Ph.D. thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark (1999)
Ellabib, I., Basir, O.A., Calamai, P.: An Experimental Study of a Simple Ant Colony System for the Vehicle Routing Problem with Time Windows. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol. 2463, pp. 53–64. Springer, Heidelberg (2002)
Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research 35(2), 254–265 (1987)
Chiang, W.C., Russel, R.: Hybrid Heuristics for the Vehicle Routing Problem with Time Windows. Hybrid Heuristics for the Vehicle Routing Problem with Time Windows Working Paper, Department of Quantitative Methods, University of Tulsa, OK, USA (1993)
Thangiah, S., Osman, I., Sun, T.: Hybrid Genetic Algorithm Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows. Technical Report 27, Computer Science Department, Slippery Rock University (1994)
Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1, 147–167 (1995)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)
Gambardella, L.M., Dorigo, M.: Solving Symmetric and Asymmetric TSPs by Ant Colonies. In: ICEC 1996, Proceedings of the IEEE Conference on Evolutionary Computation, Nagoya, Japan, May 20-22 (1996)
Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation science 31, 170–186 (1997)
Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 417–431. Springer, Heidelberg (1998)
Kilby, P., Prosser, P., Shaw, P.: Guided Local Search for the Vehicle Routing Problems With Time Windows. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-heuristics: Advances and Trends in Local Search for Optimisation, pp. 473–486. Kluwer Academic Publishers, Dordrecht (1999)
Liu, F.H., Shen, S.Y.: A Route-Neighborhood-based Metaheuristic for Vehicle Routing Problem with Time Windows. European Journal of Operational Research 118, 485–504 (1999)
Bräysy, O., Berger, J., Barkaoui, M.: A new hybrid evolutionary algorithm for the vehicle routing problem with time windows. Presented at the Route 2000- Workshop, Skodsborg, Denmark (2000)
Gehring, H., Homberger, J.: Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows. Asia-Pacific Journal of Operational Research 18, 35–47 (2001)
Reimann, M., Doerner, K., Doerner, K.: A Savings based Ant System for the Vehicle Routing Problem. In: Proceedings 4th International Conference on Genetic and Evolutionary Computation (GECCO 2002), New York City, New York, USA, pp. 1317–1325. Morgan Kaufmann, San Francisco (2002)
Bräysy, O.: A Reactive Variable Neighbourhood Search for the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing 2002 INFORMS 00(0), 1–22 (2002)
Berger, J., Barkaoui, M., Bräysy, O.: A Route-directed Hybrid Genetic Approach for the Vehicle Routing Problem with Time Windows. Information Systems and Operational Research 41(2), 179–194 (2003)
Bräysy, O., Berger, J., Barkaoui, M., Dullaert, W.: A Threshold Accepting Metaheuristic for the Vehicle Routing Problem with Time Windows. Central European Journal of Operations Research 4 (2003)
Cordone, R., Wolfer-Calvo, R.: A heuristic for the vehicle routing problem with time windows. Journal of Heuristics 7, 107–129 (2001)
Potvin, J.Y., Bengio, S.: The Vehicle Routing Problem with Time Windows - Part II: Genetic Search. INFORMS Journal of Computing 8, 165–172 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sa’adah, S., Ross, P., Paechter, B. (2004). Improving Vehicle Routing Using a Customer Waiting Time Colony. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive