摘要
论文在对车辆路径问题进行简单描述的基础上,通过设计一种新的解的表示方法构造了求解该问题的一种新的禁忌搜索算法,并进行了实验计算。计算结果表明,用本文设计的禁忌搜索算法求解车辆路径问题,不仅可以取得很好的计算结果,而且算法的计算效率较高,收敛速度较快,计算结果也较稳定。
On the basis of describing the vehicle routing problem briefly,this paper presents a new solution indicating method then builds a new tabu search algorithm for the problem and make some experimental computations.The computational results demonstrates that the high quality solutions to the vehicle routing problem can be obtained by using the new tabu search algorithm,and the new algorithm is also efficient and robust.
出处
《管理工程学报》
CSSCI
2004年第1期81-84,共4页
Journal of Industrial Engineering and Engineering Management
关键词
车辆路径问题
禁忌搜索算法
优化
vehicle routing problem
tabu search algorithm
optimal
