PARALLELIZATION OF SHORTEST PATH CLASS ALGORITHMS: A COMPARATIVE ANALYSIS

Q4 Decision Sciences

Pesquisa Operacional Pub Date : 2023-01-01 DOI:10.1590/0101-7438.2023.043.00272130

Flávio Henrique Batista de Souza, Marcos Henrique Gonçalves Abreu, Paulo Ricardo Fonseca Trindade, Gustavo Alves Fernandes, Luiz Melk de Carvalho, Braulio Roberto Gomes Marinho Couto, Diva de Souza e Silva Rodrigues

{"title":"PARALLELIZATION OF SHORTEST PATH CLASS ALGORITHMS: A COMPARATIVE ANALYSIS","authors":"Flávio Henrique Batista de Souza, Marcos Henrique Gonçalves Abreu, Paulo Ricardo Fonseca Trindade, Gustavo Alves Fernandes, Luiz Melk de Carvalho, Braulio Roberto Gomes Marinho Couto, Diva de Souza e Silva Rodrigues","doi":"10.1590/0101-7438.2023.043.00272130","DOIUrl":null,"url":null,"abstract":"The problem of finding the shortest path between a source and a destination node, commonly represented by graphs, has several computational algorithms as an attempt to find what is called the minimum path. Depending on the number of nodes in-between the source and destination, the process of finding the shortest path can demand a high computational cost (with polynomial complexity). A solution to reduce the computational cost is the use of the concept of parallelism, which divides the algorithm tasks between the processing cores. This article presents a comparative analysis of the main algorithms of the shortest path class: Dijkstra, Bellman-Ford, Floyd-Warshall and Johnson. The performance of each algorithm was evaluated considering different parallelization approaches and they were applied on general and open-pit mining databases present in the literature. The experimental results showed an improvement in performance of about 55% on the execution time depending on the chosen parallelization point.","PeriodicalId":35341,"journal":{"name":"Pesquisa Operacional","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pesquisa Operacional","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1590/0101-7438.2023.043.00272130","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Decision Sciences","Score":null,"Total":0}

引用次数: 0

Abstract

The problem of finding the shortest path between a source and a destination node, commonly represented by graphs, has several computational algorithms as an attempt to find what is called the minimum path. Depending on the number of nodes in-between the source and destination, the process of finding the shortest path can demand a high computational cost (with polynomial complexity). A solution to reduce the computational cost is the use of the concept of parallelism, which divides the algorithm tasks between the processing cores. This article presents a comparative analysis of the main algorithms of the shortest path class: Dijkstra, Bellman-Ford, Floyd-Warshall and Johnson. The performance of each algorithm was evaluated considering different parallelization approaches and they were applied on general and open-pit mining databases present in the literature. The experimental results showed an improvement in performance of about 55% on the execution time depending on the chosen parallelization point.

查看原文本刊更多论文

并行化的最短路径类算法:比较分析

寻找源节点和目标节点之间的最短路径的问题，通常用图表示，有几种计算算法试图找到所谓的最小路径。根据源和目标之间的节点数量，寻找最短路径的过程可能需要很高的计算成本(具有多项式复杂度)。降低计算成本的一个解决方案是使用并行的概念，它在处理核心之间划分算法任务。本文对Dijkstra、Bellman-Ford、Floyd-Warshall和Johnson这几种最短路径类的主要算法进行了比较分析。考虑不同的并行化方法，对每种算法的性能进行了评估，并将它们应用于现有文献中的一般和露天采矿数据库。实验结果表明，根据所选择的并行化点，在执行时间上的性能提高了约55%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Pesquisa Operacional Decision Sciences-Management Science and Operations Research

CiteScore

1.60

自引率

0.00%

发文量

审稿时长

8 weeks

期刊介绍： Pesquisa Operacional is published each semester by the Sociedade Brasileira de Pesquisa Operacional - SOBRAPO, performing one volume per year, and is distributed free of charge to its associates. The abbreviated title of the journal is Pesq. Oper., which should be used in bibliographies, footnotes and bibliographical references and strips.