计算机与现代化 ›› 2011, Vol. 1 ›› Issue (6): 73-3.doi: 10.3969/j.issn.1006-2475.2011.06.021

• 算法分析与设计 • 上一篇    下一篇

基于TS的动态车辆调度问题的混合算法研究

袁建清   

  1. 黑龙江东方学院计算机科学与电气工程学部,黑龙江 哈尔滨 150086
  • 收稿日期:2011-03-18 修回日期:1900-01-01 出版日期:2011-06-29 发布日期:2011-06-29

Mixed Tabu Search Algorithm for Dynamic Vehicle Scheduling Problem

YUAN Jian-qing   

  1. Institute of Computer Science and Electric Engineering, Heilongjiang East Academy, Harbin 150086, China
  • Received:2011-03-18 Revised:1900-01-01 Online:2011-06-29 Published:2011-06-29

摘要: 对带时间窗的动态车辆调度问题进行分析,采用实时再优化方法进行研究,引入时间轴概念,建立动态车辆调度模型,并给出求解的混合禁忌搜索算法。该算法先用CK节约算法求得初始解,然后用禁忌搜索进行优化,得到全局最优解。禁忌搜索算法中采用动态邻域移动方法构造候选解和动态禁忌长度选取策略设置紧急长度,提高算法的收敛速度。最后用实例证明该混合算法的可行性和有效性。

关键词: 动态车辆调度, 混合禁忌搜索算法, 禁忌搜索算法, CK节约法, 动态信息

Abstract: On the basis of studying dynamic vehicle scheduling problem with time windows, a dynamic vehicle scheduling mathematical model is established through introducing time axis concept and adopting realtime optimizing research methods. Then a mixture algorithm based on a CK economical method and Tabu Search algorithm is designed to solve dynamic vehicle scheduling problem. This algorithm improves convergence speed by using dynamic candidate solutions constructor method and dynamic length selection strategy. Finally computational results are provided to show that the mixed Tabu Search algorithm is feasible and efficient.

Key words: dynamic vehicle scheduling, mixed Tabu Search algorithm, Tabu Search algorithm, CK economical method, dynamic information