计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (26): 181-183.

• 工程与应用 • 上一篇    下一篇

可选时间窗VRP的禁忌搜索算法

马华伟,张述初   

  1. 合肥工业大学 计算机网络研究所,合肥 230009
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-09-11 发布日期:2007-09-11
  • 通讯作者: 马华伟

Tabu search algorithm for VRP with alternative time windows

MA Hua-wei,ZHANG Shu-chu   

  1. Institute of Computer Network,Hefei University of Technology,Hefei 230009,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-09-11 Published:2007-09-11
  • Contact: MA Hua-wei

摘要: 车辆调度问题(VRP)是广泛应用于物流配送等领域的一类组合优化问题。对实际中广泛存在的可选时间窗的车辆调度问题(VRPATW)进行了研究,建立了VRPATW问题的数学模型,并利用PFIH算法和禁忌搜索的混合算法进行求解,最后通过实验说明此算法解决VRPATW问题的有效性和可行性。

关键词: 可选时间窗车辆调度问题, PFIH算法, 禁忌搜索

Abstract: Vehicle Routing Problem(VRP) is a kind of combinatorial optimization problem which plays an important role in the fields of physical distribution and logistics.VRP with Alternative Time Windows(VRPATW) is studied,a mathematical model of VRPATW is established and a PFIH-tabu search algorithm is introduced to solve.Then computational results are provided to show that the algorithm can be used to solve VRPATW efficiently.

Key words: VRPATW, PFIH, tabu search