中国机械工程Issue(2)：247-254,8.DOI:10.3969/j.issn.1004132X.2015.02.022
基于改进蚁群算法的带时间窗废品收集车辆路径问题
Waste Collection Vehicle Routing Problem with Time Windows Based on Improved Ant Colony Optimization
摘要
Abstract
A mathematical model aiming at minimizing the fuel consumption for the waste collec-tion vehicle routing problem with time windows,driver rest period and multiple disposal facilities was set up.The main factors to affect the fuel consumption of a vehicle considered herein were the load of a vehicle and distance traveled.An improved MAX-MIN ant system algorithm was proposed.Based on characteristics of the time windows,two kinds of dynamic candidate lists were designed to improve the searching efficiency of the algorithm.A new probabilistic condition transition rule for the MAX-MIN ant system algorithm was proposed.The nearest neighborhood search with distance limitation was in-tegrated in the transition rule of proposed algorithm.The proposed model and algorithm were valida-ted by comparion with benchmark problems in literatures.关键词
大规模带时间窗车辆/路径问题/蚁群算法/燃油消耗Key words
large scale vehicle with time windows/routing problem/ant colony optimization/fuel consumption分类
信息技术与安全科学引用本文复制引用
刘琼,刘秀城,张超勇,饶运清..基于改进蚁群算法的带时间窗废品收集车辆路径问题[J].中国机械工程,2015,(2):247-254,8.基金项目
国家自然科学基金资助重点项目(51035001) （51035001）
国家自然科学基金资助项目(51275190) （51275190）
国家科技重大专项(2011ZX04015-011-07) （2011ZX04015-011-07）
中央高校基本科研业务费专项资金资助项目(HUST:2013ZZGH002) （HUST:2013ZZGH002）
