The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.

• 带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。