Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem

被引：66

作者：

Aini, Asghar ^{[2
]}

Salehipour, Amir ^{[1
]}

机构：

[1] Islamic Azad Univ, S Tehran Branch, Sch Ind Engn, Tehran, Iran

[2] Shahid Sattari Air Univ, Sch Comp Engn, Tehran 1384637945, Iran

来源：

APPLIED MATHEMATICS LETTERS | 2012年 / 25卷 / 01期

关键词：

The shortest path problem with a cycle; The Floyd-Warshall algorithm; The Rectangular algorithm;

D O I：

10.1016/j.aml.2011.06.008

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

On a network with a cycle, where at least one cycle exists, the Floyd-Warshall algorithm is one of the algorithms most used for determining the least cost path between every pair of nodes. In this work a new algorithm for this problem is developed that requires less computational effort than the Floyd-Warshall algorithm. Furthermore, we show that the basis of our algorithm is much easier to understand, which might be an advantage for educational purposes. A small example validates our algorithm and shows its implementation. (C) 2011 Elsevier Ltd. All rights reserved.

引用

页码：1 / 5

页数：5

共 50 条

[31] Speeding up Martins’ algorithm for multiple objective shortest path problems
Sofie Demeyer
Jan Goedgebeur
Pieter Audenaert
Mario Pickavet
Piet Demeester
4OR, 2013, 11 : 323 - 348
[32] FLOYD Algorithm Based on the Shortest Path in GIS
Liao, Yv Mei
Zhong, Jie
INFORMATION AND BUSINESS INTELLIGENCE, PT I, 2012, 267 : 574 - +
[33] Comparison of the Non-Blocked and Blocked Floyd-Warshall Algorithm with Regard to Speedup and Energy Saving on an Embedded GPU
Teskeredzic, Edvin
Karahodzic, Kenan
Nosovic, Novica
2020 19TH INTERNATIONAL SYMPOSIUM INFOTEH-JAHORINA (INFOTEH), 2020,
[34] Speeding up dynamic shortest-path algorithms
Buriol, Luciana S.
Resende, Mauricio G. C.
Thorup, Mikkel
INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 191 - 204
[35] Approach to high efficient hierarchical pathfinding of indoor mobile service robots based on grid map and Floyd-Warshall algorithm
Chen, Xushen
Qin, Shiyin
2017 CHINESE AUTOMATION CONGRESS (CAC), 2017, : 6476 - 6483
[36] Speeding Up Shortest Path Search in Public Transport Networks
Martinek, Vladislav
Zemlicka, Michal
DATESO 2009 - DATABASES, TEXTS, SPECIFICATIONS, OBJECTS: PROCEEDINGS OF THE 9TH ANNUAL INTERNATIONAL WORKSHOP, 2009, 471 : 1 - 12
[37] A decremental approach with the A* algorithm for speeding-up the optimization process in dynamic shortest path problems
Ardakani, Mostafa K.
Tavana, Madjid
MEASUREMENT, 2015, 60 : 299 - 307
[38] Transfer path analysis of ship structure-borne noises based on the Warshall-Floyd algorithm
Xiang Y.
Ji Z.
Zhao X.
Zhendong yu Chongji/Journal of Vibration and Shock, 2019, 38 (02): : 82 - 89and97
[39] An Approximation Algorithm for an Assisted Shortest Path Problem
Montez, Christopher
Rathinam, Sivakumar
Darbha, Swaroop
Casbeer, David
Manyam, Satyanarayana Gupta
2021 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA 2021), 2021, : 8024 - 8030
[40] Models and algorithm for stochastic shortest path problem
Ji, XY
APPLIED MATHEMATICS AND COMPUTATION, 2005, 170 (01) : 503 - 514

← 1 2 3 4 5 →