Solution to Shortest Path Problem Using a Connective Probe Machine

Sun Jiuyun; Dong Huanhe; Kong Yuan; Fang Yong

首页> 外文期刊>Mathematical Problems in Engineering >Solution to Shortest Path Problem Using a Connective Probe Machine

【24h】

Solution to Shortest Path Problem Using a Connective Probe Machine

机译：使用连接探头机来解决最短路径问题

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

With the continuous urban scale expansion, traffic networks have become extremely complex. Finding an optimal route in the shortest time has become a difficult and important issue in traffic engineering study. In this study, a novel computing model, namely, probe machine, is used to solve this problem. Similar to previous studies, urban transport networks can be abstracted into maps, in which points representing places of origin, destinations, and other buildings constitute the data library and edges representing the road make up the probe library. The true solution can be obtained after one probe operation on the computing platform. And by comparing the solving process with Dijkstra's and Floyd's algorithms, the computing efficiency of the probe machine is clearly superior, although all three methods can solve the shortest path problem and obtain the same solution.

机译：随着城市规模的持续扩张，交通网络变得非常复杂。在最短的时间内找到最佳路线已成为交通工程研究中的困难而重要的问题。在本研究中，使用一种新颖的计算模型，即探针机，用于解决这个问题。与以前的研究类似，城市交通网络可以被抽象成地图，其中代表原籍地，目的地和其他建筑物的点构成代表道路的数据库和边缘构成探针库。在计算平台上的一个探测操作之后，可以获得真正的解决方案。并且通过将求解过程与Dijkstra和Floyd的算法进行比较，探头机的计算效率显然优越，尽管所有三种方法都可以解决最短的路径问题并获得相同的解决方案。

著录项

来源
《Mathematical Problems in Engineering》 |2019年第22期|8709042.1-8709042.8|共8页
作者
Sun Jiuyun; Dong Huanhe; Kong Yuan; Fang Yong;
展开▼
作者单位

Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Shandong Peoples R China;

Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Shandong Peoples R China;

Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Shandong Peoples R China;

Shandong Univ Sci & Technol Coll Math & Syst Sci Qingdao 266590 Shandong Peoples R China;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词

相似文献

外文文献
中文文献
专利

1. Solution to Shortest Path Problem Using a Connective Probe Machine [J] . Jiuyun Sun, Huanhe Dong, Yuan Kong, Mathematical Problems in Engineering: Theory, Methods and Applications . 2019,第1期

机译：使用连接探头机来解决最短路径问题
2. Application of the support vector machine and heuristic k-shortest path algorithm to determine the most eco-friendly path with a travel time constraint [J] . Zeng Weiliang, Miwa Tomio, Morikawa Takayuki Transportation Research . 2017,第deca期

机译：支持向量机和启发式k最短路径算法在确定具有旅行时间约束的最环保路径中的应用
3. A novel connectivity and coverage algorithm based on shortest path for wireless sensor networks [J] . Sun Geng, Liu Yanheng, Li Han, Computers and Electrical Engineering . 2018,第期

机译：一种基于无线传感器网络最短路径的新型连接和覆盖算法
4. Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements [C] . Ghassan Fadlallah, Hamid Mcheick, Djamal Rebaine International Symposium on Networks, Computers and Communications . 2020

机译：用于维持恶劣环境中的连接的最短路径算法和通信案例研究
5. Robust Shortest Path Problem: Models and Solution Algorithms [D] . Shahabi, Mehrdad 2015

机译：鲁棒最短路径问题：模型和求解算法
6. Negative Functional Connectivity and Its Dependence on the Shortest Path Length of Positive Network in the Resting-State Human Brain [O] . Guangyu Chen, Gang Chen, Chunming Xie, -1

机译：负功能连接性及其对静止状态人脑中正网络最短路径长度的依赖性
7. Internet-of-Things (IoT) Shortest Path Algorithms and Communication Case Studies for Maintaining Connectivity in Harsh Environements [O] . Ghassan Fadlallah, Hamid Mcheick, Djamal Rebaine 2020

机译：用于维持恶劣环境中的连接的最短路径算法和通信案例研究

Solution to Shortest Path Problem Using a Connective Probe Machine

摘要

著录项

相似文献

相关主题

期刊订阅