拣货路径优化问题在提高物流中心效率中具有重要的作用。
The optimization of order-picking routing problem in raising the efficiency of logistics centre has an important role.
最后，将算法运用于实际的物流管理中的配送路径优化问题。
The other aspect is an exercise in application field, Problem for Logistic Distribution.
首先，将整个曲面作为搜索空间，路径长度作为目标函数，设定了路径优化问题。
First, curved surface is considered as the search field and the length of route as the objective function, thus the optimization problem of route is set.
路径优化问题属于组合优化问题，而解决组合优化问题一般使用启发式搜索算法。
The path optimization problem belongs to combinatorial optimization problems, which is solved generally by using heuristic search algorithm.
城市交通网络中出行车辆从起点到终点的路径优化问题是智能交通研究的重要课题。
The route optimization for the vehicle going from the origin to the destination in traffic network is an important issue in intelligent traffic research.
此部分是本文研究的重点：首先，建立有时间窗物流配送路径优化问题的数学模型基础。
Research on the paper will importantly focus on:Firstly, we will construct the mathematic model of optimizing of physical distribution routing problem with time windows.
通过对物流车辆配送过程的分析，建立了带时间窗约束的物流配送路径优化问题的数学模型。
A mathematical model of logistics distribution route with time window was proposed according to the analysis of the logistics vehicle distribution process.
通过建立序交换元和序交换集对算法的操作算子进行改进，满足钻削路径优化问题中整数编码的需要。
And the operators are improved by establishing the Order Exchange Unit and Order Exchange List to satisfy the need of integer coding in drilling path optimization.
而且具体的车辆路径优化问题，往往在时间和路程两方面都有限制和要求，而在这方面的研究相对较少。
Faced to concrete routing problem, time and routs are both restricted and required and researches in this field are not enough.
将皮革裁剪多轮廓加工空行程路径优化问题归结为广义旅行商问题，提出了一种求解问题的混合智能优化算法。
Tool-path airtime optimization during multi-contour processing in leather cutting is regarded as generalized traveling salesman problem. A hybrid intelligence algorithm was proposed.
通过在线路负荷矩最小与各用户负荷需求满足程度最大之间求最佳折衷平衡，解决了负荷预测不确定情况下的路径优化问题。
By making compromise between the least line load moment and the largest load demand satisfaction degree, the right-of-way selection under uncertain load forecasting is well resolved.
建立了拣选路径的数学模型，明确定义了其目标函数以及约束条件，通过对拣选路径优化问题的数学模型的分析，采用基于字符编码的混合遗传算法来求解。
Furthermore under the analysis of such mathematic model of the sorting route optimum problem, that function is resolved by the application of the mix genetic arithmetic based on character code.
查询优化集中于cpu密集型(CPUbound)执行路径，而全缓存数据库将仍然集中于优化取页到大容量存储器的操作，而这已不再是问题。
Query optimization focuses on CPUbound execution paths, while a fully cached database will still be preoccupied with optimizing page fetches to mass storage that are no longer an issue.
针对单个问题的优化：本质上，层次数据库就通过一条指定的路径来优化数据访问。
Optimized for one problem: By their nature, hierarchical databases optimized access to the data through one specific path.
优化一些经常使用的CM服务器代码路径，以提高性能、可靠性以修复内存泄漏问题
Optimized some heavily used CM Server code paths to improve performance, reliability and to fix memory leaks
本文在介绍了家电产品回收再利用的实际意义、关键技术后，介绍了解决目前产品回收过程中工艺路径方案优化问题的研究方法。
This paper introduces the real meaning and key techniques of recycling and reusing of products, as well as the method of solving the problem of optimization of recycling processes of products.
车辆路径问题和网络流问题都是非常著名的网络优化问题。
The VRP and the network flow problem are all famous network optimization problems.
蚁群算法是一种新型的模拟进化算法，它通过模拟蚁群在觅食过程中寻找最短路径的方法来求解优化问题。
Ant Colony optimization (ACO) is a new-style simulating evolution algorithm. The behavior of real ant colonies foraging for food is simulated and used for solving optimization problems.
无约束优化问题的共轭梯度路径构造的思想启迪我们用其来解带线性等式约束和有界变量约束的优化问题。
The idea of conjugate gradient path in unconstrained optimization irradiates us to use this method for solving the linear equality optimization subject to bounds on variables.
路径优化是物流配送中智能调度系统的核心问题，其中最典型的问题模型就是旅行商问题即TSP问题。
As an essential question of the intelligent distribution system, route optimization has many problem-solving models, the most typical one is Traveling Salesman problem (short for TSP).
本文基于模糊数学规划及系统优化的观点研究了分组交换网络中分组路径的选择问题。
The problem of route selection of the packets in networks is studied based on the viewpoint of fuzzy mathematical programming and system optimization in this paper.
另一方面，机器人的路径也同时得到优化，克服了人工势场法的局部极小问题。
On the other hand, the path obtained by the artificial potential field method is optimized by the ant algorithm, which overcomes the local minima problem in the artificial potential field method.
本文将二者结合起来，研究了群智能优化算法在不同领域中路径规划规划问题的应用。
In this paper, several swarm intelligence optimization algorithm were applied in solving path planning problem in different fields.
本文将二者结合起来，研究了群智能优化算法在不同领域中路径规划规划问题的应用。
In this paper, several swarm intelligence optimization algorithm were applied in solving path planning problem in different fields.
应用推荐