Pirates of the Caribbean Metaheuristic: A Novel Optimization Algorithm Inspired by Cinematic Metaphors for Solving Complex Optimization Problems

Document Type : Research Article

Authors

School of Mathematics and Computer Science, Damghan University, Damghan, Iran

Abstract

This study introduces a novel population-based metaheuristic algorithm, the Pirates of the Caribbean Optimization Algorithm (PCOA), inspired by the adventurous strategies of pirates in cinematic narratives. PCOA models the exploration and exploitation process through the metaphor of pirate crews searching for hidden treasure while navigating unpredictable challenges. The algorithm’s effectiveness is evaluated by extensive comparisons with leading optimization methods across 23 classical functions and the CEC 2019 benchmark suites. Results consistently demonstrate PCOA’s superior solution quality, robustness, and convergence speed. Additionally, PCOA is successfully applied to challenging real-world inverse problems in nonlinear partial differential equations, highlighting its practical potential. The open-source implementation of PCOA further supports reproducibility and future research.

Keywords

Main Subjects

Full Text

 

Article PDF

References

[1] C. Storey, Applications of a hill climbing method of optimization, Chem. Eng. Sci., 17(1), 45–52 (1962).
[2] V. Granville, J. P. Rasson, and M. Krivanek, Simulated annealing: a proof of convergence, IEEE Trans. Pattern Anal. Mach. Intell., 16(6), 652–656 (1994).
[3] J. A. Nelder and R. Mead, A simplex method for function minimization, Comput. J., 7(4), 308–313 (1965).
[4] S. M. Almufti, A. A. Shaban, Z. A. Ali, R. I. Ali, and J. A. Dela Fuente, Overview of metaheuristic algorithms, Polaris Global Journal of Scholarly Research and Trends, 2(2), 10–32 (2023).
[5] A. Aliyari Boroujeni, M. R. Ghaemi, and R. Pourgholi, Solving the transportation problem using meta-heuristic algorithms, Analytical and Numerical Solutions for Nonlinear Equations, 9(1), 12–19 (2025).
[6] S. W. Kareem, K. W. H. Ali, S. Askar, F. S. Xoshaba, and R. Hawezi, Metaheuristic algorithms in optimization and its application: a review, JAREE, 6(1) (2022).
[7] J. H. Holland, Genetic algorithms, Sci. Am., 267(1), 66–72 (1992).
[8] M. Dorigo, M. Birattari, and T. Stutzle, Ant colony optimization, IEEE Comput. Intell. Mag., 1(4), 28–39 (2006).
[9] J. Kennedy and R. Eberhart, Particle swarm optimization, Proceedings of ICNN95 - International Conference on Neural Networks, 4, 1942–1948 (1995).
[10] A. Aliyari Boroujeni, R. Pourgholi, and S. H. Tabasi, A new improved teaching-learning-based optimization (ITLBO) algorithm for solving nonlinear inverse partial differential equation problems, Comput. Appl. Math., 42(2) (2023).
[11] A. Aliyari Boroujeni and A. Khadivar, Solving the inverse Fisher problem using a discretized teaching-learning-based optimization algorithm, Analytical and Numerical Solutions for Nonlinear Equations, 10(1), 35–49 (2025).
[12] B. Brahim, M. Kobayashi, M. Al Ali, T. Khatir, and M. E. A. E. Elmeliani, Metaheuristic optimization algorithms: an overview, HCMCOU Journal of Science Advances in Computational Structures (2024).
[13] A. Mishra and L. Goel, Metaheuristic algorithms in smart farming: an analytical survey, IETE Technical Review, 41(1), 46–65 (2024).
[14] M. Abdeyazdan, S. M. Dehno, and S. H. Tarighinejad, An investigation and comparison of invasive weed, flower pollination and krill evolutionary algorithms, Int. J. Adv. Comput. Sci. Appl., 7(7) (2016).
[15] A. Akgul, Y. Karaca, M. A. L. I. Pala, M. E. Cimen, A. L. I. F. Boz, and M. Z. Yildiz, Chaos theory, advanced metaheuristic algorithms and their deep learning architecture optimization applications: a review, 32(3) (2024).
[16] A. Kaveh, N. G. Malek, A. D. Eslamlou, and M. Azimi, An open-source framework for the FE modeling and optimal design of fiber-steered variable-stiffness composite cylinders using water strider algorithm, Mech. Based Des. Struct. Mach., 51(1), 138–158 (2023).
[17] J. Dreo et al., Paradiseo: from a modular framework for evolutionary computation to the automated design of metaheuristics, GECCO 2021 Companion, 1522–1530 (2021).
[18] F. Peres and M. Castelli, Combinatorial optimization problems and metaheuristics: review, challenges, design, and development, Appl. Sci., 11(14), 6449 (2021).
[19] A. A. Boroujeni, R. Pourgholi, and S. H. Tabasi, Solving inverse partial differential equations problems by using teaching learning based optimization algorithm.
[20] M. Baghel, S. Agrawal, and S. Silakari, Survey of metaheuristic algorithms for combinatorial optimization, Int. J. Comput. Appl., 58(19), 21–31 (2012).
[21] Z. Li, V. Tam, and L. K. Yeung, An adaptive multi-population optimization algorithm for global continuous optimization, IEEE Access, 9, 19960–19989 (2021).
[22] S. C. Chu, H. C. Huang, J. F. Roddick, and J. S. Pan, Overview of algorithms for swarm intelligence, Lecture Notes in Computer Science, 6922, 28–41 (2011).
[23] D. Martens, B. Baesens, and T. Fawcett, Editorial survey: swarm intelligence for data mining, Mach. Learn., 82(1), 1–42 (2011).
[24] Y. Qawqzeh, M. T. Alharbi, A. Jaradat, and K. N. A. Sattar, A review of swarm intelligence algorithms deployment for scheduling and optimization in cloud computing environments, PeerJ Comput. Sci., 7, e696 (2021).
[25] P. S. Mann and S. Singh, Improved artificial bee colony metaheuristic for energy-efficient clustering in wireless sensor networks, Artif. Intell. Rev., 51(3), 329–354 (2019).
[26] M. Mavrovouniotis, S. Yang, M. Van, C. Li, and M. Polycarpou, Ant colony optimization algorithms for dynamic optimization: a case study of the dynamic travelling salesperson problem, IEEE Comput. Intell. Mag., 15(1), 52–63 (2020).
[27] A. Abraham, H. Guo, and H. Liu, Swarm intelligence: foundations, perspectives and applications, Stud. Comput. Intell., 26, 3–25 (2006).
[28] R. Garcia-Rodenas, L. J. Linares, and J. A. Lopez-Gomez, A memetic chaotic gravitational search algorithm for unconstrained global optimization problems, Appl. Soft Comput., 79, 14–29 (2019).
[29] K. Hussain, W. Zhu, and M. N. Mohd Salleh, Long-term memory Harris hawk optimization for high dimensional and optimal power flow problems, IEEE Access, 7, 147596–147616 (2019).
[30] A. A. Boroujeni and A. Khadivar, Solving the traveling salesman problem using a modified teaching-learning-based optimization algorithm, Int. J. Ind. Eng. Prod. Res., 36(2), 170–184 (2025).
[31] A. A. Boroujeni, R. Pourgholi, and S. H. Tabasi, Solving inverse partial differential equations problems by using teaching learning based optimization algorithm, 738–755 (2024).
[32] A. Aliyari Boroujeni, R. Pourgholi, and S. H. Tabasi, Numerical solutions of KdV and mKdV equations: using sequence and multi-core parallelization implementation, J. Comput. Appl. Math., 454, 116184 (2025).
[33] R. Storn and K. Price, Differential evolution: a simple and efficient heuristic for global optimization over continuous spaces, J. Glob. Optim., 11, 341–359 (1997).
[34] D. Karaboga, B. Gorkemli, C. Ozturk, and N. Karaboga, A comprehensive survey: artificial bee colony (ABC) algorithm and applications, Artif. Intell. Rev., 42(1), 21–57 (2014).
[35] X.-S. Yang, A new metaheuristic bat-inspired algorithm.
[36] S. Mirjalili and A. Lewis, The whale optimization algorithm, Adv. Eng. Softw., 95, 51–67 (2016).
[37] S. Mirjalili, S. M. Mirjalili, and A. Lewis, Grey wolf optimizer, Adv. Eng. Softw., 69, 46–61 (2014).
[38] Y. Fu, D. Liu, J. Chen, and L. He, Secretary bird optimization algorithm: a new metaheuristic for solving global optimization problems, Artif. Intell. Rev., 57(5) (2024).
[39] S. Saremi, S. Mirjalili, and A. Lewis, Grasshopper optimisation algorithm: theory and application, Adv. Eng. Softw., 105, 30–47 (2017).
[40] L. Abualigah, D. Yousri, M. Abd Elaziz, A. A. Ewees, M. A. A. Al-qaness, and A. H. Gandomi, Aquila optimizer: a novel meta-heuristic optimization algorithm, Comput. Ind. Eng., 157, 107250 (2021).
Analytical and Numerical Solutions for Nonlinear Equations
Volume 11, Issue 1
June 2026
Pages 51-83

Files

History

  • Receive Date: 19 January 2026
  • Revise Date: 10 March 2026
  • Accept Date: 17 March 2026
  • Publish Date: 07 June 2026

Share

How to cite

Statistics