测试结果验证了算法在求解动态车辆调度问题中的有效性。
The test results demonstrate the effectiveness of the RHSA to solve the dynamic vehicle scheduling problem.
最后，在以上研究的基础之上，开发了一套基于蚁群算法的动态车辆调度系统，并将此系统与其他动态车辆调度系统做了比较和分析。
Finally, this thesis develops a dynamic vehicle scheduling system based on ant colony algorithm and compares this system with other dynamic vehicle scheduling systems.
仿真试验表明，该算法不仅提高了最优解的质量，而且还具有搜索空间小、求解速度快的特点，能够有效地解决大规模动态车辆调度问题。
The simulation results show that the proposed algorithm can not only improve the optimal solution, but also reduce greatly the search space and computation time, and can solve the problem efficiently.
动态车辆路线和调度所涉及的问题范围较广，向决策者揭示关于该问题的信息范围所在也就确定了问题的解决方法。
Dynamic vehicle routing and dispatching refers to a wide range of problem where information on the problem is revealed to the decision maker concurrently with the determination of the solution.
为了解决个别站点可能出现的“涌现”现象，模型中给出了一种基于动态调整的车辆调度算法，从而减少了乘客的等待时间。
In order to solve soaring passengers' problem in some stations, this paper proposes a vehicle scheduling algorithm based on dynamic adjustment to reduce the waiting time of passengers.
为了解决个别站点可能出现的“涌现”现象，模型中给出了一种基于动态调整的车辆调度算法，从而减少了乘客的等待时间。
In order to solve soaring passengers' problem in some stations, this paper proposes a vehicle scheduling algorithm based on dynamic adjustment to reduce the waiting time of passengers.
应用推荐