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

    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

  • 约束车场开放式车辆路径问题在基本车辆路径问题上增加了时间窗约束多车场作业的变化形式,是一个典型的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

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定