A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem

Abstract

The Fixed-Charged Transshipment Problem (FCTP) is a significant optimization challenge in logistics and supply chain management. In this paper, we propose a modified Emperor Penguin algorithm specifically designed for solving the FCTP and introduce new benchmarks for evaluating its performance. Computational results, including mean results, standard deviation, and Relative Standard Deviation (RSD), demonstrate the algorithm's effectiveness and robustness in addressing the FCTP. This research contributes to improving supply chain operations and offers valuable insights for efficient logistics management. The modified Emperor penguin optimizer algorithm is tested on 19 test optimization problems. The comparative results are done to confirm the efficiency of the modified emperor penguin optimizer algorithm (EPO) comparing it with the classic EPO algorithm. After adapting the algorithm, the computational results are implemented on 30 generated FCTP problems showing the mean results and robustness measures.

Authors

  • Mohamed Meselhy Eltoukhy Department of Information Technology, College of Computing and Information Technology at Khulais, University of Jeddah, Jeddah, Saudi Arabia
  • Mohammad Zakaraia

DOI:

https://doi.org/10.31449/inf.v48i7.5711

Downloads

Published

04/22/2024

How to Cite

Eltoukhy, M. M., & Zakaraia, M. (2024). A Modified Emperor Penguin Optimizer Algorithm for Solving Fixed-Charged Transshipment Problem. Informatica, 48(7). https://doi.org/10.31449/inf.v48i7.5711

Issue

Vol. 48 No. 7 (2024): Online-only issue

Section

Online-only

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.