满载车辆调度问题是物流运输领域中一个非常值得研究的问题。
Vehicle scheduling problem with full-loads has long been a hot research issue in logistics & transportation industry.
结果表明，该方法能有效地解决有行驶里程限制的满载车辆调度问题。
The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
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.
应用推荐