带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
算法中引入重载点，把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题。
In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP).
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
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.
应用推荐