Ant Colony Algorithm for Vehicle Scheduling Problem with Time Window of Logistics Distribution

摘要：

This paper is aimed to research into vehicle scheduling problem(VSP) with time windows by using ant colony algorithm. It built up a vehicle routing model with time windows based on the objective of minimum transportation cost, and analyzed the model characteristics and application prospects. It put forward a program of ant colony algorithm to solve the model, and gave an example to demonstrate the model and its algorithm program, and to describe the concrete application method. The study indicates that the model and its program of ant colony algorithm can effectively solve the vehicle scheduling problems of distribution centers, and the parameter selection of ant colony algorithm can significantly influence the algorithm convergence.

关键词： Logistics distribution VSP Time window Ant colony algorithm

作者: GONG Yancheng BAO Liping

作者单位: School of Automobile Management,Automobile Management Institute,P.R.China,233011

会议类型: 国际会议

会议名称: 2009 International Conference on Management Science and Engineering(2009管理科学与工程国际会议)

会议地点: 北京

会议语种:英文

页码: 876-879

在线出版日期: 2009-11-01（万方平台首次上网日期，不代表论文的发表时间）