摘要
以车辆调度问题为实例引出一种新的组合优化算法,并与原有的方法进行比较,说明新方法可以有效地抑止组合爆炸,极大地提高算法寻优效率。然后,本文用数学方法来证明该新方法在寻优上的正确性,最后根据两种不同算法编写各自对应的程序,用实际运行的结果来验证新算法带来的效率的提高。
In this paper,a new algorithm of the combination optimization is raised. The paper firstly takes an example of VRP to compare the new algorithm and the old one in order to prove that the new method can restrain the combination blast and increase the algorithm's efficiency. Besides, the accuracy of the new algorithm for seeking optimum solution is verified mathematically. Finally the executed results of the corresponding programs according to the new and old algorithms, validate that the new algorithm can improve the efficiency remarkably.
出处
《交通运输系统工程与信息》
EI
CSCD
2004年第3期86-91,共6页
Journal of Transportation Systems Engineering and Information Technology
关键词
铁路运输
启发式算法
组合优化
车辆调度
heuristics
combination and optimization
vehicle scheduling problem
improve
