路径问题

而要找到这样一个好的动态的Web服务，并且用最快最经济的方法来找到它，这就是求解最优路径问题。

The finding of a good dynamic web service with a fastest and most economic way is the problem of finding the optimization path .

关于VB程序设计中的路径问题

On Path in VB Programming

前N条最短路径问题的算法及应用

Algorithm and its application to N shortest paths problem

求解k条最优路径问题的遗传算法

A Genetic Algorithm for k Optimal Paths Problem

车辆路径问题（Vehicleroutingproblem，简称VRP）是物流研究领域的热点问题，合理的车辆路径规划可以降低物流配送成本，提升客户服务质量。

Vehicle Routing Problem ( VRP ) is a hot topic in the fields of logistics .

车辆路径问题（Vehicleroutingproblem）属于物流研究领域范畴，对于企业降低成本、提高效率起到重要的作用。

Vehicle Routing Problem belongs to the realm of Logistics Research and contributes more to lowing company operating costs and improving the service level .

基于GEP的最短避障路径问题的设计

Plan on Short Path Avoiding Obstructions Based on Gene Expression Programming

最后把改进的蚁群优化算法应用到GIS交通网络最短路径问题中，提高了搜索到全局最优解的速度。

Finally , an improved ant colony optimization algorithm is applied to the GIS transportation network shortest path problem , to improve the speed of the search to the global optimum solution .

使用Java™语言的时候这种情况很常见，因为类路径问题意味着使用的常常不是您所希望的版本或品牌的处理程序。

This is extremely common when working with the Java ™ language because classpath issues mean you often aren 't using the version or brand of processor that you think you are .

基于以上分析，我们给出了BCP和单约束最短路径问题（RSP，restrictedshortestpathproblem）的近似算法，并对算法性能进行了分析；

Based on this analysis , we propose approximate algorithms on BCP and RSP ( restricted shortest path problem ) and make performance analysis on them .

针对车辆路径问题存在的NP难题，设计了一种模仿动物捕食策略的捕食搜索算法进行求解。

With respect to the inherent NP-hard complexity of vehicle routing problem , a predatory search algorithm simulating animal predatory strategies was designed .

车辆路径问题（VRP）的一个启发式算法

A heuristic algorithm for vehicle routing

1994年，Adleman在著名杂志Science上发表第一篇关于DNA计算的文章，他用DNA在试管中解决了著名的哈密尔顿路径问题。

In 1994 , Adleman described his pioneering research on DNA computing in Science , where he computed an instance of the Hamiltonian path problem with DNA in test tubes .

带时间窗口的车辆路径问题（VRPTW）是一个NP-Complete优化问题。

Vehicle routing problem with time windows ( VRPTW ) is an NP-complete optimization problem .

在QoS路由算法研究过程中，形成了三类重要子问题：约束最短路径问题（RSP）；它是NP-完全的，并有许多具有多项式时间和伪多项式时间的启发式求解算法。

A basic problem in QoS routing is the restricted shortest path problem ( RSP ), which is known to be non-polynomial ( NP ) .

定位-车辆路径问题（LRP）集成了设施定位分配和车辆路径决策，属于NP-hard难题。

The location-routing problem ( LRP ), which combines the facility location allocation and vehicle routing decisions , is an NP-hard problem .

首先根据BGP路由模型稳定路径问题，对BGP路由振荡进行研究，从理论上深入地分析了BGP路由振荡的动态行为特征和振荡条件。

We first use the safe path problems to study the BGP route oscillation and theoretically analyze the dynamic behavior characteristics and conditions of BGP routes oscillations .

详细输出有助于解决类路径问题，例如没有打开JAR文件（因此不在类路径中）或从错误的位置装入了类。

Verbose output can help to solve classpath problems , such as JAR files not being opened ( and therefore not on the classpath ) and classes being loaded from the wrong place .

通过对Solomon基准测试集的实例进行实验计算，验证了改进方法的有效性和可行性。（4）研究了动态车辆路径问题。

The effectiveness and feasibility of the improved method is verified by calculating the examples of Solomon benchmarks set . ( 4 ) Dynamic vehicle routing problem is discussed .

多配送中心（也即多供货场）车辆路径问题（Multiple-DepotVehicleRoutingProblem，MDVRP），逐渐成为智能物流调度中的一个研究热点问题。

Multi Distribution Center ( ie more supply market ) Vehicle Routing Problem ( Multiple-Depot Vehicle Routing Problem , MDVRP ), become intelligent logistics scheduling of a research hot spots .

当VRP的一些量为随机变量时，车辆路径问题就转化为随机车辆路径问题（SVRP）。

Stochastic vehicle routing problems arise whenever some elements of the problem are random . vehicle ;

带时间窗的车辆路径问题及其扩展问题已被证明是NP-Hard问题，因此通常采用启发式算法求取满意解。

The vehicle routing problem with time window and its extended problems have been proved to be NP-Hard , and heuristic methods are usually used to gain satisfying solution .

在先探测后识别方法中，提出了以水下机器人运动方向与海流方向夹角为主要参数的当量行程的概念，并以此为依据设计了基于TSP最短路径问题的水下机器人的全局行走策略。

In the later method , suggests the concept of weighted journey based on the angle between AUV and ocean current , uses optimal result of TSP to solve the problem of global path planning .

有限增加主机路由避免移动IP三边路由的方法移动IPv6作为IPv6协议不可缺少的组成部分，解决了三角路径问题，使得路由优化、安全性等机制实现更简单。

A Resolution to Triangle Routing of Mobile IP by Adding Limited Host Route Mobile IPv6 is an important part of IPv6 , it avoid triangle routing , and simplify such things as routing procedure , security and so on .

经典Dijkstra算法是解决带权图中的单源点最短路径问题的，不能直接求解平面障碍环境中的最短路径规划问题。

The typical Dijkstra algorithm is used to solve the shortest path of single source point in weighted graph , and is not able to solve the above model directly .

最短路径问题常见于物流运输、车载导航与通讯网络等之中，有许多基于经典Dijkstra算法的求解方法已被一一提出。

Shortest path problems are often found in logistics distribution , on-vehicle navigation , communication network and so on , and many efficient algorithms based on classical Dijkstra algorithm have been developed already .

对解决子系统随机需求车辆路径问题，为提高交叉熵法性能，对用于更新Markov转移矩阵的路径，设计了根据分位值改变大小的自适应调整方法。

While dealing with the vehicle routing problems with stochastic demands for each subsystem , in order to improve the cross-entropy algorithm 's performance , an adaptive adjustment scheme was developed for the routes used to update Markov transition matrix in terms of the improvement level of quintiles .

针对具有时延和带宽约束最小代价路径问题，提出了基于4-堆和改进Fallback的多约束条件QoS路由算法，减少了计算最短路径以及根据QoS条件重复计算最短路径所耗费的时间。

Put forward the multiple constraints QoS routing algorithm based on the 4-heap and improved Fallback algorithm to solve the delay and bandwidth-constrained least-cost routing problem . Reduce the time of computing the shortest path and reduce double-counting time spent on the shortest path according to QoS constraints .

第二章探讨了物流配送最优路径问题的模型选择问题，提出了基于M-TSP模型的建模方案。

In Chapter II , the model choice of the problem of the best route of a logistic problem is studied , and a model based on M-TSP is chosen .

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

A PSO can solve a discrete combination optimization such as VRP by using random exchange sequence and PMX operator . It is supposed that the hybrid PSO will be an effective method for discrete combinatory problems .