一类货运车辆调度问题的混合禁忌搜索算法

Hybrid Tabu Search Algorithm for a Class of Freight Vehicle Dispatching Problem

摘要: 研究了一类货运车辆调度问题：带时间窗口车辆装卸货问题．首先给出了该问题的数学描述，通过引入快速局部搜索算法来加快禁忌搜索速度，提出了一种求解该问题的混合禁忌搜索算法，可以大大减少算法的运行时间而不影响解的质量，最后利用两个具有现实规模和复杂度的实例来测试．结果表明：本文提出的混合禁忌搜索算法是求解该类货运车辆调度问题的有效、快速算法．

Abstract: A class of freight vehicle dispatching problem,PDPTW(pickup and delivery problem with time windows),is studied in this paper.The mathematical description of this problem is firstly given and then a hybrid tabu search algorithm,employing FLS(fast local search)to speed the search,is proposed.The hybrid algorithm can reduce the computing time heavily meanwhile having no influence on the solution quality.Finally,two cases with the reality scale and complexity are used to evaluate the hybrid tabu search algorithm.The results indicate that this algorithm is effective and quick enough to solve such freight vehicle dispatching problems.