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 -难问题。
The results demonstrate that the feasible solutions to the not-fully-loaded vehicle scheduling problem with soft time windows can easily be obtained using the algorithm.
结果表明,用该算法进行带软时间窗的非满载车辆调度优化问题,可以方便有效地求得满意解。
The typical vehicle routing problem is expanded to the situation that customers have the restriction of soft time Windows and a depot has various kinds of vehicles to distribute.
将典型的车辆路线问题扩展为综合考虑了客户具有软时间窗约束和中央仓库拥有多种类型配送车辆的情况。
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-难问题。
I got the idea from a story named “Soft Time” – about young people spending time in Lijiang.
我读过一篇名为《温柔时光》的文章,讲述了一群年轻人在丽江的生活,正是这个故事启发了我。
I got the idea from a story named “Soft Time” – about young people spending time in Lijiang.
我读过一篇名为《温柔时光》的文章,讲述了一群年轻人在丽江的生活,正是这个故事启发了我。
应用推荐