Abstract
Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. This paper considers vehicle routing models with time windows and its hybrid intelligent algorithm. Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid intelligent algorithm base on dynamic sweep and ant colony algorithm (DSACA-VRPTW) is proposed to solve this problem. Firstly, each ant’s solution might be improved by dynamic sweep algorithm. Then a new improved ant colonies technique is proposed for it. Finally, Solomon’s benchmark instances (VRPTW 100-customer) are tested for the algorithm and shows that the DSACA is able to find solutions for VRPTW.
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
Clark, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Point. Operations Research 12, 568–581 (1964)
Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agen. IEEE Transactions on Systems, Man and Cybernetics, Part B 26(1), 29–41 (1996)
Dorigo, M., DiCaro, G., Gambardella, L.M.: Ant Algorithms for Discrete Optimization. Artificial Life 5(2), 137–172 (1999)
Bullnheimer, B., Hartl, R.F., Strauss, C.: Applying the Ant System to the Vehicle Routing Problem. In: Osman, I.H., Voss, S., Martello, S., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 109–120. Kluwer Academics, Dordrecht (1998)
Colorni, A., Dorigo, M., Maniezzo, V., Trubian, M.: Ant System for Job-shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science (JORBEL) 34, 39–53 (1994)
Costa, D., Hertz, A.: Ants Can Colour Graphs. Journal of the Operational Research Society 48, 295–305 (1997)
Dorigo, M., Gambardella, L.M.: Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation 1, 53–66 (1997)
Gambardella, L.M., Dorigo, M.: HAS-SOP: An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem, INFORMS. Journal on Computing 12(3), 237–255 (2000)
Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant Colonies for the Quadratic Assignment Problem. Journal of the Operational Research Society 50, 167–176 (1999)
Solomon, M.M.: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35, 254–265 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Q., Zhen, T., Zhu, Y., Zhang, W., Ma, Z. (2008). A Hybrid Intelligent Algorithm for the Vehicle Routing with Time Windows. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Theoretical and Methodological Issues. ICIC 2008. Lecture Notes in Computer Science, vol 5226. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87442-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-87442-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87440-9
Online ISBN: 978-3-540-87442-3
eBook Packages: Computer ScienceComputer Science (R0)