Multi-type ant system algorithm for the time dependent vehicle routing problem with time windows

被引:0
作者
DENG Ye [1 ]
ZHU Wanhong [1 ]
LI Hongwei [1 ]
ZHENG Yonghui [2 ]
机构
[1] College of Field Engineering, Army Engineering University of PLA
[2] Department of Fire Control, Armored Force Institute of PLA
关键词
multi-type ant system(MTAS); time dependent; vehicle routing problem with time windows(VRPTW); nearest neighbor selection(NNS);
D O I
暂无
中图分类号
TP18 [人工智能理论]; U463.6 [电气设备及附件];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ; 080204 ; 082304 ;
摘要
The time dependent vehicle routing problem with time windows(TDVRPTW) is considered. A multi-type ant system(MTAS) algorithm hybridized with the ant colony system(ACS)and the max-min ant system(MMAS) algorithms is proposed. This combination absorbs the merits of the two algorithms in solutions construction and optimization separately. In order to improve the efficiency of the insertion procedure, a nearest neighbor selection(NNS) mechanism, an insertion local search procedure and a local optimization procedure are specified in detail. And in order to find a balance between good scouting performance and fast convergence rate, an adaptive pheromone updating strategy is proposed in the MTAS. Computational results confirm the MTAS algorithm's good performance with all these strategies on classic vehicle routing problem with time windows(VRPTW) benchmark instances and the TDVRPTW instances, and some better results especially for the number of vehicles and travel times of the best solutions are obtained in comparison with the previous research.
引用
收藏
页码:625 / 638
页数:14
相关论文
共 24 条
[1]  
Time-dependent routing problems: A review[J] . Michel Gendreau,Gianpaolo Ghiani,Emanuela Guerriero.Computers and Operations Research . 2015
[2]   On service consistency in multi-period vehicle routing [J].
Luo, Zhixing ;
Qin, Hu ;
Che, ChanHou ;
Lim, Andrew .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 243 (03) :731-744
[3]  
A Comparative Study of Proposed Genetic Algorithm-Based Solution with Other Algorithms for Time-Dependent Vehicle Routing Problem with Time Windows for E-Commerce Supply Chain[J] . Suresh Nanda Kumar.Journal of Service Science and Management . 2015 (06)
[4]  
An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries[J] . Mustafa Avci,Seyda Topaloglu.Computers & Industrial Engineering . 2015
[5]  
Minimum cost VRP with time-dependent speed data and congestion charge[J] . Liang Wen,Richard Eglese.Computers and Operations Research . 2015
[6]  
A time-dependent vehicle routing problem in multigraph with FIFO property[J] . Mostafa Setak,Majid Habibi,Hossein Karimi,Mostafa Abedzadeh.Journal of Manufacturing Systems . 2015
[7]   Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery [J].
Zhang, Tao ;
Chaovalitwongse, W. Art ;
Zhang, Yuejie .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (01) :288-309
[8]  
A constructive heuristic for time-dependent multi-depot vehicle routing problem with time-windows and heterogeneous fleet[J] . Behrouz Afshar-Nadjafi,Alireza Afshar-Nadjafi.Journal of King Saud University - Engineering Sciences . 2014
[9]   Vehicle Routing Optimization Using Multiple Local Search Improvements [J].
Fosin, Juraj ;
Caric, Tonci ;
Ivanjko, Edouard .
AUTOMATIKA, 2014, 55 (02) :124-132
[10]  
The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics[J] . Miguel Andres Figliozzi.Transportation Research Part E . 2011 (3)