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.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。
Vehicle Routing Problem with Time Windows(VRPTW) is much more attractive for the great realistic meaning.
本文重点研究了基于混合遗传算法求解有时间窗车辆路径问题。
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 -难问题。
In the distribution of the LCL, according to the requirement higher in the service time about customer at present, the Vehicle Routing Problem with time Windows (VRPTW) was discussed especially.
在拼箱货物配送中，就目前客户对于配送服务时间要求的提高，本文重点讨论了带时间窗的车辆路径问题(VRPTW)。
This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem with time Windows.
将免疫算法用于求解车辆路径问题，并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法。
This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem with time Windows.
将免疫算法用于求解车辆路径问题，并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法。
应用推荐