带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
车辆优化调度问题已经成为运筹学与组合优化领域的前沿与研究热点问题。
So it has been an open problem and the front of Operational Research and Combinatorial Optimization.
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其NP难特性，采用精确优化方法有一定的局限性，不能得到令人满意的结果。
Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches.
本文从客户满意度的角度出发，在对物流配送介绍的基础上，针对车辆调度问题进行了优化探讨。
In the view of satisfaction of customers, at the base of introduction of physical distribution, this article discusses vehicle scheduling problem thoroughly.
本文在建立物流配送车辆优化调度数学模型的基础上，构造了求解该问题的免疫算法，并进行了实例计算。
On the basis of establishing the optimizing model on logistic vehicle routing problem, this paper presents a Immune algorithm for saving this problem, and makes some experimental calculations.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
The results demonstrate that the feasible solutions to the not-fully-loaded vehicle scheduling problem with soft time windows can easily be obtained using the algorithm.
本文在现代物流技术基础，特别是车辆调度和蚁群算法的基础理论指导下，针对现代物流运输车辆的调度优化问题，进行了理论、方法与模型的研究工作。
Based on the modern logistic technology, especially the vehicle scheduling and the ant algorithm theories, this paper make a research in theories, methods and models aiming at the present problems.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场VSP问题。
This paper presents two kinds of intelligent methods for multi-depots vehicle scheduling problem(MDVSP), and uses Tabu Search algorithm(TS) to optimize MDVSP with weight limit.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
本文以装甲车辆传动装置设计为例，研究产品设计资源受限项目调度规划方法和优化调度问题求解算法。
Taking transmission design of armored vehicles as an example, this dissertation does research on Resource-Constrained Project Scheduling Problem (RCPSP) for product design and the solving algorithms.
本文以装甲车辆传动装置设计为例，研究产品设计资源受限项目调度规划方法和优化调度问题求解算法。
Taking transmission design of armored vehicles as an example, this dissertation does research on Resource-Constrained Project Scheduling Problem (RCPSP) for product design and the solving algorithms.
应用推荐