针对随机需求的多车辆路径问题（MVRPSD），提出了一种简单有效的重优化新算法。
Put forward a simply effective reoptimization algorithm for multiple vehicles routing problem with stochastic demand(MVRPSD).
为研究多车辆协作的随机路径问题提供了新的理论和方法。
The paper provides a new way to the multiple vehicles coordinated Stochastic vehicle Routing Problem.
建立了多约束条件车辆路径问题的数学模型和求解流程。
This paper established the mathematic model and solving flow of multi-restriction vehicle routing problem.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的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.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
应用推荐