We also describe the SSH project in Huawei's VRP platform.

并且介绍了SSH在华为VRP平台上的应用项目。

The VRP and the network flow problem are all famous network optimization problems.

车辆路径问题和网络流问题都是非常著名的网络优化问题。

In the dissertation, the vehicle routing problems (VRP) with transshipment points are mainly studied.

本文主要对带有转运中心的各类车辆组合运输问题进行了研究。

With typical representation and complexity, the VRPFD differs from the classical VRP in various aspects.

该问题不同于一般的VRP，具有典型的代表性和复杂性。

The influence of uncontrollable factors, such as emergency and earthquake, on post VRP also has been analyzed.

同时对突发事件和地震等不可抗力因素对邮件车辆路径问题的影响进行了分析。

The key to solve the real-time VRP is how to get information timely and adequately, and make in-time response.

解决实时VRP的关键问题在于如何及时、充分掌握信息，以及做出实时的响应。

The thesis resolves logistics delivery problem applying the location theory and VRP theory in modern logistics.

本文应用现代物流中选址问题及配送车辆路径问题的理论，解决铁路行包物流配送问题。

PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.

通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。

A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator.

通过引入随机交换序、PMX算子使微粒群优化算法能够求解车辆路径问题这类离散组合优化问题。

The algorithm for VRP is very valuable in the respects of dispatching large quantity goods and assignment tasks for labors.

VRP在大规模物资调运、劳务人员的任务分配等方面具有重要的使用价值。

First we formulated the vehicle pickup and delivery problem using GIS-VRP method so as to satisfy the customer service requests.

首先，我们用GIS - VRP方法描绘车辆取货和递送问题，以满足客户服务申请。

To build return laden VRP model for a pharmaceutical factory, a recycling plant, a number of pharmacies, and analysis it by a case.

构建了一个制药厂，一个回收处理厂，多个药店的回程载货VRP模型，并进行了实例分析。

At the same time, the basic principle of the saving algorithm is described, and the question of VRP was resolved using better saving.

同时，论述了节约算法的基本原理并采用改进的节约算法对配载车辆调度问题进行求解，即在基本的节约算法中加入时间窗约束条件。

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 -难问题。

The VRP was changed into a quasi-continuous problem by designing a new real coding. Constrained terms in VRP were processed by the penalty function.

设计了求解车辆路径问题的一种新的实数编码方案，将车辆路径问题转化成准连续优化问题，并采用罚函数法处理约束条件。

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）。

Based on the recently developed new intelligent optimization idea: artificial ant system, we proposes a quick ant searching algorithm for solving VRP.

基于近些年出现的新型智能优化思想：人工蚂蚁系统，给出了一种可快速求解VRP的蚂蚁搜索算法。

Rolling plan problem is analyzed and a rolling plan VRP model with uncertain rolling plan Numbers is suggested according to hot rolling production practice.

分析了轧制批量计划编制问题，建立了不确定轧制计划数的轧制计划VRP模型。

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难题。

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)。

The relation between confidence level and demand possibility distribution and their effect to VRP solution are studied from the angle of model and experiment results.

从模型和实验数据两个角度，详细探讨了置信度和需求的可能性分布对问题解的影响，以及二者在问题求解过程中相互间的关系。

The mathematic model of this VRP is analyzed, and a chaos optimization algorithm is proposed, then the coding method and compute operators are introduced in this paper.

本文分析了该类VRP问题的数学模型，提出了一种针对该问题的混沌优化算法，介绍了具体的编码方法和实现算子。

In this paper, Genetic Algorithms (GA) for VRP with simple conditions was introduced and cross operator in GA was improved. These researches made full preparation for us to study PDPTW.

本文首先介绍了遗传算法在解决简单约束车辆路径问题上的应用，改进了交叉算子，为研究有时间窗装卸问题的遗传算法作了充分准备。