规模车辆调度问题的有效算法分析。
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.
本文所论述的方法对于实际的货运车辆调度问题具有指导意义。
The methods described in the paper is practical for truck scheduling.
分析露天矿车辆调度问题，建立求解矿山车辆调度问题的数学模型。
The problem of vehicle scheduling in open pit mine are analyzed to build the mathematical model of resolving the vehicle scheduling problem.
结果表明，该方法能有效地解决有行驶里程限制的满载车辆调度问题。
The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.
将传统的确定性车辆调度问题扩展为具有模糊特征的模糊车辆调度问题。
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.
研究一类带工作时间约束的集装箱专用车辆调度问题的混合禁忌搜索算法。
A container vehicle routing problem with working time constraint load is studied in this paper.
试算结果表明，对需求点分类后，应用遗传算法可有效解决联合物流模式的车辆调度问题。
The trial calculation results show that vehicle routing problem for logistics alliance model can be solved efficiently by the improved hybrid algorithm through the classification of the demand points.
本文从客户满意度的角度出发，在对物流配送介绍的基础上，针对车辆调度问题进行了优化探讨。
In the view of satisfaction of customers, at the base of introduction of physical distribution, this article discusses vehicle scheduling problem thoroughly.
算法中引入重载点，把求解有时间窗的调度问题转化为求解多个有确定开始时间的车辆调度问题。
In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP).
提出了采用距离最近分配法将多配送中心车辆调度问题分解为多个单配送中心车辆调度问题进行求解的策略。
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.
在建立多车型配送车辆调度问题的数学模型的基础上，通过设计一种新的解的表示方法建立了求解该问题的禁忌搜索算法。
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.
算例结果表明，该算法能够求解一定车队规模的除雪车辆调度问题，能够提高冬季道路养护的水平，为实际应用奠定了基础。
The numerical example shows that the algorithm can solve the model which has a certain fleet size. It can increase the level of winter road maintenance and lay a foundation for practical applications.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场VSP问题。
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.
非满载车辆调度问题是车辆调度问题中的一个基本问题，由于它是一个典型的NP难题，传统方法的求解结果往往不能令人满意。
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.
同时，论述了节约算法的基本原理并采用改进的节约算法对配载车辆调度问题进行求解，即在基本的节约算法中加入时间窗约束条件。
At the same time, the basic principle of the saving algorithm is described, and the question of VRP was resolved using better saving.
仿真试验表明，该算法不仅提高了最优解的质量，而且还具有搜索空间小、求解速度快的特点，能够有效地解决大规模动态车辆调度问题。
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.
带有时间窗的车辆优化调度问题是比VSP复杂程度更高的NP难题。
The vehicle-scheduling problem with time window is also a NP-hard problem being more complicated than VSP.
无极绳调度绞车是利用钢丝绳循环往复地牵引固定在钢丝绳上的车辆或其他装备前进，能有效解决矿井辅助运输问题。
The endless-rope dispatching winch tows the tram cars or other equipments which are fixed on cable wire to solve the problem of assistant conveyance of mines.
本文在建立物流配送车辆优化调度数学模型的基础上，构造了求解该问题的免疫算法，并进行了实例计算。
On the basis of establishing the optimizing model on logistic vehicle routing problem, this paper presents a Immune algorithm for saving this problem, and makes some experimental calculations.
结果表明，用该算法进行带软时间窗的非满载车辆调度优化问题，可以方便有效地求得满意解。
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.
本文在现代物流技术基础，特别是车辆调度和蚁群算法的基础理论指导下，针对现代物流运输车辆的调度优化问题，进行了理论、方法与模型的研究工作。
Based on the modern logistic technology, especially the vehicle scheduling and the ant algorithm theories, this paper make a research in theories, methods and models aiming at the present problems.
车辆优化调度问题已经成为运筹学与组合优化领域的前沿与研究热点问题。
So it has been an open problem and the front of Operational Research and Combinatorial Optimization.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其NP难特性，采用精确优化方法有一定的局限性，不能得到令人满意的结果。
Logistic vehicle routing problem is combination optimization that is difficult to solve. Due to its NP characteristics, we can't get satisfying results when we use exact approaches.
运营车辆的智能排班是公交车辆智能调度需要解决的问题之一。
The intelligent schedule of vehicles operation is one of the problems which needs to be solved in the public transportation intelligent dispatch.
运营车辆的智能排班是公交车辆智能调度需要解决的问题之一。
The intelligent schedule of vehicles operation is one of the problems which needs to be solved in the public transportation intelligent dispatch.
应用推荐