Vehicle scheduling problem with hard time windows (VSPHTW) is a variation of vehicle scheduling problem (VSP), which is a typical NP-hard problem.

• 带硬时间窗的车辆路径问题(VSPHTW)是在基本的车辆路径问题(VSP)上增加了时间窗约束条件的一种变化形式，是一个典型的NP难题。