本文对具有同时配送和收集需求的车辆路径问题进行了研究。
The object of this paper is the vehicle routing problem with simultaneous pick-ups and deliveries.
铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题。
Vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up.
数值实验证明了库存路径问题得到的解要优于一般的车辆路径问题得到的解。
The numerical experiment has proved the value of Inventory Routing Problem whose total cost is much less than that of general Vehicle Routing Problem.
传统的车辆路径问题只考虑物品装载的质量属性约束，而忽略其他装载属性约束。
In the classical vehicle routing problem, it considers the goods weight constraint only, but ignores other loading constraints, such as the loading space constraint.
在分析热轧生产批量计划通用模型的基础上，采用了带有时间窗的车辆路径问题模型。
The VRPTW model that is suitable to resolve the problems of the production lot planning of the hot rolling strip is suggested.
实验主要包括两部分：对车辆路径问题和集送货一体化的车辆路径问题的数据集分别进行了测试。
They can be divided into two parts:experiments on vehicle routing problem and vehicle routing problem with simultaneous pickup and delivery.
分析了需求不可分割带能力约束的车辆路径问题(cvrp)的2 -OPT算法计算时间的平均复杂度。
The complexity of the 2 -opt algorithm for the capacitated vehicle routing problem (CVRP) was analyzed in this paper.
在物流的各种优化问题中，有时间窗的车辆路径问题由于其巨大的经济效益，从它被提出以来就一直是业界研究的热点。
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.
如果配送资源不受限制，总配送成本不受顾客的库存成本的影响，问题转化为带有时间窗的车辆路径问题(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).
在拼箱货物配送中，就目前客户对于配送服务时间要求的提高，本文重点讨论了带时间窗的车辆路径问题(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-难问题。
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.
带软时间窗的车辆路径问题(VRPSTW)是在基本的车辆路径问题(VRP)上增加了时间窗约束条件的一种变化形式，是一个典型的NP -难问题。
Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.
最优路径规划是智能车辆导航定位系统中一个非常关键的问题。
The optimum path search is a very important problem in the intelligent vehicle guidance and location system.
车辆路径问题和网络流问题都是非常著名的网络优化问题。
The VRP and the network flow problem are all famous network optimization problems.
首先，从车辆路径问题入手，介绍它的定义，分类，变量，以及其他一些相关情况。
First of all, starting from the vehicle route problem, we introduce its definition, classification, the variable, and some other relevant situations.
第4章研究了随机旅行时间车辆路径问题的模型和算法。
In chapter 4, we research models and algorithms of vehicle routing problems with stochastic time.
关于车辆路径问题的研究，国内外已有不少专家进行过研究，但大都不令人满意。
On research of vehicle path problem, a lot of specialists have been in research for it in many countries, but few of result can make people satisfaction.
车辆路径问题是供应链研究的一项重要内容。
Vehicle routing problem is an important content in supply chain field.
建立了多约束条件车辆路径问题的数学模型和求解流程。
This paper established the mathematic model and solving flow of multi-restriction vehicle routing problem.
研究车辆路径问题在物流配送系统中具有十分的重要意义。
Research on vehicle routing problem is of great importance in logistics distribution system.
车辆路径问题在物流管理的研究中受到大量关注。
In logistic management research, vehicle routing problem has gained a lot of attention.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
提出了具有时间窗的货物运输车辆路径问题。
Transit vehicle routing problem with time intervals-constrained is considered.
为研究多车辆协作的随机路径问题提供了新的理论和方法。
The paper provides a new way to the multiple vehicles coordinated Stochastic vehicle Routing Problem.
一个准确的车辆导航系统有利于实现大型农用机械的大面积作业，因此研究自动跟踪路径系统是当前必不可少的问题。
An accurate vehicle guidance system can be favorable to lots of working of many large agricultural mechanics, and the study of automatic path following system is an important problem.
将免疫算法用于求解车辆路径问题，并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法。
This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem.
将免疫算法用于求解车辆路径问题，并根据车辆路径问题的具体情况提出了一种基于分组匹配的亲和力计算方法。
This paper proposes a novel affinity based on group match to apply immune algorithm to vehicle routing problem.
应用推荐