Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (4): 216-218.DOI: 10.3778/j.issn.1002-8331.2010.04.068

• 工程与应用 • Previous Articles     Next Articles

Study on multiple vehicle routing problem integrated terminal cargo based on improved tabu search in distribution center

BIE Wen-qun1,LI Yong-jun2   

  1. 1.Guangdong Industry Technical College,Guangzhou 510300,China
    2.School of Computer Science and Engineering,South China University of Technology,Guangzhou 510641,China
  • Received:2009-09-22 Revised:2009-11-03 Online:2010-02-01 Published:2010-02-01
  • Contact: BIE Wen-qun



  1. 1.广东轻工职业技术学院,广州 510300
    2.华南理工大学 计算机科学与工程学院,广州 510641
  • 通讯作者: 别文群

Abstract: This paper studies the multiple vehicle routing problem integrated terminal cargo.In this problem,there is delivery or pick-up and uncertain features in the demands of the clients.The paper devises a tabu search algorithm for vehicle routing problem.The algorithm decomposes the routing problem into a number of small questions by vehicles-the customer distribution structure,then the tabu search algorithm is used in each sub-problem.At last,a global optimal solution is selected from all sub-optimal solutions.

Key words: reverse logistics, Vehicle Routing Problem(VRP), tabu search algorithm, blur model

摘要: 多车辆集散货物路线问题是客户可以同时取货和发货,而且客户发货量在路线安排前是不确定的。提出了一种改进的禁忌搜索算法,该算法将路径问题按不同的车辆-顾客分配结构分解成若干子问题,然后用禁忌搜索算法求解每个子问题,最后从所有子问题的最优解中选出全局最优解。

关键词: 逆向物流, 车辆路径问题, 禁忌搜索, 模糊模型

CLC Number: