{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T18:09:20Z","timestamp":1765994960572,"version":"build-2065373602"},"reference-count":78,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematics"],"abstract":"<jats:p>Even while the scientific community has shown great interest in the analysis of meta-heuristics, the analysis of their parameterization has received little attention. It is the parameterization that will adapt a meta-heuristic to a problem, but it is still performed, mostly, empirically. There are multiple parameterization techniques; however, they are time-consuming, requiring considerable computational effort and they do not take advantage of the meta-heuristics that they parameterize. In order to approach the parameterization of meta-heuristics, in this paper, a self-parameterization framework is proposed. It will automatize the parameterization as an optimization problem, precluding the user from spending too much time on parameterization. The model will automate the parameterization through two meta-heuristics: A meta-heuristic of the solution space and one of the parameter space. To analyze the performance of the framework, a self-parameterization prototype was implemented. The prototype was compared and analyzed in a SP (scheduling problem) and in the TSP (traveling salesman problem). In the SP, the prototype found better solutions than those of the manually parameterized meta-heuristics, although the differences were not statistically significant. In the TSP, the self-parameterization prototype was more effective than the manually parameterized meta-heuristics, this time with statistically significant differences.<\/jats:p>","DOI":"10.3390\/math10030475","type":"journal-article","created":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T22:16:18Z","timestamp":1643753778000},"page":"475","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A Self-Parametrization Framework for Meta-Heuristics"],"prefix":"10.3390","volume":"10","author":[{"given":"Andr\u00e9 S.","family":"Santos","sequence":"first","affiliation":[{"name":"Interdisciplinary Studies Research Center, (ISEP\/IPP), 4200-072 Porto, Portugal"},{"name":"Department of Computer Science, Institute of Engineering from Polytechnic of Porto (ISEP\/IPP), 4249-015 Porto, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0264-4710","authenticated-orcid":false,"given":"Ana M.","family":"Madureira","sequence":"additional","affiliation":[{"name":"Interdisciplinary Studies Research Center, (ISEP\/IPP), 4200-072 Porto, Portugal"},{"name":"Department of Computer Science, Institute of Engineering from Polytechnic of Porto (ISEP\/IPP), 4249-015 Porto, Portugal"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2299-1859","authenticated-orcid":false,"given":"Leonilde R.","family":"Varela","sequence":"additional","affiliation":[{"name":"Department of Production and Systems Engineering, Universidade do Minho, 4800-058 Guimar\u00e3es, Portugal"},{"name":"Algoritmi Research Centre, Universidade do Minho, 4800-058 Guimar\u00e3es, Portugal"}]}],"member":"1968","published-online":{"date-parts":[[2022,2,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Xhafa, F., and Abraham, A. (2008). Metaheuristics for Scheduling in Industrial and Manufacturing Applications. Studies in Computational Intelligence, Springer.","DOI":"10.1007\/978-3-540-78985-7"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF02125421","article-title":"Metaheuristics: A Bibliography","volume":"63","author":"Osman","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"ref_3","unstructured":"Luke, S. (2013). Essential of Metaheuristics, Lulu. [2nd ed.]."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Talbi, E. (2009). Meta-Heuristics: From Design to Implementation, Wiley.","DOI":"10.1002\/9780470496916"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv."},{"key":"ref_6","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems: And Introduction Analysis with Application to Biology, Control and Artificial Intelligence, University of Michigan Press."},{"key":"ref_7","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_8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","article-title":"A Thermodynamical Approach to the Travelling Salesman Problem: An Efficient Simulated Annealing Algorithm","volume":"45","year":"1985","journal-title":"J. Optim. Theory Appl."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","article-title":"Future Paths for Integer Programming and Links to Artificial Intelligence","volume":"13","author":"Glover","year":"1986","journal-title":"Comput. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","article-title":"A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem","volume":"8","author":"Feo","year":"1989","journal-title":"Oper. Res. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable Neighborhood Search","volume":"24","author":"Hansen","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"ref_12","unstructured":"Stu\u0308tzle, T.G. (1998). Local Search Algorithms for Combinatorial Problems: Analysis, Improvements, and New Applications. [Ph.D. Thesis, Department of Computer Science, Darmstadt University of Technology]."},{"key":"ref_13","unstructured":"Dorigo, M. (1992). Optimization, Learning and Natural Algorithms. [Ph.D. Thesis, DEI]."},{"key":"ref_14","unstructured":"Kennedy, J., and Eberhart, R. (December, January 27). Particle Swarm Optimization. Proceedings of the 1995 IEEE International Conference on Neural Network (ICNN\u201995), Perth, WA, Australia."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MCS.2002.1004010","article-title":"Biomimicry of Bacterial Foraging for Distributed Optimization and Control","volume":"22","author":"Passino","year":"2002","journal-title":"IEEE Control. Syst. Mag."},{"key":"ref_16","unstructured":"Yang, X.S. (2008). Nature-Inspired Metaheuristic Algorithms, Luniver Press."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Yang, X.S., and Deb, S. (2009, January 9\u201311). Cuckoo search via L\u00e9vy flights. Proceedings of the 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), Coimbatore, India.","DOI":"10.1109\/NABIC.2009.5393690"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/978-3-642-12538-6_6","article-title":"A New Metaheuristic Bat-Inspired Algorithm","volume":"Volume 284","author":"Yang","year":"2016","journal-title":"Nature Inspired Cooperative Strategies for Optimization (NISCO 2010)"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.advengsoft.2013.12.007","article-title":"Grey Wolf Optimizer","volume":"69","author":"Mirjalili","year":"2014","journal-title":"Adv. Eng. Softw."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"107113","DOI":"10.1016\/j.asoc.2021.107113","article-title":"Distributed Grey Wolf Optimizer for Scheduling of Workflow Applications in Cloud Environments","volume":"102","author":"Alawad","year":"2021","journal-title":"Appl. Soft Comput."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"10167","DOI":"10.1007\/s00500-021-05939-3","article-title":"Exploratory cuckoo search for solving single-objective optimization problems","volume":"25","author":"Alawad","year":"2021","journal-title":"Soft Comput."},{"key":"ref_22","unstructured":"Moscato, P. (1989). On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts\u2014Towards Memetic Algorithms, Technical Report 826; Caltech Concurrent Computation Program, California Institute of Technology."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"So\u0308rensen, K., Sevaux, M., and Glover, F. (2018). A History of Metaheuristics. Handbook of Heuristics, Springer.","DOI":"10.1007\/978-3-319-07153-4_4-1"},{"key":"ref_24","first-page":"3","article-title":"Metaheuristics: The Metaphor Exposed","volume":"22","year":"2018","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1049\/el:20030383","article-title":"Queen-Bee Evolution for Genetic Algorithm","volume":"39","author":"Jung","year":"2003","journal-title":"Electron. Lett."},{"key":"ref_26","unstructured":"Abbass, H.A. (2001, January 27\u201330). MBO: Marriage in Honey Bees Optimization\u2014A Haplometrosis Polygynous Swarming Approach. Proceedings of the 2001 Congress on Evolutionary Computation (CEC), Seoul, Korea."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1142\/S0218213003001289","article-title":"Computing with Bees: Attacking Complex Transportation Engineering Problems","volume":"12","year":"2003","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"ref_28","first-page":"317","article-title":"Engineering Optimization via Nature-Inspired Virtual Bee Algorithms","volume":"Volume 3562","author":"Yang","year":"2005","journal-title":"Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","article-title":"A Survey on Optimization Metaheuristics","volume":"237","author":"Lepagnot","year":"2013","journal-title":"Inf. Sci."},{"key":"ref_30","unstructured":"Karaboga, D. (2005). An Idea Based on Honey Bee Swarm for Numerical Optimization, Technical Report TR06, 2005; Erciyes University, Engineering Faculty, Computer Engineering Department."},{"key":"ref_31","unstructured":"Pham, D.T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., and Zaidi, M. (2005). 2005. Bee Algorithm: A Novel Approach to Function Optimisation, Cardiff University, The Manufacturing Engineering Center. Technical Note: MEC 0501."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Karaboga, D., and Gorkemli, B. (2011, January 15\u201318). A Combinatorial Artificial Bee Colony Algorithm for Traveling Salesman Problem. Proceedings of the 2011 International Symposium on Innovations in Intelligent Systems and Applications (INISTA), Istanbul, Turkey.","DOI":"10.1109\/INISTA.2011.5946125"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1016\/j.asoc.2011.10.024","article-title":"A Hybrid Discrete Artificial Bee Colony Algorithm for Permutation Flowshop Scheduling Problem","volume":"13","author":"Liu","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","article-title":"2011. A Discrete Artificial Bee Colony Algorithm for the Lot-Streaming Flow Shop Scheduling Problem","volume":"181","author":"Pan","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1007\/s00500-015-1852-9","article-title":"A Hybrid Artificial Bee Colony Algorithm for the Job-Shop Scheduling Problem with No-Wait Constraint","volume":"21","author":"Suganthan","year":"2017","journal-title":"Soft Comput."},{"key":"ref_36","unstructured":"Choong, S.S., Wong, L., and Lim, C.P. (2011, January 9\u201312). An Artificial Bee Colony Algorithm with a Modified Choice Function for the Traveling Salesman Problem. Proceedings of the 2011 IEEE International Conference on Systems, Man and Cybernetics (SMC), Anchorage, AK, USA."},{"key":"ref_37","first-page":"473","article-title":"Solving the Manufacturing Cell Design Problem Using the Artificial Bee Colony Algorithm","volume":"Volume 10607","author":"Soto","year":"2017","journal-title":"Multi-Disciplinary Trends in Artificial Intelligence, Lecture Notes in Computer Science"},{"key":"ref_38","first-page":"718","article-title":"Evaluation of the Simulated Annealing and the Discrete Artificial Bee Colony in the Weight Tardiness Problem with Taguchi Experiments Parameterization","volume":"Volume 557","author":"Santos","year":"2017","journal-title":"Intelligent Systems Design and Applications, Advances in Intelligent Systems and Computing"},{"key":"ref_39","unstructured":"Hutter, F., Hoss, H.H., and Stu\u0308tzle, T. (2007, January 22\u201326). Automatic Algorithm Configuration Based on Local Search. Proceedings of the 2nd National Conference on Artificial Intelligence, Vancouver, BC, Canada."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1109\/4235.771166","article-title":"Parameter Control in Evolutionary Algorithms","volume":"3","author":"Eiben","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_41","unstructured":"Johnson, D.S. (2021, November 22). A Theoretician\u2019s Guide to the Experimental Analysis of Algorithms. Available online: https:\/\/web.cs.dal.ca\/~eem\/gradResources\/A-theoreticians-guide-to-experimental-analysis-of-algorithms-2001.pdf."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.asoc.2013.12.017","article-title":"A Beginner\u2019s Guide to Tuning Methods","volume":"17","author":"Montero","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_43","unstructured":"Eiben, G., and Schut, M.C. (2007). New Ways to Calibrate Evolutionary Algorithms. Advances in Metaheuristics for Hard Optimization, Springer."},{"key":"ref_44","unstructured":"Lye, L.M. (2005, January 2\u20134). Tools and Toys for Teaching Design of Experiments Methodology. Proceedings of the 33rd Annual General Conference of the Canadian Society for Civil Engineering, Toronto, ON, Canada."},{"key":"ref_45","unstructured":"Montgomery, D.G. (2005). Design and Analysis of Experiments, John Wiley & Sons. [6th ed.]."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/978-90-481-2311-7_52","article-title":"Comparing Different Approaches for Design of Experiments (DOE)","volume":"Volume 39","author":"Tanco","year":"2009","journal-title":"Advances in Electrical Engineering and Computational Science, Lecture Notes in Electrical Engineering"},{"key":"ref_47","unstructured":"Hinkelmann, K. (2015). History and Overview of Design and Analysis of Experiments. Handbook of Design and Analysis of Experiments, Chapman and Hall\/CRC."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","article-title":"On Experimental Attainment of Optimum Conditions","volume":"13","author":"Box","year":"1951","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"ref_49","unstructured":"Roy, R.K. (2001). Design of Experiments Using the Taguchi Approach: 16 Steps to Product and Process Improvement, Wiley."},{"key":"ref_50","first-page":"421","article-title":"Design of Experiments Application, Concepts, Examples: State of the Art","volume":"5","author":"Durakovic","year":"2017","journal-title":"Period. Eng. Nat. Sci."},{"key":"ref_51","unstructured":"Birattari, M., Stu\u0308tzle, T., Paquete, L., and Varrentrapp, K. (2002, January 9\u201313). A Racing Algorithm for Configuring Metaheuristics. Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201902), New York, NY, USA."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","article-title":"Probability Inequalities for Sum of Bounded Random Variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Am. Stat. Assoc."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Montero, E., Riff, M.C., and Neveu, B. (2010, January 18\u201323). New Requirements for Off-Line Parameter Calibration Algorithms. Proceedings of the 2010 IEEE Congress on Evolutionary Computation (CEC 2010), Barcelona, Spain.","DOI":"10.1109\/CEC.2010.5586156"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-75514-2_9","article-title":"Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement","volume":"Volume 4771","author":"Balaprakash","year":"2007","journal-title":"Hybrid Metaheuristics, Lecture Notes in Computer Science"},{"key":"ref_55","unstructured":"Bartz-Beislstein, T., Lasarczyk, C.W.G., and Preuss, M. (2005, January 2\u20135). Sequential Parameter Optimization. Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC 2005), Edinburgh, Scotland."},{"key":"ref_56","first-page":"239","article-title":"A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code","volume":"21","author":"Mckay","year":"1979","journal-title":"Technometrics"},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10898-005-2454-3","article-title":"Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models","volume":"34","author":"Huang","year":"2006","journal-title":"J. Glob. Optim."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., and Murphy, K.P. (2009, January 8\u201312). An Experimental Investigation of Model-Based Parameter Optimisation: SPO and Beyond. Proceedings of the 11th Annual Conference on Genetic and Evolutionary Computation (GECCO\u201909), Montreal, QC, Canada.","DOI":"10.1145\/1569901.1569940"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Pereira, I., Madureira, A., Costa e Silva, E., and Abraham, A. (2021). A Hybrid Metaheuristics Parameter Tuning Approach for Scheduling through Racing and Case-Based Reasoning. Appl. Sci., 11.","DOI":"10.3390\/app11083325"},{"key":"ref_60","first-page":"911","article-title":"Metaheuristics Parameter Tuning using Racing and Case-based Reasoning","volume":"Volume 557","author":"Pereira","year":"2017","journal-title":"Intelligent Systems Design and Applications, Advances in Intelligent Systems and Computing"},{"key":"ref_61","first-page":"275","article-title":"Self-Optimizing A Multi-Agent Scheduling System: A Racing Based Approach","volume":"Volume 616","author":"Pereira","year":"2016","journal-title":"Intelligent Distributed Computing IX. Studies in Computational Intelligence"},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Pereira, I., Madureira, A., Moura Oliveira, P., and Abraham, A. (2013). Tuning Meta-Heuristics Using Multi-Agent Learning in a Scheduling System. LNCS Transactions on Computational Science, Springer.","DOI":"10.1007\/978-3-642-45318-2_8"},{"key":"ref_63","first-page":"661","article-title":"Cooperative Scheduling System with Emergent Swarm Based Behavior","volume":"Volume 206","author":"Madureira","year":"2013","journal-title":"Information Systems and Technologies, Advances in Intelligent Systems and Computing"},{"key":"ref_64","first-page":"99","article-title":"Meta-heuristics Self-Parameterization in a Multi-agent Scheduling System Using Case-Based Reasoning","volume":"Volume 61","author":"Pereira","year":"2013","journal-title":"Computational Intelligence and Decision Making\u2014Trends and Applications, Intelligent Systems, Control and Automation: Science and Engineering"},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TSMC.1986.289288","article-title":"Optimization of Control Parameters for Genetic Algorithms","volume":"16","author":"Grefenstette","year":"1986","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_66","doi-asserted-by":"crossref","unstructured":"Nannen, V., and Eiben, A.E. (2007, January 6\u201312). Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters. Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), Hyderabad, India.","DOI":"10.1109\/CEC.2007.4424460"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Nannen, V., and Eiben, A.E. (2007, January 25\u201328). Efficient Relevance Estimation and Value Calibration of Evolutionary Algorithm Parameters. Proceedings of the 2007 IEEE Congress on Evolutionary Computation, Singapore.","DOI":"10.1109\/CEC.2007.4424460"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.1050.0243","article-title":"Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search","volume":"54","author":"Laguna","year":"2006","journal-title":"Oper. Res."},{"key":"ref_69","unstructured":"Beasley, J.E. (2021, November 22). ORLibrary. Available online: http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html."},{"key":"ref_70","unstructured":"Reinelt, G. (2021, November 22). TSPLIB. Available online: https:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/."},{"key":"ref_71","doi-asserted-by":"crossref","first-page":"657","DOI":"10.2307\/3214097","article-title":"Simulated Annealing Methods with General Acceptance Probabilities","volume":"24","author":"Anily","year":"1987","journal-title":"J. Appl. Probab."},{"key":"ref_72","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0305-0548(97)00054-3","article-title":"A Systematic Procedure for Setting Parameters in Simulated Annealing Algorithms","volume":"25","author":"Park","year":"1998","journal-title":"Comput. Oper. Res."},{"key":"ref_73","doi-asserted-by":"crossref","first-page":"8072621","DOI":"10.1155\/2018\/8072621","article-title":"The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance","volume":"2018","author":"Santos","year":"2018","journal-title":"J. Math."},{"key":"ref_74","doi-asserted-by":"crossref","first-page":"127","DOI":"10.4236\/jcc.2014.24017","article-title":"The Analysis of Peculiar Control Parameters of Artificial Bee Colony Algorithm on the Numerical Optimization Problems","volume":"2","author":"Kiran","year":"2014","journal-title":"J. Comput. Commun."},{"key":"ref_75","first-page":"608","article-title":"Parameter Tuning for the Artificial Bee Colony Algorithm","volume":"Volume 5796","author":"Akay","year":"2009","journal-title":"Computational Collective Intelligence: Semantics Web, Social Networks and Multiagent Systems, Lecture Notes in Computer Science"},{"key":"ref_76","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1007\/978-1-4419-1665-5_21","article-title":"Comparison of Metaheuristics","volume":"Volume 146","author":"Silberholz","year":"2010","journal-title":"Handbook of Metaheuristics"},{"key":"ref_77","doi-asserted-by":"crossref","unstructured":"Ross, S.M. (2017). Introductory Statistics, Elsevier Science, Academic Press. [4th ed.].","DOI":"10.1016\/B978-0-12-804317-2.00031-X"},{"key":"ref_78","doi-asserted-by":"crossref","unstructured":"Rochon, J., Gondan, M., and Kieser, M. (2012). To Test or Not to Test: Preliminary Assessment of Normality when Comparing Two Independent Samples. BMC Med. Res. Methodol., 12.","DOI":"10.1186\/1471-2288-12-81"}],"container-title":["Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2227-7390\/10\/3\/475\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:12:45Z","timestamp":1760134365000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2227-7390\/10\/3\/475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":78,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["math10030475"],"URL":"https:\/\/doi.org\/10.3390\/math10030475","relation":{},"ISSN":["2227-7390"],"issn-type":[{"type":"electronic","value":"2227-7390"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}