带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
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.
算法中引入重载点，把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题。
In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP).
同时，论述了节约算法的基本原理并采用改进的节约算法对配载车辆调度问题进行求解，即在基本的节约算法中加入时间窗约束条件。
At the same time, the basic principle of the saving algorithm is described, and the question of VRP was resolved using better saving.
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
应用推荐