A Study on Emergency Logistics Vehicle Routing Problem Based on Improved Ant Colony Algorithm

International Journal of Computer Science and Engineering

© 2018 by SSRG - IJCSE Journal

Volume 5 Issue 7

Year of Publication : 2018

Authors : Qinghua Yan, Lianhua Wang

10.14445/23488387/IJCSE-V5I7P102

How to Cite?

Qinghua Yan, Lianhua Wang, "A Study on Emergency Logistics Vehicle Routing Problem Based on Improved Ant Colony Algorithm," SSRG International Journal of Computer Science and Engineering , vol. 5,  no. 7, pp. 6-13, 2018. Crossref, https://doi.org/10.14445/23488387/IJCSE-V5I7P102

Abstract:

Taking the emergency materials distribution after natural disasters as background, a mathematical model with the shortest distribution path as the goal is set up. The model is solved by ant colony algorithm and the ant path transfer and pheromone evaporation factor is optimized, at the same time using C - W algorithm and 2 - opt method to optimize the algorithm.The case study shows that the improved ant colony algorithm is effective in the emergency logistics vehicle routing problem.

Keywords:

Emergency logistics;Vehicle routing problem;Ant colony algorithm

References:

[1] Zhang wei, Yang bin,Zhu xiaolin. Research on multi-objective emergency logistics path selection [J]. Journal of jiangsu university of science and technology (nature science edition),2017,31(02):219-224. 
[2] Liu Yang. A study on the scheduling of humanitarian aid in uncertain time [D]. Shandong university,2017. 
[3] Xu zhiyu, Peng jiacheng, Xu weisheng. Batch distribution planning of emergency logistics and ant colony optimization solution [J]. Computer engineering and application,2011,47(24):1-3+8. 
[4] Tang chong. Emergency logistics vehicle scheduling based on simulated annealing algorithm [J]. Logistics technology,2017,36(01):114-116. 
[5] Gong yawei. Research and implementation of optimal path selection for emergency relief vehicles [D]. Wuhan university of technology,2008. 
[6] Zhang bin. Research on the optimal scheduling of emergency logistics vehicles [D]. Dalian maritime university,2007. 
[7] Xu haoqin. Emergency resource scheduling research based on hybrid optimization strategy [D]. Henan university,2009. 
[8] Zhang yuhua, Pan yu. Research on emergency logistics delivery vehicle scheduling based on ant colony algorithm [J]. Modern logistics,2009, (5):47-50. 
[9] G.Clarke,J. W. Wright. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points[J]. Operations Research,1964,12(4). 
[10] M.G.A. Verhoeven,E.H.L. Aarts,P.C.J. Swinkels. A parallel 2-opt algorithm for the Traveling Salesman Problem[J]. Future Generation Computer Systems, 1995,11(2). 
[11] Zhai lulu. Optimization research on ship waste collection and transportation route based on hybrid ant colony algorithm [D]. Donghua university, 2017. 
[12] Zhang jun, Zhang jing, Song xuechao. Simulated annealing ant colony algorithm in the application of VRP problems [J]. Journal of xihua university (natural science edition), 2017, 4 (6) : 6 - 12. 
[13] Wang shuqin. Research on ant colony algorithm for vehicle path problem [D]. Chongqing university, 2008. 
[14] Li yanv, Pan guangzhen. Study on the relationship between volatility and iteration number and optimal path length in ant colony algorithm [J]. Science, technology and engineering,2013,13(23):6734-6738. 
[15] Yang changhao, zhang zhuo. Study on parameter selection of basic ant colony algorithm in solving TSP problem [J]. Network security technology and application, 2018(05):26-28. 
[16] Wu jun. Research on logistics distribution path optimization based on improved ant colony algorithm [D]. Wuhan University oftechnology, 2000.