Hybrid ant colony algorithm based on vehicle routing problem with time windows
Vehicle routing problem with time windows (VRPTW) is an NP-complete optimization problem. The objective of VRPTW is to use a fleet of vehicles with specific capacity to serve a number of customers with fixed demand and time window constraints. A hybrid ant colony system (DSACA-VRPTW) is proposed to solve this problem. Firstly, each ants solution might be improved by dynamic sweep Algorithm which makes improvement to the solutions by grouping the customers. Then a new improved ant colonies technique is proposed, after all colonies are in the state of stagnation, communication among them is carried out in order to do favor to leave the local peaks. Finally, Solomons benchmark instances (VRPTW 100-cuslomer) are tested for the algorithm and shows that the DSACA is able to find solutions for VRPTW.
Hybrid ant colony algorithm based vehicle routing time windows optimization
Yuhua Zhu Tong Zhen
College of Information Science and Engineering Henan University of Technology China, Zhengzhou, 450001
国际会议
2009 WASE International Conference on Information Engineering(2009年国际信息工程会议)(ICIE 2009)
太原
英文
709-712
2009-07-10（万方平台首次上网日期，不代表论文的发表时间）