Transit vehicle routing problem with time intervals-constrained is considered.
提出了具有时间窗的货物运输车辆路径问题。
Research on vehicle routing problem is of great importance in logistics distribution system.
研究车辆路径问题在物流配送系统中具有十分的重要意义。
A new method is proposed for solving Vehicle Routing Problem with Stochastic Demands (VRPSD).
提出一种解决随机需求车辆路径问题(VRPSD)新方法。
The object of this paper is the vehicle routing problem with simultaneous pick-ups and deliveries.
本文对具有同时配送和收集需求的车辆路径问题进行了研究。
The paper provides a new way to the multiple vehicles coordinated Stochastic vehicle Routing Problem.
为研究多车辆协作的随机路径问题提供了新的理论和方法。
Vehicle routing problem on railway baggage and parcel is a problem of simultaneous delivery and pick up.
铁路行包配送车辆路径问题属于同时具有送货和集货需求的车辆路径问题。
Vehicle Routing Problem with Time Windows(VRPTW) is much more attractive for the great realistic meaning.
本文重点研究了基于混合遗传算法求解有时间窗车辆路径问题。
This paper established the mathematic model and solving flow of multi-restriction vehicle routing problem.
建立了多约束条件车辆路径问题的数学模型和求解流程。
This paper proposes a novel affinity based on group match to apply immune algorithm to 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 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.
但是，传统的车辆配送模型不适应敏捷物流的需要。
In order to save logistic distribution costs, a multi-depots vehicle routing problem with multiple constraints(MDVRPMC)was proposed.
为节约物流配送费用，提出一类多约束条件下的多车场车辆路径问题。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
Vehicle routing problem with soft time Windows (VRPSTW) is a variation of vehicle routing problem (VRP), which is a typical NP-hard problem.
带软时间窗的车辆路径问题(VRPSTW)是在基本的车辆路径问题(VRP)上增加了时间窗约束条件的一种变化形式，是一个典型的NP -难问题。
They can be divided into two parts:experiments on vehicle routing problem and vehicle routing problem with simultaneous pickup and delivery.
实验主要包括两部分：对车辆路径问题和集送货一体化的车辆路径问题的数据集分别进行了测试。
A special asymmetric vehicle routing problem is presented for modeling the hot rolling lot planning since it accords with the production practice.
本文提出了更为接近热轧批量计划编制实际的特殊不对称车辆路径问题作为热轧批量计划编制问题的数学模型。
The model was firstly converted into a crisp multi-depot vehicle routing problem, and then it was solved by a predator search algorithm with FLOYD.
为了求解上述模型，首先将模型进行清晰化处理，使之转化为一类确定性多设施车辆路径模型，然后设计了嵌入FLOYD算法的捕食搜索算法对之进行求解。
For the attributes of the vehicle routing problem with disruption, a series of solving-simplify strategies are given to simplify the solution space.
针对多车场车辆调度干扰管理问题的特有属性，设计一系列求解简化策略，简化问题的求解空间。
In this paper, we presented a kind of special vehicle routing problem(VRP) based on reality- vehicle routing problem with facultative demands(VRPFD).
本文基于现实的问题提出了一类特殊的车辆路线问题（VRP）—任意客户需求量的车辆路线问题（VRPFD）。
The numerical experiment has proved the value of Inventory Routing Problem whose total cost is much less than that of general Vehicle Routing Problem.
数值实验证明了库存路径问题得到的解要优于一般的车辆路径问题得到的解。
Multiple demands vehicle routing problem (MVRP) comes from organization and implementation of transportation in large scale industrial production process.
多重运输调度问题(MVRP)来源于大规模生产过程的运输组织与实施。
The proposed algorithm was applied to the Vehicle Routing Problem with Time Window (VRPTW). The experiment results indicates that the new algorithm is effective.
把该方法应用于有时间窗车辆路径问题，试验结果表明该算法是有效的。
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.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强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.
车辆路径问题是一类在物流配送调度中具有广泛应用的组合优化问题，属于强np难题。
应用推荐