{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T17:18:53Z","timestamp":1765041533360},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Istanbul Topkap\u0131 University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Multimodal optimization poses a challenging problem in the field of optimization as it entails the discovery of multiple local and global optima, unlike unimodal optimization, which seeks a single global solution. In recent years, the significance of addressing multimodal optimization challenges has grown due to the real-world complexity of many problems. While numerous optimization methods are available for unimodal problems, multimodal optimization techniques have garnered increased attention. However, these approaches often grapple with a common issue: the determination of the niching parameter, necessitating prior knowledge of the problem space. This paper introduces a novel multimodal optimization approach that circumvents the need for prior problem space knowledge and avoids the challenge of predefining the niching parameter. Building upon the Battle Royal Optimization (BRO) algorithm, this extended version formulates a multimodal solution by utilizing Coulomb's law to identify suitable neighbors. The incorporation of Coulomb's law serves the dual purpose of identifying potential local and global optima based on fitness values and establishing optimal distances from solution candidates. A comparison study was done between the MBRO and seven well-known multimodal optimization algorithms using 14 benchmark problems from the CEC 2013 and CEC 2015 competitions to see how well it worked. The experimental results underscore MBRO's proficiency in successfully identifying most, if not all, local and global optima, positioning it as a superior solution when compared to its competitors.<\/jats:p>","DOI":"10.1007\/s10586-024-04399-2","type":"journal-article","created":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T18:01:30Z","timestamp":1713117690000},"page":"8983-8993","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Multi-modal Battle Royale optimizer"],"prefix":"10.1007","volume":"27","author":[{"given":"K. Dil\u015fad","family":"\u00c7i\u00e7ek","sequence":"first","affiliation":[]},{"given":"Taymaz","family":"Akan","sequence":"additional","affiliation":[]},{"given":"O\u011fuz","family":"Bayat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Li, X.: A multimodal particle swarm optimizer based on fitness Euclidean-distance ratio. In: Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference, pp. 78\u201385 (2007). https:\/\/doi.org\/10.1145\/1276958.1276970","key":"4399_CR1","DOI":"10.1145\/1276958.1276970"},{"issue":"2","key":"4399_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/TEVC.2016.2591064","volume":"21","author":"Q Yang","year":"2017","unstructured":"Yang, Q., et al.: Adaptive multimodal continuous ant colony optimization. IEEE Trans. Evol. Comput. 21(2), 191\u2013205 (2017). https:\/\/doi.org\/10.1109\/TEVC.2016.2591064","journal-title":"IEEE Trans. Evol. Comput."},{"unstructured":"Goldberg, D.E., Richardson, J.: Genetic algorithms with sharing for multimodal function optimization. In: Genetic Algorithms and Their Applications: Proceedings of the Second International Conference on Genetic Algorithms: July 28\u201331, 1987 at the Massachusetts. Institute of Technology, Cambridge (1987)","key":"4399_CR3"},{"unstructured":"Goldberg, D.E., Goldberg, D.E., Wang, L.: Adaptive niching via coevolutionary sharing. In: Genetic Algorithms and Evolution Strategy in Engineering and Computer Science, Chapter 2, pp. 21--38 (1997)","key":"4399_CR4"},{"issue":"11\u201312","key":"4399_CR5","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1016\/S0965-9978(02)00045-5","volume":"33","author":"CY Lin","year":"2002","unstructured":"Lin, C.Y., Wu, W.H.: Niche identification techniques in multimodal genetic search with sharing scheme. Adv. Eng. Softw. 33(11\u201312), 779\u2013791 (2002). https:\/\/doi.org\/10.1016\/S0965-9978(02)00045-5","journal-title":"Adv. Eng. Softw."},{"doi-asserted-by":"publisher","unstructured":"Miller, B.L. Shaw, M.J.: Genetic algorithms with dynamic niche sharing for multimodal function optimization. In: Proceedings of the IEEE Conference on Evolutionary Computation, IEEE, pp. 786\u2013791 (1996). https:\/\/doi.org\/10.1109\/icec.1996.542701","key":"4399_CR6","DOI":"10.1109\/icec.1996.542701"},{"issue":"3","key":"4399_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/4235.735432","volume":"2","author":"B Sareni","year":"1998","unstructured":"Sareni, B., Kr\u00e4henb\u00fchl, L.: Fitness sharing and niching methods revisited. IEEE Trans. Evol. Comput. 2(3), 97\u2013106 (1998). https:\/\/doi.org\/10.1109\/4235.735432","journal-title":"IEEE Trans. Evol. Comput."},{"doi-asserted-by":"publisher","unstructured":"Yin, X., Germay, N.: A fast genetic algorithm with sharing scheme using cluster analysis methods in multimodal function optimization. In: Artificial Neural Nets and Genetic Algorithms, pp. 450\u2013457. Springer, Vienna (1993). https:\/\/doi.org\/10.1007\/978-3-7091-7533-0_65","key":"4399_CR8","DOI":"10.1007\/978-3-7091-7533-0_65"},{"key":"4399_CR9","volume-title":"Analysis of the Behavior of a Class of Genetic Adaptive Systems","author":"KA De Jong","year":"1975","unstructured":"De Jong, K.A.: Analysis of the Behavior of a Class of Genetic Adaptive Systems. University of Michigan, Ann Arbor (1975)"},{"issue":"2","key":"4399_CR10","first-page":"27","volume":"2","author":"M Sw","year":"1992","unstructured":"Sw, M.: Crowding and preselection revisited. Parallel Probl. Solving Nat 2(2), 27\u201336 (1992)","journal-title":"Parallel Probl. Solving Nat"},{"doi-asserted-by":"publisher","unstructured":"Petrowski, A.: Clearing procedure as a niching method for genetic algorithms. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 798\u2013803. IEEE (1996). https:\/\/doi.org\/10.1109\/icec.1996.542703.","key":"4399_CR11","DOI":"10.1109\/icec.1996.542703"},{"issue":"3","key":"4399_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1162\/106365602760234081","volume":"10","author":"JP Li","year":"2002","unstructured":"Li, J.P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A species conserving genetic algorithm for multimodal function optimization. Evol. Comput. 10(3), 207\u2013234 (2002). https:\/\/doi.org\/10.1162\/106365602760234081","journal-title":"Evol. Comput."},{"issue":"13","key":"4399_CR13","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1002\/nme.2621","volume":"79","author":"J-P Li","year":"2009","unstructured":"Li, J.-P., Wood, A.S.: An adaptive species conservation genetic algorithm for multimodal optimization. Int. J. Numer. Methods Eng. 79(13), 1633\u20131661 (2009). https:\/\/doi.org\/10.1002\/nme.2621","journal-title":"Int J Numer Methods Eng"},{"key":"4399_CR14","volume-title":"An Analysis of the Behavior of a Class of Genetic Adaptive Systems (Doc- 1991)","author":"KA De Jong","year":"1975","unstructured":"De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems (Doc- 1991). University of Michigan, Ann Arbor (1975)"},{"unstructured":"Mengshoel, O.J., Goldberg, D.E.: Probabilistic crowding: deterministic crowding with probabilistic replacement, pp. 409\u2013416 (1999)","key":"4399_CR15"},{"key":"4399_CR16","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control and Artificial Intelligence","author":"J Holland","year":"1975","unstructured":"Holland, J.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Application to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1975)"},{"unstructured":"P\u00e9trowski, A.: An efficient hierarchical clustering technique for speciation. Evolution. Technical report, Institute National des Telecommunications, Evry, France, Technique Report (2007)","key":"4399_CR17"},{"doi-asserted-by":"publisher","unstructured":"Barrera, J., Coello, C.A.C.: A particle swarm optimization method for multimodal optimization based on electrostatic interaction. In: Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), pp. 622\u2013632 (2009). https:\/\/doi.org\/10.1007\/978-3-642-05258-3_55","key":"4399_CR18","DOI":"10.1007\/978-3-642-05258-3_55"},{"key":"4399_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.ins.2012.02.011","volume":"197","author":"BY Qu","year":"2012","unstructured":"Qu, B.Y., Liang, J.J., Suganthan, P.N.: Niching particle swarm optimization with local search for multi-modal optimization. Inf. Sci. (N Y) 197, 131\u2013143 (2012). https:\/\/doi.org\/10.1016\/j.ins.2012.02.011","journal-title":"Inf. Sci. (N Y)"},{"doi-asserted-by":"publisher","unstructured":"Rahkar-Farshi, T., Behjat-Jamal, S.: A multimodal firefly optimization algorithm based on Coulomb\u2019s law. Int. J. Adv. Comput. Sci. Appl. (2016). https:\/\/doi.org\/10.14569\/ijacsa.2016.070521","key":"4399_CR20","DOI":"10.14569\/ijacsa.2016.070521"},{"issue":"1","key":"4399_CR21","doi-asserted-by":"publisher","first-page":"627","DOI":"10.2991\/ijcis.2017.10.1.42","volume":"10","author":"J G\u00e1lvez","year":"2017","unstructured":"G\u00e1lvez, J., Cuevas, E., Avalos, O.: Flower Pollination algorithm for multimodal optimization. Int. J. Comput. Intell. Syst. 10(1), 627\u2013646 (2017). https:\/\/doi.org\/10.2991\/ijcis.2017.10.1.42","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"4399_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/s12530-021-09368-3","author":"TR Farshi","year":"2021","unstructured":"Farshi, T.R.: A memetic animal migration optimizer for multimodal optimization. Evolv. Syst. (2021). https:\/\/doi.org\/10.1007\/s12530-021-09368-3","journal-title":"Evolv. Syst."},{"issue":"11","key":"4399_CR23","doi-asserted-by":"publisher","first-page":"10035","DOI":"10.1007\/s12652-020-02755-9","volume":"12","author":"TR Farshi","year":"2021","unstructured":"Farshi, T.R., Orujpour, M.: A multi-modal bacterial foraging optimization algorithm. J. Ambient. Intell. Humaniz. Comput. 12(11), 10035\u201310049 (2021). https:\/\/doi.org\/10.1007\/s12652-020-02755-9","journal-title":"J. Ambient. Intell. Humaniz. Comput."},{"key":"4399_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-023-09074-z","author":"M Orujpour","year":"2023","unstructured":"Orujpour, M., Feizi-Derakhshi, M.R., Akan, T.: A multimodal butterfly optimization using fitness-distance balance. Soft. Comput. (2023). https:\/\/doi.org\/10.1007\/s00500-023-09074-z","journal-title":"Soft. Comput."},{"issue":"4","key":"4399_CR25","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/s00521-020-05004-4","volume":"33","author":"TR Farshi","year":"2021","unstructured":"Farshi, T.R.: Battle Royale optimization algorithm. Neural Comput. Appl. 33(4), 1139\u20131157 (2021). https:\/\/doi.org\/10.1007\/s00521-020-05004-4","journal-title":"Neural Comput. Appl."},{"key":"4399_CR26","volume-title":"Benchmark Functions for CEC\u20192013 Special Session and Competition on Niching Methods for Multimodal Function Optimization","author":"X Li","year":"2013","unstructured":"Li, X., Engelbrecht, A., Epitropakis, M.G.: Benchmark Functions for CEC\u20192013 Special Session and Competition on Niching Methods for Multimodal Function Optimization. RMIT University, Melbourne (2013)"},{"unstructured":"Qu, B.Y., Liang, J.J., Suganthan, P.N., Chen, Q.: Problem definitions and evaluation criteria for the CEC 2015 competition on single objective multi-niche optimization. http:\/\/www.ntu.edu.sg\/home\/EPNSugan\/index_files\/CEC2015\/CEC2015.htm","key":"4399_CR27"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04399-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-024-04399-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-024-04399-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T19:12:46Z","timestamp":1725909166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-024-04399-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["4399"],"URL":"https:\/\/doi.org\/10.1007\/s10586-024-04399-2","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2024,4,14]]},"assertion":[{"value":"27 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Conflict of interest the authors declare no conflict of interest in this study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}