查询词典 shortest route problem
- 与 shortest route problem 相关的网络例句 [注:此内容来源于网络,仅供参考]
-
How to provide route to meet the driver's multiple psychological expectations is the key problem of navigation system. The essence of this problem is resource constrained shortest path problem, which belongs to NP-C problems and can not be solved with the traditional shortest path algorithm.
提供满足驾驶员多个心理期望的路径是导航系统该解决的关键问题,其本质是资源约束最短路径问题,属于NP难问题,无法使用传统的最短路径算法解决。
-
Machine study algrithm for artificial intelligence and neural network, it can solve the problem of shortest route
人工智能及神经网络的机器学习算法,经典的遗传算法,在实际中可以解决选路问题及最短路径问题。
-
The problem of shortest route was studied, the chart solving method and arithmetic was provided. The function of transport route selecting between enterprises was achieved by programming.
研究了最短路径问题,提出了图论解决方法和算法,编程实现了企业间运输路线的选择功能。
-
The main target of emergent material transport is to transport the emergent vehicles to the demand point in the shortest time. The core of this research is the problem of shortest route selection.
应急物资调运主要是应急车辆在最短的时间内把应急物资运送到需求点,其研究的核心是最短路径选择问题。
-
This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl
这样就可以建立一个无向有权图,那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。
-
The shortest route transportation problem is introduced. The objective of SRTP is to find a vehicle route that minimizes the total distance traveled between supply and demand locations.
场地平整过程中需要进行大量的施工材料的调运工作,这引出了一个最短路径调运问题,目标是找到一个最短的车辆行走路线,使得整个施工过程的总运输距离最短。
-
Key Words: Dynamic network, Time dependent vehicle route problem, Time dependent shortest path problem, route construction algorithm, Genetic Algorithm, Ant Colony Optimization Algorithms, Component-based software development
最后,对本文的主要工作和研究成果进行了总结,并简要讨论了进一步的研究方向。关键词:动态路网,时间依赖型车辆路径问题,动态最短路径问题,构造算法,遗传算法,蚁群算法,组件式开发
-
A layered multimodal network diagram for routing purposs is built. The viable routing problem is then formulated as a generalized shortest route problem with penalty factor, aiming at minimizing the cost of the total transportation in multi- modal networks. Assumptions and detail descriptions of the model are presented. Compendious solution thought and consultable algorithms are provided.
通过构建直观的联合运输网络图,以总运输成本最少为优化目标,将多方式联合运输合理路径的选择和优化问题转化为含有超期惩罚因子的广义最短路模型,对模型的假设和数学形式做了详细的描述,并提供了简要的求解思路和参考算法。
-
In order to solve the public transportation route choice problem, the feature of public transportation network,compares algorithms of shortest route, and selection algorithm of public transportation network routes is analyzed based on two-way search.
为了解决人们出行公交路径选择问题,分析了公交网络的特点,对最短路径常用算法进行比较,提出一种基于双向搜索的公交网络路径选择算法。
-
Dijkstra algorithm and matrix iterative algorithm are important algorithms of the shortest route problem.In order to find which of the two algorithms is more efficient,the two algorithms were discussed,and their program flows were introduced.
Dijkstra算法和矩阵迭代算法都是最短路径问题的经典算法,为了研究这2种算法的计算效率,介绍了2种算法的基本思路和程序流程;通过对时间复杂度、结果和时间的关系指标进行多次计算,表现2者之间的效率差异。
- 推荐网络例句
-
Finally, according to market conditions and market products this article paper analyzes the trends in the development of camera technology, and designs a color night vision camera.
最后根据市场情况和市面上产品的情况分析了摄像机技术的发展趋势,并设计了一款彩色夜视摄像机。
-
Only person height weeds and the fierce looks stone idles were there.
只有半人深的荒草和龇牙咧嘴的神像。
-
This dramatic range, steeper than the Himalayas, is the upturned rim of the eastern edge of Tibet, a plateau that has risen to 5 km in response to the slow but un stoppable collision of India with Asia that began about 55 million years ago and which continues unabated today.
这一引人注目的地域范围,比喜马拉雅山更加陡峭,是处于西藏东部边缘的朝上翻的边框地带。响应启始于约5500万年前的、缓慢的但却不可阻挡的印度与亚洲地壳板块碰撞,高原已上升至五千米,这种碰撞持续至今,毫无衰退。