Abstract
The objective of the multiple-depot vehicle routing problem (MDVRP) is to shorten the finish time, in the emergency management and special delivery research. In this paper, an ant colony algorithm for multiple-depot vehicle routing problem with shortest finish time (FTMDVRP) is studied. We discuss the concept and framework of FTMDVRP. The methods of making use of improved split algorithm to divide cars for given customer sequence is presented. We use the max flow algorithm allocate cars to each depot. Our experimental results confirm that our approach is effective in multiple-depot vehicle routing.
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
Dantzig, G., Ramser, J.: The Trunk Dispatching Problem. Management 6(6), 80–91 (1959)
Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Combinational Optimization. Johnly Wiley, New York (1979)
Nikolakopoulou, G., Kortesis, S., Synefaki, A., Kalfakakou, R.: Solving a Vehicle Routing Problem by Balancing the Vehicles Time Utilization. European Journal of Operational Research 152, 520–527 (2004)
Zhang, X., Ma, J., Liu, W., Jin, F.: Ant Colony Algorithm for Vehicle Routing Problem with Shortest Completion Time. In: The Proceedings of the 13th International Conference on Industrial Engineering and Engineering Management, pp. 2928–2933 (2006)
Zhong, S., He, G.: On Intelligent Optimization of Multi-depots Vehicle Scheduling Problem. Journal of East China Jiaotong University 6, 25–29 (2004)
Ma, J., Yuan, J., Zhang, Q.: Ant Colony Algorithms for Multiple-Depot Vehicle Routing. In: The Proceedings of 2009 Conference on Systems Science, Management Science & System Dynamics, pp. 55–60 (2009)
Lenstra, J.K., Kan, A.: Complexity of Vehicle Routing and Scheduling Problems. Networks 11, 221–227 (1981)
Liu, Y., Xuan, H.: Summarizing Research on Models and Algorithms for Vehicle Routing Problem. Journal of Engineering Management 19(1), 124–130 (2005)
Ma, J.: A Mutation Ant Colony Optimization Algorithm of Single Batch Machine Scheduling Problem. Computer Engineering and Applications 42(3), 53–56 (2006)
Zou, T., Li Ning, S.D., Li, J.: Genetic Algorithm for Multiple-Depot Vehicle Routing Problem. Computer Engineering and Applications 21, 82–83 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, J., Yuan, J. (2010). Ant Colony Algorithm for Multiple-Depot Vehicle Routing Problem with Shortest Finish Time. In: Zaman, M., Liang, Y., Siddiqui, S.M., Wang, T., Liu, V., Lu, C. (eds) E-business Technology and Strategy. CETS 2010. Communications in Computer and Information Science, vol 113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16397-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-16397-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16396-8
Online ISBN: 978-3-642-16397-5
eBook Packages: Computer ScienceComputer Science (R0)