Furthermore, the passenger train planning and timetabling can also be formulated as a kind of OVRP with soft time windows. In this dissertation, the subproblem of this case, passenger train timetabling, is studied from a new point of view.
此外，铁路旅客列车开行方案及其运行图编制问题也可以归结为一类带软时间窗约束的开放式车辆路径问题，本文对该案例问题的一个子问题，即旅客列车运行方案图编制问题，从新的角度进行了研究。
参考来源 - 开放式车辆路径问题及其应用研究·2,447,543篇论文数据，部分数据来源于NoteExpress
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 -难问题。
By means of the idea of parallel search, the detailed procedure of the MPSO algorithm is given for solving vehicle scheduling problem with soft time Windows.
根据多相粒子群并行搜索的思想，给出mpso算法在带软时间窗物流配送车辆调度路径优化的实现流程。
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.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
应用推荐