Improved ant colony optimisation for the dynamic multi-depot vehicle routing problem

International Journal of Logistics Research and Applications

Volumn 16, Issue 2, 2013, Pages 144-157

  Yu, Bin ^a   Ma, Ning ^a   Cai, Wanjun ^a   Li, Ting ^a   Yuan, Xiaoting ^a   Yao, Baozhen ^b  

^a DALIAN MARITIME UNIVERSITY   (China)

^b DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

distance based clustering approach; dynamic multi depot vehicle routing problem; improved ant colony optimisation; nearest addition approach

Indexed keywords

EID: 84879618055     PISSN: 13675567     EISSN: 1469848X     Source Type: Journal    
DOI: 10.1080/13675567.2013.810712     Document Type: Article

References (27)

1. Bell, J. E. and McMullen, P. R. 2004. "Ant Colony Optimization Techniques for the Vehicle Routing Problem.". Advanced Engineering Informatics, 18 (1): 41 - 48. (doi:10.1016/j.aei.2004.07.001)
2. Bienstock, D., Bramel, J. and Simchi-Levi, D. 1993. "A Probabilistic Analysis of Tour Partitioning Heuristics for the Capacitated Vehicle Routing Problem with Unsplit Demands.". Mathematics of Operations Research, 18 (4): 786 - 802. (doi:10.1287/moor.18.4.786)
3. Bullnheimer, B., Hartl, R. F. and Strauss, C. "Applying the Ant System to the Vehicle Routing Problem.". Second metaheuristics international conference, MIC'97. Sophia-Antipolis, France.
4. Bullnheimer, B., Hartl, R. F. and Strauss, C. 1999. "An Improved Ant System Algorithm for the Vehicle Routing Problem.". Annals of Operations Research, 89 (0): 319 - 328. (doi:10.1023/A:1018940026670)
5. Christofides, N. and Eilon, S. 1969. "An Algorithm for One Vehicle-Dispatching Problem.". Operational Research Quarterly, 20 (3): 309 - 318. (doi:10.1057/jors.1969.75)
6. Dondo, R. and Cerdá, J. 2007. "A Cluster-Based Optimization Approach for the Multi-Depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows.". European Journal of Operational Research, 176 (3): 1478 - 1507. (doi:10.1016/j.ejor.2004.07.077)
7. Dorigo, M., Maniezzo, V. and Colorni, A. 1996. "Ant System: Optimization by a Colony of Cooperating Agents.". IEEE Transactions on Systems, Mans, and Cybernetics, 26 (1): 29 - 41. (doi:10.1109/3477.484436)
8. Flatberg, T., Hasle, G., Kloster, O., Nilssen, E. J. and Riise, A. 2007. "Dynamic and Stochastic Vehicle Routing in Practice.". Operations Research/Computer Science Interfaces Series, 38 (1387-666x): 41 - 63. (doi:10.1007/978-0-387-71722-7_3)
9. Fleischmann, B., Gnutzmann, S. and Sandvob, E. 2004. "Dynamic Vehicle Routing Based on Online Traffic Information.". Trans Science, 38 (4): 420 - 433. (doi:10.1287/trsc.1030.0074)
10. Franklin, T. H. and Beatrice, M. O. B. 2007. "Dynamic Vehicle Routing Using Genetic Algorithms.". Applied Intelligence, 27 (1): 89 - 99. (doi:10.1007/s10489-006-0033-z)
11. Ganesh, K. and Narendran, T. T. 2007. "CLOVES: A Cluster-and-Search Heuristic to Solve the Vehicle Routing Problem with Delivery and Pick-Up.". European Journal of Operational Research, 178 (3): 699 - 717. (doi:10.1016/j.ejor.2006.01.037)
12. Gendreau, M. and Potvin, J. Y. 1998. "Dynamic Vehicle Routing and Dispatching.". In Fleet Management and Logistics, Edited by: Crainic, T. G. and Laporte, G. 115 - 126. Boston/Dordrecht/London: Kluwer Academic Publishers.
13. Gillett, B. E. and Johnson, J. G. 1976. "Multi-Terminal Vehicle-Dispatch Algorithm.". Omega, 4 (6): 711 - 718. (doi:10.1016/0305-0483(76)90097-9)
14. Ichoua, S., Gendreau, M. and Potvin, J. Y. 2000. "Diversion Issues in Realtime Vehicle Dispatching.". Trans Science, 34 (4): 426 - 438. (doi:10.1287/trsc.34.4.426.12325)
15. Jin, M., Liu, K. and Bowden, R. O. 2007. "A Two-Stage Algorithm with Valid Inequalities for the Split Delivery Vehicle Routing Problem.". International Journal of Production Economics, 105 (1): 228 - 242. (doi:10.1016/j.ijpe.2006.04.014)
16. Larsen, A. 2000. "The Dynamic Vehicle Routing Problem.". PhD Thesis, Technical University of Denmark.
17. Montemanni, R., Gambardella, L. M., Rizzoli, A. E. and Donati, A. V. 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem.". Journal of Combinatorial Optimization, 10 (4): 327 - 343. (doi:10.1007/s10878-005-4922-6)
18. Osman, I. H. 1993. "Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.". Annals of Operations Research, 41 (4): 421 - 451. (doi:10.1007/BF02023004)
19. Psaraftis, H. N. 1995. "Dynamic Vehicle Routing: Status and Prospects.". Annals of Operational Research, 61 (1): 143 - 164. (doi:10.1007/BF02098286)
20. Renaud, J., Laporte, G. and Boctor, F. F. 1996. "A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem.". Computers & Operations Research, 23 (3): 229 - 235. (doi:10.1016/0305-0548(95)O0026-P)
21. Sáez, D., Cortés, C. E. and Núñez, A. 2008. "Hybrid Adaptive Predictive Control for the Multi-Vehicle Dynamic Pick-Up and Delivery Problem Based on Genetic Algorithms and Fuzzy Clustering.". Computers and Operations Research, 35 (11): 3412 - 3438. (doi:10.1016/j.cor.2007.01.025)
22. Savelsbergh, M. and Sol, M. 1998. "DRIVE: Dynamic Routing of Independent Vehicles.". Operations Research, 46 (4): 474 - 490. (doi:10.1287/opre.46.4.474)
23. Yang, Z.-Z., Yu, B. and Cheng, C.-T. 2007. "A Parallel Ant Colony Algorithm for Bus Network Optimization.". Computer-Aided Civil and Infrastructure Engineering, 22 (1): 44 - 55. (doi:10.1111/j.1467-8667.2006.00469.x)
24. Yu, B. and Yang, Z.-Z. 2011. "An Ant Colony Optimization Model: The Period Vehicle Routing Problem with Time Windows.". Transportation Research Part E, 47 (2): 166 - 181. (doi:10.1016/j.tre.2010.09.010)
25. Yu, B., Yang, Z.-Z., Jin, P.-H., Wu, S.-H. and Yao, B.-Z. 2012. "Transit Route Network Design-Maximizing Direct and Transfer Demand Density.". Transportation Research Part C, 22 (0): 58 - 75. (doi:10.1016/j.trc.2011.12.003)
26. Yu, B., Yang, Z.-Z. and Li, S. 2012. "Real-Time Partway Deadheading Strategy Based on Transit Service Reliability Assessment.". Transportation Research Part A, 46 (8): 1265 - 1279.
27. Yu, B., Yang, Z.-Z. and Yao, B.-Z. 2009. "An Improved Ant Colony Optimization for Vehicle Routing Problem.". European Journal of Operational Research, 196 (1): 171 - 176. (doi:10.1016/j.ejor.2008.02.028)