IDEAS home Printed from https://ideas.repec.org/a/ibn/masjnl/v14y2020i3p30.html
   My bibliography  Save this article

Parallel Whale Optimization Algorithm for Maximum Flow Problem

Author

Listed:
  • Raja Masadeh
  • Abdullah Alzaqebah
  • Bushra Smadi
  • Esra Masadeh

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.

Suggested Citation

  • Raja Masadeh & Abdullah Alzaqebah & Bushra Smadi & Esra Masadeh, 2020. "Parallel Whale Optimization Algorithm for Maximum Flow Problem," Modern Applied Science, Canadian Center of Science and Education, vol. 14(3), pages 1-30, March.
    • Handle: RePEc:ibn:masjnl:v:14:y:2020:i:3:p:30
    as

    Download full text from publisher

    File URL: https://ccsenet.org/journal/index.php/mas/article/download/0/0/42071/43766
    Download Restriction: no
    File URL: https://ccsenet.org/journal/index.php/mas/article/view/0/42071
    Download Restriction: no
    ---><---

    More about this item

    JEL classification:

    • R00 - Urban, Rural, Regional, Real Estate, and Transportation Economics - - General - - - General
    • Z0 - Other Special Topics - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ibn:masjnl:v:14:y:2020:i:3:p:30. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Canadian Center of Science and Education (email available below). General contact details of provider: https://edirc.repec.org/data/cepflch.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.