The effective size of the vehicle scheduling problem algorithm analysis.
规模车辆调度问题的有效算法分析。
The test results demonstrate the effectiveness of the RHSA to solve the dynamic vehicle scheduling problem.
测试结果验证了算法在求解动态车辆调度问题中的有效性。
Vehicle scheduling problem with full-loads has long been a hot research issue in logistics & transportation industry.
满载车辆调度问题是物流运输领域中一个非常值得研究的问题。
In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP).
算法中引入重载点，把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
In the view of satisfaction of customers, at the base of introduction of physical distribution, this article discusses vehicle scheduling problem thoroughly.
本文从客户满意度的角度出发，在对物流配送介绍的基础上，针对车辆调度问题进行了优化探讨。
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.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
This paper presents two kinds of intelligent methods for multi-depots vehicle scheduling problem(MDVSP), and uses Tabu Search algorithm(TS) to optimize MDVSP with weight limit.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场VSP问题。
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.
将传统的确定性车辆调度问题扩展为具有模糊特征的模糊车辆调度问题。
The solving tactics of dividing a multi-depot vehicle scheduling problem into several single-depot vehicle scheduling problems by using the minimum distance distribution method is presented.
提出了采用距离最近分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略。
Vehicle scheduling problem with non full load is a fundamental problem of vehicle scheduling problem. Because it is a typical NP hard problem, traditional algorithms usually are not satisfied.
非满载车辆调度问题是车辆调度问题中的一个基本问题，由于它是一个典型的NP难题，传统方法的求解结果往往不能令人满意。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
Based on a mathematic model of the multi-vehicle distribution scheduling problem, the authors find a tabu search algorithm for it through designing a new solution expression method.
在建立多车型配送车辆调度问题的数学模型的基础上，通过设计一种新的解的表示方法建立了求解该问题的禁忌搜索算法。
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.
为了解决个别站点可能出现的“涌现”现象，模型中给出了一种基于动态调整的车辆调度算法，从而减少了乘客的等待时间。
应用推荐