Fastest Complete Vehicle Routing Problem Using Learning Multiple Ant Colony Algorithm
The objective of fastest completed vehicle routing problem (FCVRP) is to minimum complete time, this kind VRP problem was applied in emergency management and quick response supply chain management. Multiple ant colony algorithm for this problem is studied in this paper. The conception of FCVRP is given and Then learning multiple ant colony algorithm is bring forward to solve FCVRP and one numerical example is solved by this algorithm at last.
vehicle routing problem multiple ant colony algorithm local search fastest complete time
SIYUAN WEN HONGCUI WEI
ShanDong Economic University, JiNan ShanDong China, 250014
国际会议
The Third International Conference on Modelling and Simulation(第三届国际建模、计算、仿真、优化及其应用学术会议 ICMS 2010)
无锡
英文
113-116
2010-06-04(万方平台首次上网日期,不代表论文的发表时间)