Abstract
The Vehicle Routing Problem with Time Windows is an important task in logistic planning. The expenditure on employing labor force, i.e., drivers for vehicles, accounts for most of the costs in this domain. We propose an initialized Ant Colony approach, IACO-VRPTW, with the primary goal (f 1) to reduce the number of vehicle needed to serve the customers and the second-priority goal (f 2) of decreasing the travel distance. Compared with methods that optimize f 2, IACO-VRPTW can reach or reduce f 1 in 8 out of 18 instances of the Solomon benchmark set, at the cost of increasing travel distance slightly. IACO-VRPTW can effectively decrease the number of vehicles, travel distance and runtime compared with an ACO without initialization.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: European Conference on Artificial Life, Paris, France, December 11-13, pp. 134–142 (1991)
Yu, B., Yang, Z.Z., Yao, B.Z.: A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications 38(1), 435–441 (2011)
Alvarenga, G.B., Mateus, G.R., de Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computer and Operations Research 34(6), 1561–1584 (2007)
Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR 37, 297–318 (1999)
Li, H., Lim, A.: Local search with annealing-like restarts to solve the vrptw. European Journal of Operational Research 150(1), 115–127 (2003)
Berger, J., Barkaoui, M.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers and Operations Research 31(12), 2037–2053 (2004)
Qi, C., Sun, Y.: An improved ant colony algorithm for vrptw. In: 2008 International Conference on Computer Science and Software Engineering, pp. 455–458 (2008)
Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162(1), 220–238 (2005)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35(2), 254–265 (1987)
Gambardella, L.M., Taillard, É., Agazzi, G.: Macs-vrptw: A multiple ant colony system for vehicle routing problems with time windows. Technical Report IDSIA-06-99, IDSIA, Lugano, Switzerland (1999)
Bent, R., Van Hentenryck, P.: A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science 38(4), 515–530 (2004)
Solomon, M.M.: Vrptw benchmark problems, http://web.cba.neu.edu/~msolomon/problems.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shi, W., Weise, T. (2013). An Initialized ACO for the VRPTW. In: Yin, H., et al. Intelligent Data Engineering and Automated Learning – IDEAL 2013. IDEAL 2013. Lecture Notes in Computer Science, vol 8206. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41278-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-41278-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41277-6
Online ISBN: 978-3-642-41278-3
eBook Packages: Computer ScienceComputer Science (R0)