基于改进蚁群算法的有时间窗约束的车辆路径问题研究-计算机应用技术专业论文.docxVIP

摘 摘 要 有时间窗约束的车辆路径问题(VRPTW)是近几十年来运筹学、应 用数学、网络分析、图论、计算机应用及交通运输等学科研究的一个热 点问题。VRPTWIh-]题作为一个NP(Non．deterministic Polynomial)多项式复 杂程度的非确定性问题)难题，随着客户数量的增加，可选的配送路径 方案数量将以指数速度急剧增长。因此，用启发式算法求解该问题就成 为人们研究的一个重要方向。 蚁群算法是一种新兴的启发式算法。它具有正反馈、并行计算、较 强的鲁棒性等诸多特点，在很多领域有着广泛的应用。然而，一般蚁群 算法在求解组合优化问题过程中容易出现过早收敛或停滞现象。为了解 决这些问题，本文针对VRPTW问题给出了一种新的改进算法，通过对改 进蚁群算法的分析。利用面向对象的思想实现该算法，采用一系列 Benchmark Problems对算法进行测试，实验结果表明改进蚁群算法在 求解VRPTW上是有效的。 本文研究成果对建立现代物流运输车辆优化调度系统有现实的理 论指导意义和应用价值，对蚁群算法的研究有一定的参考价值。 关键字：蚁群算法启发式算法时间窗车辆路径问题 ABSTRACTVehicle ABSTRACT Vehicle Routing Problem With Time Windows(VI心TW)was an important problem in recent years in the fields of Operational Research． Application Mathematics，Network Analysis，Graph Theory,Computer Applications，Traffic Transportation etc．As a NP．hard problem。VRPTW will increase exponentially along with the adding of customers．So it becomes an important studying trend to solve the vehicle scheduling problem with heuristic algorithm． Ant Colony Optimization(AC01 algorithm iS a new heuristic algorithm to the combinatorial optimization problem．0、树ng to its positive feedback and effective parallelization and strong lustiness．ACO has been applied in many fields．However,T11e traditional algorithms have the problems of early convergence or stagnation in the process of combinatorial optimization problems．To solve these problems，this paper proposes a new improved ant colony algorithm of solving the VRPTW problem．Through the analysis of the principle of ACS，the improved ACS Was realized by Obiect—Oriented thought．，nle test result of a series of Benchmark Problems indicated that the improved ACS Was emcient in solving VRPTW． The conclusion of this thesis has significance of realistic theory and application value to the establishment of Logistics Distribution and vehicle routing problem，and it is valuable for the study of ant colony Algorithm． Key Words：ACS Heuristic Algorithm Time Windows Vehicle Routing Problem 长春理工大学硕士(或博士)学位论文原创性声明本人郑重声明：所呈交的硕士(或博士)学位论文，《基于改 长春理工大学硕士(或