【摘要】 在对有时间窗配送车辆调度问题进行描述的基础上,建立了该问题的基于直观描述的数学模型.通过设计一种新的解的表示方法构造了求解该问题的禁忌搜索算法,并以21个节点的运输网络为例进行了实验计算.计算结果表明,用作者设计的禁忌搜索算法求解有时间窗配送车辆调度问题,不仅可以取得很好的计算结果,而且算法的计算效率较高,收敛速度较快,计算结果也较稳定.更多还原

【Abstract】 On the basis of describing the distribution vehicle scheduling problem with time windows, this paper sets up the model of the problem based on natural description. Then this paper sets up a tabu search algorithm for the problem by presenting a new solution indicating method and makes some experimental computations to a transportation net with 21 nodes. The computational results demonstrates that the high quality solutions to the distribution vehicle scheduling problem with time windows can be obtained by using the new tabu search algorithm, and the new algorithm is also efficient and robust.更多还原