摘要
研究了一类货运车辆调度问题 :带时间窗口车辆装卸货问题 .首先给出了该问题的数学描述 ,通过引入快速局部搜索算法来加快禁忌搜索速度 ,提出了一种求解该问题的混合禁忌搜索算法 ,可以大大减少算法的运行时间而不影响解的质量 ,最后利用两个具有现实规模和复杂度的实例来测试 .结果表明 :本文提出的混合禁忌搜索算法是求解该类货运车辆调度问题的有效、快速算法 .
A class of freight vehicle dispatching problem, P DP TW (pickup and delivery problem with time windows), is studied in this paper. Th e mathematical description of this problem is firstly given and then a hybrid ta bu search algorithm, employing FLS (fast local search) to speed the search, is p roposed. The hybrid algorithm can reduce the computing time heavily meanwhile ha ving no influence on the solution quality. Finally, two cases with the reality s cale and complexity are used to evaluate the hybrid tabu search algorithm. The r esults indicate that this algorithm is effective and quick enough to solve such freight vehicle dispatching problems.
出处
《信息与控制》
CSCD
北大核心
2004年第6期724-728,共5页
Information and Control
基金
国家自然科学基金资助项目 (60 2 740 13 )
