A Scatter Search Algorithm for Solving Multi-depot Vehicle Routing Problem

摘要：

This paper considers the multi-depot vehicle routing problem (MDVRP), a generalization of the VRP. Objective of the proposed MDVRP is to minimize the total cost of dispatching cost and traveling cost. The MDVRP need decide the route that customer is visited. Here, we use a scatter search (SS) framework to solve MDVRP. A heuristic-based random initialization procedure is developed to generate the diversification solution. A sweep algorithm and the insertion heuristic are designed for the improvement and combination method respectively. The result shows that the SS can solve the multi-depot vehicle routing problem effectively.

关键词： Multi-depot VRP Scatter Search Sweep Algorithm Insertion Heuristic

作者: Jun Zhang Jiafu Tang Yi Han Hanwen Chang

作者单位: Key Laboratory of Integrated Automation of Process Industry of MOE, Northeastern University, Shenyang, P.R.China, 110004

会议类型: 国际会议

会议名称: 第十四届工业工程与工程管理国际会议(The Proceedings of The 14th International Conference on Industrial Engineering and Engineering Management IE&EM2007)

会议地点: 天津

会议语种:英文

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