An Improved Tabu Search for the Split Delivery VRP

摘要：

This paper describes the split deliveries vehicle routing problem briefly and presents an improved tabu search algorithm. At each iteration, a neighbor solution at each iteration by removing a customer from a set of routes where it is currently visited and inserting it either into a new route or into an existing route that has enough residual capacity. The algorithm also considers the possibility of inserting a customer into a route without removing it from another route.The insertion of a customer into a route is done by means of the cheapest insertion method. The experimental results show that the improved algorithm is feasible and valid for the Split Delivery VRP.

作者: Degang Xu Renbin Xiao Shengxuan Wang

作者单位: Department of Control Engineering,Huazhong University of Science and Techology,Wuhan 430074,China;Sc Department of Control Engineering,Huazhong University of Science and Techology,Wuhan 430074,China School of Information Science and Engineering,Henan University of Technology,Zhengzhou 450001,China

会议类型: 国际会议

会议名称: 2008 IEEE International Symposium on IT in Medicine and Education(2008信息技术在医学和教育中的应用国际研讨会)(ITME 2008)

会议地点: 厦门

会议语种:英文

页码: 945-948

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