The object of this paper is the vehicle routing problem with simultaneous pick-ups and deliveries.
本文对具有同时配送和收集需求的车辆路径问题进行了研究。
The graph model was applied to solve the vehicle routing problem with full load (VRPFL) and a driving distance restriction.
结果表明，该方法能有效地解决有行驶里程限制的满载车辆调度问题。
But the vehicle routing problem, as the traditional model for logistics distribution, fails behind the need of agile logistics.
但是，传统的车辆配送模型不适应敏捷物流的需要。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
For the attributes of the vehicle routing problem with disruption, a series of solving-simplify strategies are given to simplify the solution space.
针对多车场车辆调度干扰管理问题的特有属性，设计一系列求解简化策略，简化问题的求解空间。
Under the E-commerce transaction platform, the distribution becomes more complicated. It requests fast response, and the vehicle routing problem is prominent.
在电子商务交易平台下的物流配送复杂程度较高，要求能够快速响应配送需求，并且配送车辆行驶线路优化问题突出。
The proposed algorithm was applied to the Vehicle Routing Problem with Time Window (VRPTW). The experiment results indicates that the new algorithm is effective.
把该方法应用于有时间窗车辆路径问题，试验结果表明该算法是有效的。
Based on the analysis of the existing heuristic algorithm for the vehicle routing problem (VRP), a distribution model relevant to route arrangement was established.
在分析车辆路径问题(VRP)现有启发式算法的基础上，建立了考虑路线安排的物流配送方案模型，并提出了求解该问题的一种改进遗传算法(IGA)。
In kinds of the optimum problems of logistic, the vehicle routing problem with time window has been focused in the area because of its enormous benefit since it was proposed.
在物流的各种优化问题中，有时间窗的车辆路径问题由于其巨大的经济效益，从它被提出以来就一直是业界研究的热点。
But the solution of the vehicle routing problem in former research often focuses on unidirectional logistics distribution. And the research of bi-directional logistics is still immature.
从文献查阅来看，目前对车辆路径规划问题的研究大都集中于单向的物流配送，而对集货业务和配货业务同时存在的双向物流的研究还很不成熟。
Using the thought and method of system analysis, the paper researches the location-routing problem (LRP), which integrates the location-allocation problem and the vehicle routing problem.
本文运用系统分析的思想和方法，研究了物流系统中的设施定位-配给问题和车辆路线问题的组合优化问题——定位-车辆路线问题。
In the distribution of the LCL, according to the requirement higher in the service time about customer at present, the Vehicle Routing Problem with time Windows (VRPTW) was discussed especially.
在拼箱货物配送中，就目前客户对于配送服务时间要求的提高，本文重点讨论了带时间窗的车辆路径问题(VRPTW)。
MultiDepot Open Vehicle Routing Problem with soft time windows is a variation of the Vehicle Routing Problem con- strained by multidepot and soft time windows, which is a typical NP-hard problem.
有软时窗约束多车场开放式车辆路径问题是在基本的车辆路径问题上增加了时间窗约束和多车场作业的一种变化形式，是一个典型的NP-难问题。
This paper established the mathematic model and solving flow of multi-restriction vehicle routing problem.
建立了多约束条件车辆路径问题的数学模型和求解流程。
The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 -OPT算法计算时间的平均复杂度。
The typical vehicle routing problem is expanded to the situation that customers have the restriction of soft time Windows and a depot has various kinds of vehicles to distribute.
将典型的车辆路线问题扩展为综合考虑了客户具有软时间窗约束和中央仓库拥有多种类型配送车辆的情况。
If the resource is infinite in the distribution center, the distribution cost is not affected by the custom inventory, the problem is a vehicle routing problem with time window (VRPTW).
如果配送资源不受限制，总配送成本不受顾客的库存成本的影响，问题转化为带有时间窗的车辆路径问题(VRPTW)。
The problem of vehicle routing is discussed in a dynamic and stochastic traffic network with real-time information.
讨论了在动态随机网基于实时信息的车辆导航问题。
On the basis of the analysis of the characteristic of refuse collection system, it presents refuse collection vehicle routing problem according to the existing collection.
在分析城市生活垃圾收运系统特征的基础上，根据实际存在的城市生活垃圾收运方式，提出了垃圾收运车辆路线优化问题。
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.
本文在建立物流配送车辆优化调度数学模型的基础上，构造了求解该问题的免疫算法，并进行了实例计算。
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.
动态车辆路线和调度所涉及的问题范围较广，向决策者揭示关于该问题的信息范围所在也就确定了问题的解决方法。
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.
试算结果表明，对需求点分类后，应用遗传算法可有效解决联合物流模式的车辆调度问题。
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.
试算结果表明，对需求点分类后，应用遗传算法可有效解决联合物流模式的车辆调度问题。
应用推荐