RLC_ACS: AN IMPROVED ANT COLONY ALGORITHM FOR VRPSDP
This paper studies the reverse logistics vehicle routing problem with simultaneous distribution of the goods and collection of the ones as same as the initial state by a homogeneous fleet of vehicles with capacities constraint and maximum distance constraint under a single depot.It presents a mixed integer programming model.For the complex feature of the fluctuating vehicle load, this paper uses an Ant Colony System (ACS) approach combining with the pheromone updating strategy of ASRank and MM AS ant algorithm.Also a heuristic factor based on residual loading capacity is designed to improve the vehicle loading ability.Additionally, the paper proposes a candidate list based on saving-ant, and uses a local search with sweeping in the process of tour improvement to accelerate the searching.By making Comparisons with different algorithms of other researches, the experimental study indicates that RLC_ACS could obtain the satisfactory solution in the acceptable time.
VRPSDP Ant colony system Mixed integer programming
TAO ZHANG WEN-XIN TIAN YUE-JIE ZHANG XUE-CHAO ZHENG
School of Information Management and Engineering, Shanghai University of Finance and Economics, Shan Information Office in Center of Modem Education Technology of Shanghai Finance University, Shanghai Department of Computer Science and Engineering, Fudan University, Shanghai Key Laboratory of Intelli
国际会议
2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)
香港
英文
978-983
2007-08-19（万方平台首次上网日期，不代表论文的发表时间）