Based on Ant Colony Blurred Time Vehicle Scheduling Algorithm

摘要：

　　With the acceleration of global economic integration and the rapid development of e-commerce logistics become more and more important.How to build a logistics distribution mode to meet both Low-cost and client satisfaction become an important and urgent research topics.In this paper we proposed a based on ant colony blurred time vehicle scheduling algorithm (BVSA).Blurred time vehicle scheduling problem is a good extension of traditional vehicle scheduling problem(VSP).In BVSA we studied many problems such as client satisfaction,vehicle waiting time,vehicle traffic time and vehicle distance.We use ant colony algorithm to solve these problems and the experiment show good results.

关键词： Ant Colony Algorithm Blurred Time Windows VSP VRP Logistics

作者: Zuo Baohe Lin Shaozhu

作者单位: Dept. School of Computer Science & Engineering,South China University of Technology Guangzhou China,510006

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 272-275

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