Parallel Whale Optimization Algorithm for Maximum Flow Problem

Raja Masadeh, Abdullah Alzaqebah, Bushra Smadi and Esra Masadeh

Modern Applied Science, 2020, vol. 14, issue 3, 30

Abstract: Maximum Flow Problem (MFP) is considered as one of several famous problems in directed graphs. Many researchers studied MFP and its applications to solve problems using different techniques. One of the most popular algorithms that are employed to solve MFP is Ford-Fulkerson algorithm. However, this algorithm has long run time when it comes to application with large data size. For this reason, this study presents a parallel whale optimization (PWO) algorithm to get maximum flow in a weighted directed graph. The PWO algorithm is implemented and tested on datasets with different sizes. The PWO algorithm achieved up to 3.79 speedup on a machine with 4 processors.

Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://ccsenet.org/journal/index.php/mas/article/download/0/0/42071/43766 (application/pdf)
https://ccsenet.org/journal/index.php/mas/article/view/0/42071 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ibn:masjnl:v:14:y:2020:i:3:p:30

Access Statistics for this article

More articles in Modern Applied Science from Canadian Center of Science and Education Contact information at EDIRC.
Bibliographic data for series maintained by Canadian Center of Science and Education ().