本文从客户满意度的角度出发，在对物流配送介绍的基础上，针对车辆调度问题进行了优化探讨。
In the view of satisfaction of customers, at the base of introduction of physical distribution, this article discusses vehicle scheduling problem thoroughly.
研究车辆路径问题在物流配送系统中具有十分的重要意义。
Research on vehicle routing problem is of great importance in logistics distribution system.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
将典型的车辆路线问题扩展为综合考虑了客户具有软时间窗约束和中央仓库拥有多种类型配送车辆的情况。
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.
根据配送中心的货物包装种类繁多，且车辆装载能力与体积受到限制，提出了多包装形式下的货物配装问题。
Because there were many kinds of packaging in the logistic center and the capacity of vehicle was limited, the problem of the loading of goods under the situation of multi-packaging was put forward.
从文献查阅来看，目前对车辆路径规划问题的研究大都集中于单向的物流配送，而对集货业务和配货业务同时存在的双向物流的研究还很不成熟。
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.
在建立多车型配送车辆调度问题的数学模型的基础上，通过设计一种新的解的表示方法建立了求解该问题的禁忌搜索算法。
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.
铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题。
Vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up.
本文在建立物流配送车辆优化调度数学模型的基础上，构造了求解该问题的免疫算法，并进行了实例计算。
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.
配送车辆优化调度问题是一类求解较难的组合优化问题，由于其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 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.
如果配送资源不受限制，总配送成本不受顾客的库存成本的影响，问题转化为带有时间窗的车辆路径问题(VRPTW)。
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).
通过对物流车辆配送过程的分析，建立了带时间窗约束的物流配送路径优化问题的数学模型。
A mathematical model of logistics distribution route with time window was proposed according to the analysis of the logistics vehicle distribution process.
本文对具有同时配送和收集需求的车辆路径问题进行了研究。
The object of this paper is the vehicle routing problem with simultaneous pick-ups and deliveries.
针对物流配送中的多车场车辆调度问题提出了两种多车场的智能处理方法，并且用禁忌算法优化了容量约束的多车场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.
本文应用现代物流中选址问题及配送车辆路径问题的理论，解决铁路行包物流配送问题。
The thesis resolves logistics delivery problem applying the location theory and VRP theory in modern logistics.
在拼箱货物配送中，就目前客户对于配送服务时间要求的提高，本文重点讨论了带时间窗的车辆路径问题(VRPTW)。
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.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
Vehicle Routing problem (VRP) is a combination optimization problem in transportation logistics, which has been applied in many fields. It is a strong NP problem.
在电子商务交易平台下的物流配送复杂程度较高，要求能够快速响应配送需求，并且配送车辆行驶线路优化问题突出。
Under the E-commerce transaction platform, the distribution becomes more complicated. It requests fast response, and the vehicle routing problem is prominent.
本文在研究物流配送车辆优化调度问题的基础上，对有时间窗的车辆优化调度问题进行了分析。
This text has been researched to the vehicle-scheduling problem with time window on the basis of researched to logistic vehicle scheduling problem.
在分析车辆路径问题(VRP)现有启发式算法的基础上，建立了考虑路线安排的物流配送方案模型，并提出了求解该问题的一种改进遗传算法(IGA)。
Based on the analysis of the existing heuristic algorithm for the vehicle routing problem (VRP), a distribution model relevant to route arrangement was established.
在实际生活中，带时间窗的回程取货车辆路径问题在物流配送路线中广泛存在，例如零售业、快件与货运和逆向物流等，是物流管理学科的前沿热点问题之一。
In reality, VRPBTW is applied in a wide range of logistics and distribution, like retail, express & freight and reverse logistics, and it is one of the cutting-edge issues in the field of logistics.
在实际生活中，带时间窗的回程取货车辆路径问题在物流配送路线中广泛存在，例如零售业、快件与货运和逆向物流等，是物流管理学科的前沿热点问题之一。
In reality, VRPBTW is applied in a wide range of logistics and distribution, like retail, express & freight and reverse logistics, and it is one of the cutting-edge issues in the field of logistics.
应用推荐