Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

A genetic algorithm for shortest path with real constraints in computer networks

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 1 (2023)

DOI
10.11591/ijece.v13i1.pp435-442
ISSN
2722-2578, 2088-8708
Published
2023-02-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The shortest path problem has many different versions. In this manuscript, we proposed a muti-constrained optimization method to find the shortest path in a computer network. In general, a genetic algorithm is one of the common heuristic algorithms. In this paper, we employed the genetic algorithm to find the solution of the shortest path multi-constrained problem. The proposed algorithm finds the best route for network packets with minimum total cost, delay, and hop count constrained with limited bandwidth. The new algorithm was implemented on four different capacity networks with random network parameters, the results showed that the shortest path under constraints can be found in a reasonable time. The experimental results showed that the algorithm always found the shortest path with minimal constraints.

Collaboration network of the authors

40 authors · 232 co-authorship links · 89 across different organisations · showing the 40 most connected

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Imam Abdulrahman Bin Faisal University
  • King Saud University
  • Sohag University
  • Amman Arab University
  • Al-Zaytoonah University of Jordan
  • South Valley University
  • Assiut University
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Mutasem K. AlsmadiImam Abdulrahman Bin Faisal University10
Malek AlzaqebahImam Abdulrahman Bin Faisal University4
Hayat AlfaghamImam Abdulrahman Bin Faisal University4
Ibrahim AlmarashdehImam Abdulrahman Bin Faisal University4
Usama A. BadawiImam Abdulrahman Bin Faisal University4
Sana JawarnehImam Abdulrahman Bin Faisal University3
Ghaith M. JaradatAmman Arab University3
Jehad Saad AlqurniImam Abdulrahman Bin Faisal University3
Firas HaddadImam Abdulrahman Bin Faisal University3
Nashat AlrefaiImam Abdulrahman Bin Faisal University2
Eman A. E. AhmedImam Abdulrahman Bin Faisal University2
Rami Mustafa A. MohammadImam Abdulrahman Bin Faisal University2
Ibrahim Al-marashdehAffiliation unknown2
Raed Ali AlkhasawnehImam Abdulrahman Bin Faisal University2
Nahier AldhafferiImam Abdulrahman Bin Faisal University2
Abdullah AlqahtaniImam Abdulrahman Bin Faisal University2
Fatema Sabeen ShaikhImam Abdulrahman Bin Faisal University2
Sunday Olusanya OlatunjiImam Abdulrahman Bin Faisal University2
Abdullah AlmurayhImam Abdulrahman Bin Faisal University2
Ghalib H. AlshammriKing Saud University2
Amani K. SamhaKing Saud University2
Kamal Eldin Hassan Ibrahim EldawImam Abdulrahman Bin Faisal University1
Ahmad AlthunibatAl-Zaytoonah University of Jordan1
Saddam BekhetSouth Valley University1
Islam Taj-EddinAssiut University1
Sami BriniImam Abdulrahman Bin Faisal University1
Khaoula BrikiImam Abdulrahman Bin Faisal University1
Maen T. Al-RashdanAffiliation unknown1
Lubna Mahmoud Abdel JawadGulf Medical University1
Mohammad AlmatariAl-Balqa Applied University1
Belal AbuhaijaWenzhou-Kean University1
Aladeen AlloubaniKing Hussein Cancer Center1
Yousef QawqzehFujairah University1
Lena AlodatMonash University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>A genetic algorithm for shortest path with real constraints in computer networks</dc:title><dc:creator>Alghamdi, Fahad. A.</dc:creator><dc:creator>Younes Hamed, Ahmed</dc:creator><dc:creator>Alghamdi, Abdullah M.</dc:creator><dc:creator>Salah, Abderrazak Ben</dc:creator><dc:creator>Farag, Tamer Hashem</dc:creator><dc:creator>Hassan, Walaa</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;The shortest path problem has many different versions. In this manuscript, we proposed a muti-constrained optimization method to find the shortest path in a computer network. In general, a genetic algorithm is one of the common heuristic algorithms. In this paper, we employed the genetic algorithm to find the solution of the shortest path multi-constrained problem. The proposed algorithm finds the best route for network packets with minimum total cost, delay, and hop count constrained with limited bandwidth. The new algorithm was implemented on four different capacity networks with random network parameters, the results showed that the shortest path under constraints can be found in a reasonable time. The experimental results showed that the algorithm always found the shortest path with minimal constraints.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v13i1.pp435-442</dc:identifier><dc:identifier>10.11591/ijece.v13i1.pp435-442</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 1 (2023); 435</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/28716/16267</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>