带时间窗集送货需求可分车辆路径问题的改进蚁群算法  

Improved Ant Colony Algorithm for Vehicle Routing Problem with Time Windows and Split Pickups and Deliveries

作　　者：杨鹏[1,2] 邹浩[1] 徐贤浩[2] 

机构地区：[1]湖南财政经济学院,湖南长沙410205 [2]华中科技大学管理学院,湖北武汉430074

出　　处：《系统工程》2015年第9期58-62,共5页Systems Engineering

基　　金：国家自然科学基金重点资助项目(71131004);国家留学基金资助项目(201208430341);中国博士后科学基金资助项目(2013M542027);湖南省哲学社会科学基金资助项目(13YBA053);湖南省教育厅科学研究优秀青年项目(13B006)

摘　　要：围绕提高物流效率、降低运输成本,对集送货需求可分车辆路径问题进行了研究。首先考虑集送货需求可分和时间窗的约束,设计了带时间窗集送货需求可分的车辆路径模型,然后结合模型特点提出了一种改进的蚁群算法,并通过算例分析与已有文献算法结果进行比较。研究结果表明,改进的蚁群算法能够有效地求解集送货需求可分的车辆路径问题。In order to improve the efficiency of logistics and reduce the transportation cost,the vehicle routing problem with split pickups and deliveries is studied.First,considering the constraints of split pickups and deliveries and time windows,vehicle routing model of VRPSPDPTW is designed,then the improved ant colony algorithm is proposed according to the characteristics of model,finally the results of algorithm is compared with the existing literature by a numerical example.The results show that the improved ant colony algorithm can effectively solve the problem of VRPSPDPTW.

关 键 词：集送货 需求可分 时间窗 车辆路径问题 蚁群算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]