Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.

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

youdao

The hot-rolling batch planning problem is treated as a constraint satisfaction problem. A VRPSTW constraint satisfaction model with uncertain rolling plan number is established.

将热轧批量计划问题作为一个约束满足问题处理，建立不确定计划数的VRPSTW约束满足模型。

youdao