论文部分内容阅读
本文设计了一种禁忌搜索算法(Tabu Search Algorithm)求解车辆路径问题(Vehicle Routing Problem)。该算法的领域移动基于3-opt交换的两种拓展形式;并且在评价移动时,引入了加权系数来综合考虑容量约束和距离值的要求来提高解的质量。最后采用了运筹学文献上8个经典问题来测试该算法,结果表明算法是高效的。最后,阐明了车辆路径问题在公安巡逻勤务中的应用。
In this paper, we design a tabu search algorithm to solve vehicle routing problem. The domain moving of this algorithm is based on two kinds of expansion forms of 3-opt exchange. When evaluating moving, the weighting coefficient is introduced to improve the quality of solution by considering the requirements of capacity constraint and distance value. At last, eight classic problems in operation research literature are used to test the algorithm. The result shows that the algorithm is efficient. Finally, it clarifies the application of vehicle routing in public security patrolling service.