为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。

In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.

youdao

有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。

MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.

youdao