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

查看全文 作　　者：DENG [1]Ye;ZHU [1]Wanhong;LI [1]Hongwei;ZHENG [2]Yonghui

机构地区：[1]College of Field Engineering, Army Engineering University of PLA;[2]Department of Fire Control, Armored Force Institute of PLA

出　　处：《Journal of Systems Engineering and Electronics》索引2018年第29卷第3期,共14页

摘　　要：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. 关键词：系统算法蚂蚁系统路由问题时间依赖时间窗口多类型车辆优化过程

相关文献

参考文献（58）
引证文献（16）
耦合文献（0）

参考文献(58)

引证文献(16)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

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

参考文献(58)

引证文献(16)

用户提示