EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Discrete Puma Optimizer to Solve Combinatorial Optimization Problems

Ferzat Anka, Farhad Soleimanian Gharehchopogh, Seyed Jalaleddin Mousavirad, Ghanshyam G. Tejani

International Journal of Computational Intelligence Systems · 17.02.2026 · 19 (1)

DOI: 10.1007/s44196-026-01159-5 ↗

Kurz gefasst

Fachartikel in der Zeitschrift International Journal of Computational Intelligence Systems, online erschienen am 17.02.2026. Verfasst von Ferzat Anka und 3 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 55 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Mid Sweden University.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Discrete and combinatorial optimization problems such as routing, scheduling, and resource allocation present high computational complexity, limiting the effectiveness of classical exact optimization methods. Most existing metaheuristic (MH) algorithms are originally designed for continuous domains and require transformation procedures that often degrade performance when applied to discrete problems. This study introduces the discrete puma optimizer (DPO), a new variant metaheuristic algorithm developed to operate directly within discrete search spaces by employing discrete-specific operators and adaptive exploration–exploitation strategies. DPO is applied to 7 real-world optimization problems, including the Traveling Salesman Problem, Smart Grid Optimization, Factory Production Planning, Vehicle Routing Problem, Modern TSP, Team Orienteering Problem, and Electric Vehicle Charging Station Location Optimization, and evaluated on a total of 22 small-, medium-, and large-scale dataset instances. The performance of DPO is benchmarked against 9 various and well-known MH algorithms. Experimental results show that DPO attains superior best and mean solutions, lower variance, and faster stabilization in convergence behavior. Wilcoxon signed-rank tests confirm the statistical significance of the observed improvements, particularly in large-scale scenarios where competing methods show marked degradation. Comprehensive cross-problem rankings further illustrate DPO’s enhanced generalizability and scalability. These results position DPO as an effective and robust approach for real-world large-scale discrete optimization tasks.

Förderung

  • Mid Sweden University

Zitieren

APA

Anka, F., Gharehchopogh, F. S., Mousavirad, S. J., & Tejani, G. G. (2026). Discrete Puma Optimizer to Solve Combinatorial Optimization Problems. International Journal of Computational Intelligence Systems, 19(1). https://doi.org/10.1007/s44196-026-01159-5

Vancouver

Anka F, Gharehchopogh FS, Mousavirad SJ, Tejani GG. Discrete Puma Optimizer to Solve Combinatorial Optimization Problems. International Journal of Computational Intelligence Systems. 2026;19(1). doi:10.1007/s44196-026-01159-5

BibTeX
@article{Anka2026,
  author = {Anka, Ferzat and Gharehchopogh, Farhad Soleimanian and Mousavirad, Seyed Jalaleddin and Tejani, Ghanshyam G.},
  title = {Discrete Puma Optimizer to Solve Combinatorial Optimization Problems},
  journal = {International Journal of Computational Intelligence Systems},
  year = {2026},
  volume = {19},
  number = {1},
  doi = {10.1007/s44196-026-01159-5}
}
Kostenlos starten →