A Hybrid Approach Based on Ant Colony System for the VRPTW
The main objective of vehicle routing problem (VRP) is to minimize the total required fleet size for serving all customers. Secondary objectives are to minimize the total distance traveled or to minimize the total route duration of all vehicles. In this paper, we present a hybrid ant colony System, named IACS, coupled with the iterated local search (ILS) algorithm for the VRP with time windows (VRPTW). The ILS can help to escape local optimum. Experiments on various aspects of the algorithm and computational results for some benchmark problems are reported. We compare our approach with some classic, powerful meta-heuristics and show that the proposed approach can obtain the better quality of the solutions.
Ant colony system Iterated local search Vehicle routing problem with time windows
Yuping Wang
College of Automation Beijing Union University Beijing, China
国际会议
北京
英文
537-540
2010-09-18（万方平台首次上网日期，不代表论文的发表时间）