计算机与数字工程2013，Vol.41Issue(4)：512-515,520,5.
多策略优化的蚁群算法求解带时间窗车辆路径问题
Improved Ant Colony Algorithm Based on Different Optimal Methods for Solving Vehicle Routing Problem with Time Windows
摘要
Abstract
An improved ant colony algorithm is proposed for solving vehicle routing problem with time windows. The given algorithm introduces time heuristic function into state transfer rules and revises the pheromone increment formula of Ant-Cycle model by introducing the factors of waiting time and delay time. In order to avoid the algorithm trapped in local optimum, the pheromone increment of optimal path random selected is decreased by chaos disturbance. The optimal solution is adjusted according to client coordinates and time windows. Experiment results show that the results are compared with some other heuristic methods which is promising in good performances.关键词
蚁群算法/时间窗/车辆路径问题/优化Key words
ant colony algorithm/ time window/ vehicle routing problem/ optimization分类
信息技术与安全科学引用本文复制引用
李娅,王东..多策略优化的蚁群算法求解带时间窗车辆路径问题[J].计算机与数字工程,2013,41(4):512-515,520,5.基金项目
广东省科技计划工业攻关项目(编号:2011B010200031) （编号:2011B010200031）
广东省科技计划项目(编号:2012B040301032) （编号:2012B040301032）
广东高校优秀青年创新人才培养项目(编号:2012LYM_0132)资助. （编号:2012LYM_0132）
