配送规划问题可以简化为货运车辆优化调度问题(Vehicle Scheduling Problem,VSP),是指对一系列装货点和卸货点,组织适当的行车线路,使车辆有序地通过它们, 在满足一定的约束条件(如货...
基于8个网页-相关网页
vehicle scheduling problem vsp 车辆调度问题
Wartime Vehicle Scheduling Problem 战时车辆调度问题
dynamic vehicle scheduling problem 动态车辆调度问题
Vehicle Scheduling Problem (VSP) is the main part of optimizing the distribution system.
配送的核心部分为配送车辆的集约、货物配装及送货过程。 进行配送系统优化，主要是配送车辆调度的优化。
参考来源 - 物流配送及其车辆优化调度研究Since vehicle scheduling problem is NP-hard,parallel genetic algorithm is proposed to solve this problem. In order to verify the effectiveness of the parallel genetic algorithm,stand VRP problems are used.
由于车辆调度问题属于NP难问题,提出了采用遗传算法对问题进行求解。
参考来源 - 基于GA的时变路网中车辆动态派遣的研究·2,447,543篇论文数据，部分数据来源于NoteExpress
The test results demonstrate the effectiveness of the RHSA to solve the dynamic vehicle scheduling problem.
测试结果验证了算法在求解动态车辆调度问题中的有效性。
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 traditional deterministic vehicle scheduling problem (VSP) was expanded into a VSP with fuzzy features. The cost coefficients of the VSP with the features were treated as fuzzy numbers.
将传统的确定性车辆调度问题扩展为具有模糊特征的模糊车辆调度问题。
应用推荐