{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:20:21Z","timestamp":1760145621032,"version":"build-2065373602"},"reference-count":71,"publisher":"MDPI AG","issue":"8","license":[{"start":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T00:00:00Z","timestamp":1722816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computation"],"abstract":"<jats:p>The problem of finding the global minimum of a function is applicable to a multitude of real-world problems and, hence, a variety of computational techniques have been developed to efficiently locate it. Among these techniques, evolutionary techniques, which seek, through the imitation of natural processes, to efficiently obtain the global minimum of multidimensional functions, play a central role. An evolutionary technique that has recently been introduced is the Optimal Foraging Algorithm, which is a swarm-based algorithm, and it is notable for its reliability in locating the global minimum. In this work, a series of modifications are proposed that aim to improve the reliability and speed of the above technique, such as a termination technique based on stochastic observations, an innovative sampling method and a technique to improve the generation of offspring. The new method was tested on a series of problems from the relevant literature and a comparative study was conducted against other global optimization techniques with promising results.<\/jats:p>","DOI":"10.3390\/computation12080158","type":"journal-article","created":{"date-parts":[[2024,8,5]],"date-time":"2024-08-05T07:37:30Z","timestamp":1722843450000},"page":"158","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["EOFA: An Extended Version of the Optimal Foraging Algorithm for Global Optimization Problems"],"prefix":"10.3390","volume":"12","author":[{"given":"Glykeria","family":"Kyrou","sequence":"first","affiliation":[{"name":"Department of Informatics and Telecommunications, University of Ioannina, 47150 Kostaki Artas, Greece"}]},{"given":"Vasileios","family":"Charilogis","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telecommunications, University of Ioannina, 47150 Kostaki Artas, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2343-2733","authenticated-orcid":false,"given":"Ioannis G.","family":"Tsoulos","sequence":"additional","affiliation":[{"name":"Department of Informatics and Telecommunications, University of Ioannina, 47150 Kostaki Artas, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Intriligator, M.D. (2002). Mathematical Optimization and Economic Theory, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898719215"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1023\/A:1008395408187","article-title":"Stochastic global optimization: Problem classes and solution techniques","volume":"14","author":"Ali","year":"1999","journal-title":"J. Glob. Optim."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.nima.2009.08.027","article-title":"Global optimization of an accelerator lattice using multiobjective genetic algorithms","volume":"609","author":"Yang","year":"2009","journal-title":"Nucl. Instrum. Methods Phys. Res. Accel. Spectrometers Detect. Assoc. Equip."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.ast.2017.04.013","article-title":"Global optimization of benchmark aerodynamic cases using physics-based surrogate models","volume":"67","author":"Iuliano","year":"2017","journal-title":"Aerosp. Sci. Technol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1029\/91WR02985","article-title":"Effective and efficient global optimization for conceptual rainfall-runoff models","volume":"28","author":"Duan","year":"1992","journal-title":"Water Resour. Res."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1002\/qua.24462","article-title":"Global optimization of clusters using electronic structure methods","volume":"113","author":"Heiles","year":"2013","journal-title":"Int. J. Quantum Chem."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2647","DOI":"10.1002\/jcc.23438","article-title":"GalaxyDock2: Protein\u2013ligand docking using beta-complex and global optimization","volume":"34","author":"Shin","year":"2013","journal-title":"J. Comput. Chem."},{"key":"ref_8","first-page":"5482","article-title":"Protein structure prediction by global optimization of a potential energy function","volume":"96","author":"Liwo","year":"1999","journal-title":"Biophysics"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1109\/TPWRS.2003.814889","article-title":"Particle swarm optimization to solving the economic dispatch considering the generator constraints","volume":"18","author":"Gaing","year":"2003","journal-title":"IEEE Trans. Power Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","article-title":"Solving long-term financial planning problems via global optimization","volume":"21","author":"Maranas","year":"1997","journal-title":"J. Econ. Dyn. Control"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1007\/s10439-007-9317-7","article-title":"Large-Scale Optimization-Based Classification Models in Medicine and Biology","volume":"35","author":"Lee","year":"2007","journal-title":"Ann. Biomed. Eng."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0895-7177(94)90027-2","article-title":"Global optimization in biology and medicine","volume":"20","author":"Cherruault","year":"1994","journal-title":"Math. Comput. Model."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1111\/j.1475-3995.2005.00503.x","article-title":"Comparison of deterministic and stochastic approaches to global optimization","volume":"12","author":"Liberti","year":"2005","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02698406","article-title":"Global optimization methods for chemical process design: Deterministic and stochastic approaches","volume":"19","author":"Choi","year":"2002","journal-title":"Korean J. Chem. Eng."},{"key":"ref_15","first-page":"179","article-title":"Interval methods for global optimization","volume":"75","author":"Wolfe","year":"1996","journal-title":"Appl. Math. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/S0036142995281528","article-title":"Subdivision Direction Selection in Interval Methods for Global Optimization","volume":"34","author":"Csendes","year":"1997","journal-title":"SIAM J. Numer. Anal."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF00933504","article-title":"Global optimization by controlled random search","volume":"40","author":"Price","year":"1983","journal-title":"J. Optim. Theory Appl."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0167-9473(95)90127-2","article-title":"The controlled random search algorithm in optimizing regression models","volume":"20","author":"Krivy","year":"1995","journal-title":"Comput. Stat. Data Anal."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1023\/A:1008236920512","article-title":"A Numerical Comparison of Some Modified Controlled Random Search Algorithms","volume":"11","author":"Ali","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1016\/0895-7177(89)90202-1","article-title":"Very fast simulated re-annealing","volume":"12","author":"Ingber","year":"1989","journal-title":"Math. Comput. Model."},{"key":"ref_22","first-page":"271","article-title":"Simulated annealing: A tool for operational research","volume":"46","author":"Eglese","year":"1990","journal-title":"Simulated Annealing Tool Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/j.cpc.2005.10.001","article-title":"MinFinder: Locating all the local minima of a function","volume":"174","author":"Tsoulos","year":"2006","journal-title":"Comput. Phys. Commun."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.asoc.2014.10.031","article-title":"A multi-start central force optimization for global optimization","volume":"27","author":"Liu","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_25","unstructured":"Perez, M., Almeida, F., and Moreno-Vega, J.M. (1998, January 27). Genetic algorithm with multistart search for the p-Hub median problem. Proceedings of the 24th EUROMICRO Conference (Cat. No. 98EX204), Vasteras, Sweden."},{"key":"ref_26","unstructured":"Oliveira, H.C.B.d., Vasconcelos, G.C., and Alvarenga, G. (2006, January 23\u201327). A Multi-Start Simulated Annealing Algorithm for the Vehicle Routing Problem with Time Windows. Proceedings of the 2006 Ninth Brazilian Symposium on Neural Networks (SBRN\u201906), Ribeirao Preto, Brazil."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s12532-017-0131-4","article-title":"Asynchronously parallel optimization solver for finding multiple minima","volume":"10","author":"Larson","year":"2018","journal-title":"Math. Program. Comput."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Dongarra, J., Kacsuk, P., and Podhorszki, N. (2000). Multiple Parallel Local Searches in Global Optimization. Recent Advances in Parallel Virtual Machine and Message Passing Interface, Springer. EuroPVM\/MPI 2000. Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-45255-9"},{"key":"ref_29","unstructured":"Kamil, R., and Reiji, S. (2012, January 7\u201311). An Efficient GPU Implementation of a Multi-Start TSP Solver for Large Problem Instances. Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation, Philadelphia, PA, USA."},{"key":"ref_30","unstructured":"Coello, C.A.C. (2011). GPU-Based Multi-start Local Search Algorithms. Learning and Intelligent Optimization. LION 2011, Springer. Lecture Notes in Computer Science."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01197028","article-title":"The repulsion algorithm, a new multistart method for global optimization","volume":"11","author":"Sepulveda","year":"1996","journal-title":"Struct. Optim."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00158-013-0988-4","article-title":"A local adaptive sampling method for reliability-based design optimization using Kriging model","volume":"49","author":"Chen","year":"2014","journal-title":"Struct. Multidisc. Optim."},{"key":"ref_33","first-page":"56","article-title":"Monte Carlo sampling-based methods for stochastic optimization","volume":"19","author":"Bayraksan","year":"2014","journal-title":"Surv. Oper. Res. Manag. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1162\/neco.1991.3.2.246","article-title":"Universal Approximation Using Radial-Basis-Function Networks","volume":"3","author":"Park","year":"1991","journal-title":"Neural Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"857","DOI":"10.3390\/signals3040051","article-title":"Use RBF as a Sampling Method in Multistart Global Optimization Method","volume":"3","author":"Tsoulos","year":"2022","journal-title":"Signals"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1137\/S1052623494277317","article-title":"Sequential stopping rules for random optimization methods with applications to multistart local search","volume":"9","author":"Hart","year":"1998","journal-title":"SIAM J. Optim."},{"key":"ref_37","first-page":"598","article-title":"Modifications of real code genetic algorithm for global optimization","volume":"203","author":"Tsoulos","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s00158-017-1779-0","article-title":"Stopping rule of multi-start local search for structural optimization","volume":"57","author":"Ohsaki","year":"2018","journal-title":"Struct. Multidisc. Optim."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","article-title":"Differential Evolution\u2014A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces","volume":"11","author":"Storn","year":"1997","journal-title":"J. Glob. Optim."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/s00500-004-0363-x","article-title":"A Fuzzy Adaptive Differential Evolution Algorithm","volume":"9","author":"Liu","year":"2005","journal-title":"Soft Comput."},{"key":"ref_41","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle swarm optimization. Proceedings of the ICNN\u201995\u2014International Conference on Neural Networks, Perth, WA, Australia."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","article-title":"Particle swarm optimization An Overview","volume":"1","author":"Poli","year":"2007","journal-title":"Swarm Intell."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","article-title":"The particle swarm optimization algorithm: Convergence analysis and parameter selection","volume":"85","author":"Trelea","year":"2003","journal-title":"Inf. Process. Lett."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1016\/j.ejor.2006.06.046","article-title":"Ant colony optimization for continuous domains","volume":"185","author":"Socha","year":"2008","journal-title":"Eur. J. Oper. Res."},{"key":"ref_46","unstructured":"Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company."},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Michaelewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs, Springer.","DOI":"10.1007\/978-3-662-03315-9"},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.asoc.2016.11.047","article-title":"Optimal foraging algorithm for global optimization","volume":"51","author":"Zhu","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"19657","DOI":"10.1109\/ACCESS.2020.2966856","article-title":"Optimal Foraging Algorithm Based on Differential Evolution","volume":"8","author":"Fu","year":"2020","journal-title":"IEEE Access"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"107660","DOI":"10.1016\/j.asoc.2021.107660","article-title":"Optimal foraging algorithm with direction prediction","volume":"111","author":"Jian","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"2293","DOI":"10.1007\/s00607-024-01290-1","article-title":"Improved optimal foraging algorithm for global optimization","volume":"106","author":"Ding","year":"2024","journal-title":"Computing"},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Ahmed, M., Seraj, R., and Islam, S.M.S. (2020). The k-means algorithm: A comprehensive survey and performance evaluation. Electronics, 9.","DOI":"10.3390\/electronics9081295"},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/BF01589118","article-title":"A Tolerant Algorithm for Linearly Constrained Optimization Calculations","volume":"45","author":"Powell","year":"1989","journal-title":"Math. Program."},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0925-2312(93)90006-O","article-title":"Backpropagation and stochastic gradient descent method","volume":"5","author":"Amari","year":"1993","journal-title":"Neurocomputing"},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1002\/wics.117","article-title":"Steepest descent","volume":"2","author":"Meza","year":"2010","journal-title":"Wiley Interdiscip. Rev. Comput. Stat."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Charilogis, V., and Tsoulos, I.G. (2022). Toward an Ideal Particle Swarm Optimizer for Multidimensional Functions. Information, 13.","DOI":"10.3390\/info13050217"},{"key":"ref_57","unstructured":"MacQueen, J.B. (July, January 21). Some Methods for classification and Analysis of Multivariate Observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Oakland, CA, USA."},{"key":"ref_58","doi-asserted-by":"crossref","first-page":"1104","DOI":"10.1016\/j.phpro.2012.03.206","article-title":"A clustering method based on K-means algorithm","volume":"25","author":"Li","year":"2012","journal-title":"Phys. Procedia"},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1016\/j.procs.2016.02.095","article-title":"Analysis of k-means and k-medoids algorithm for big data","volume":"78","author":"Arora","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_60","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","article-title":"Charoenchai Khompatraporn, Zelda B. Zabinsky, A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems","volume":"31","year":"2005","journal-title":"J. Glob. Optim."},{"key":"ref_61","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C., Esposoto, W., G\u00fcm\u00fcs, Z., Harding, S., Klepeis, J., Meyer, C., and Schweiger, C. (1999). Handbook of Test Problems in Local and Global Optimization, Kluwer Academic Publishers.","DOI":"10.1007\/978-1-4757-3040-1"},{"key":"ref_62","first-page":"578","article-title":"Improved particle swarm algorithms for global optimization","volume":"196","author":"Ali","year":"2008","journal-title":"Appl. Math. Comput."},{"key":"ref_63","first-page":"129","article-title":"A PSO based approach: Scout particle swarm algorithm for continuous global optimization problems","volume":"6","author":"Koyuncu","year":"2019","journal-title":"J. Comput. Des. Eng."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/264029.264043","article-title":"Enhanced simulated annealing for globally minimizing functions of many-continuous variables","volume":"23","author":"Siarry","year":"1997","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1016\/j.cpc.2008.01.040","article-title":"GenMin: An enhanced genetic algorithm for global optimization","volume":"178","author":"Tsoulos","year":"2008","journal-title":"Comput. Phys. Commun."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"100973","DOI":"10.1016\/j.swevo.2021.100973","article-title":"A prescription of methodological guidelines for comparing bio-inspired optimization algorithms","volume":"67","author":"LaTorre","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_67","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/962437.962444","article-title":"Software for generation of classes of test functions with known local and global minima for global optimization","volume":"29","author":"Gaviano","year":"2003","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_68","first-page":"463","article-title":"On the Determination of Molecular Fields","volume":"106","year":"1924","journal-title":"Proc. R. Soc. Lond. A"},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"1143","DOI":"10.1016\/j.mcm.2008.06.013","article-title":"A new method to simulate the triangular distribution","volume":"49","author":"Stein","year":"2009","journal-title":"Math. Comput. Model. Vol."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/0167-8191(96)00024-5","article-title":"A high-performance, portable implementation of the MPI message passing interface standard","volume":"22","author":"Gropp","year":"1996","journal-title":"Parallel Comput."},{"key":"ref_71","unstructured":"Chandra, R. (2001). Parallel Programming in OpenMP, Morgan Kaufmann."}],"container-title":["Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/8\/158\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:30:00Z","timestamp":1760110200000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2079-3197\/12\/8\/158"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,5]]},"references-count":71,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2024,8]]}},"alternative-id":["computation12080158"],"URL":"https:\/\/doi.org\/10.3390\/computation12080158","relation":{},"ISSN":["2079-3197"],"issn-type":[{"type":"electronic","value":"2079-3197"}],"subject":[],"published":{"date-parts":[[2024,8,5]]}}}