{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T17:50:44Z","timestamp":1778867444047,"version":"3.51.4"},"reference-count":34,"publisher":"SAGE Publications","issue":"9","license":[{"start":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T00:00:00Z","timestamp":1561420800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2019,9]]},"abstract":"<jats:p>The purpose of this study was to solve the parameter-tuning problem of complex systems modeled in an agent-based modeling and simulation environment. As a good set of parameters is necessary to demonstrate the target behavior in a realistic way, modeling a complex system constitutes an optimization problem that must be solved for systems with large parameter spaces. This study presents a three-step hybrid parameter-tuning approach for agent-based models and simulations. In the first step, the problem is defined; in the second step, a parameter-tuning process is performed using the following meta-heuristic algorithms: the Genetic Algorithm, the Firefly Algorithm, the Particle Swarm Optimization algorithm, and the Artificial Bee Colony algorithm. The critical parameters of the meta-heuristic algorithms used in the second step are tuned using the adaptive parameter-tuning method. Thus, new meta-heuristic algorithms are developed, namely, the Adaptive Genetic Algorithm, the Adaptive Firefly Algorithm, the Adaptive Particle Swarm Optimization algorithm, and the Adaptive Artificial Bee Colony algorithm. In the third step, the control phase, the algorithm parameters obtained via the adaptive parameter-tuning method and the parameter values of the model obtained from the meta-heuristic algorithms are manually provided to the developed tool performing the parameter-tuning process and they are tested. The best results are achieved when the meta-heuristic algorithms that were successful in the optimization process are used with their critical parameters adjusted for optimum results. The proposed approach is tested by using the Predator\u2013Prey model, the Eight Queens model, and the Flow Zombies model, and the results are compared.<\/jats:p>","DOI":"10.1177\/0037549719846366","type":"journal-article","created":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T11:32:48Z","timestamp":1561462368000},"page":"771-796","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":12,"title":["Adaptive parameter tuning for agent-based modeling and simulation"],"prefix":"10.1177","volume":"95","author":[{"given":"Rabia","family":"Korkmaz Tan","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Tekirda\u011f Nam\u0131k Kemal University, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u015eebnem","family":"Bora","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Ege University, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,6,25]]},"reference":[{"key":"bibr1-0037549719846366","first-page":"86","volume-title":"proceedings of the 2009 winter simulation conference","author":"Macal C"},{"key":"bibr2-0037549719846366","unstructured":"Epstein JM. Generative social science studies in agent-based computational modeling. Princeton, NJ: Princeton University Press, 2007, p. 384."},{"key":"bibr3-0037549719846366","unstructured":"Tesfatsion L, Judd KL. Handbook of computational economics. Agent-based computational economics. Amsterdam: Elsevier, 2006, pp. 1187\u20131233."},{"key":"bibr4-0037549719846366","first-page":"171","volume-title":"IEEE 2004, Proceedings of the 2004 Winter Simulation Conference","author":"Cioppa TM"},{"key":"bibr5-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1126\/science.1116681"},{"key":"bibr6-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1016\/B978-008044581-6\/50008-9"},{"key":"bibr7-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1007\/s10827-013-0467-3"},{"key":"bibr8-0037549719846366","first-page":"113","volume-title":"Proceedings of the Second Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW\u201909)","author":"Bonjean N"},{"key":"bibr9-0037549719846366","first-page":"466","volume-title":"Berlin, Heidelberg: Congress of the Italian Association for Artificial Intelligence","author":"Montagna S"},{"key":"bibr10-0037549719846366","first-page":"133","volume-title":"Computational Analaysis. Synthesis and Design of Dynamic Systems","author":"Gardelli L","year":"2009"},{"key":"bibr11-0037549719846366","first-page":"1","volume-title":"Multi-Agent-Based Simulation VII","author":"Terano T"},{"key":"bibr12-0037549719846366","first-page":"120","volume-title":"proceedings of the fifth international joint conference on autonomous agents and multi agent systems (AAMAS\u201906)","author":"Fehler M"},{"key":"bibr13-0037549719846366","unstructured":"Schwefel HP. Evolution and optimum seeking. 1st ed. New York: John Wiley and Sons Ltd, 1995, p.10."},{"key":"bibr14-0037549719846366","first-page":"39","volume":"1","author":"Erg\u00fcn S","year":"2015","journal-title":"Int J Sci Techn Res"},{"key":"bibr15-0037549719846366","first-page":"415","volume-title":"ESM 2007: 21st annual European simulation and modelling conference, ESM 2007","author":"Calvez B"},{"key":"bibr16-0037549719846366","first-page":"64","volume-title":"Proceedings of DSIE 2008 - Doctoral Symposium on Informatics Engineering, FEUP Edi\u00e7\u00f5es, Colec\u00e7\u00e3o Colect\u00e2neas","author":"Valente P"},{"key":"bibr17-0037549719846366","first-page":"1683","volume-title":"Proceedings of the 2015 International Conference on Autonomous Agents and Multi Agent Systems {AAMAS}, International Foundation for Autonomous Agents and Multi agent Systems","author":"Darty K"},{"key":"bibr18-0037549719846366","first-page":"177","volume-title":"Proceedings of the 20th International Conference on Automated Planning and Scheduling-(ICAPS 2010)","author":"Valenzano RA"},{"key":"bibr19-0037549719846366","first-page":"419","volume-title":"Toulause: SMAC: Proceedings of the 5th International Conference on Agents and Artificial Intelligence (ICAART)","author":"Brax N"},{"key":"bibr20-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1007\/11734680_4"},{"key":"bibr21-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1145\/1160633.1160651"},{"key":"bibr22-0037549719846366","first-page":"693","volume":"6","author":"Sallans B","year":"2003","journal-title":"J Artif Soc Soc Simulat"},{"key":"bibr23-0037549719846366","first-page":"58","author":"Korkmaz Tan R","year":"2017","journal-title":"Int J Eng Sci Appl"},{"key":"bibr24-0037549719846366","doi-asserted-by":"publisher","DOI":"10.21923\/jesd.307125"},{"key":"bibr25-0037549719846366","first-page":"1314","volume":"11","author":"Korkmaz Tan R","year":"2017","journal-title":"World Acad Sci Eng Technol Int J Comput Inform Eng"},{"key":"bibr26-0037549719846366","doi-asserted-by":"crossref","unstructured":"Birattari M, Yuan Z, Balaprakash Pet al. F-race and iterated f-race: an overview, experimental methods for the analysis of optimization algorithms. Berlin: Springer, 2010, pp.311\u2013336.","DOI":"10.1007\/978-3-642-02538-9_13"},{"key":"bibr27-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0577-0_7"},{"key":"bibr28-0037549719846366","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9149-x"},{"key":"bibr29-0037549719846366","author":"\u00c7ak\u0131rlar I","year":"2014","journal-title":"Etmen Temelli Benzetimler \u0130\u00e7in Test G\u00fcd\u00fcml\u00fc Bir Yakla\u015f\u0131m Geli\u015ftirilmesi"},{"key":"bibr30-0037549719846366","first-page":"79","volume-title":"Nature-Inspired Metaheuristic Algorithms","author":"Yang XS","year":"2008"},{"key":"bibr31-0037549719846366","unstructured":"Rouse Ball WW. The Eight Queens problem, in mathematical recreations and essays. New York: Macmillan, 1960, pp.165\u2013171."},{"key":"bibr32-0037549719846366","first-page":"133","volume-title":"Infectious Disease Modelling Research Progress","author":"Munz P","year":"2009"},{"key":"bibr33-0037549719846366","unstructured":"North M-J, Tatara E, Collier NTet al. The Repast Simphony Runtime System. In: Macal C-M, North M-J, Sallach D. (eds.) Argonne National Laboratory and The University of Chicago 2005: Paper extracted from Proceedings of the Agent 2005 Conference on Generative, Argonne National Laboratory 2005, Chicago, IL, 13\u201315 October 2005, pp. 151\u2013158."},{"key":"bibr34-0037549719846366","unstructured":"North MJ, Tatara E, Collier NTet al. Visual Agent-Based Model Development with Repast Simphony. In: USDOE Office of Science (SC): Agent 2007 Conference on Complex Interaction and Social Emergence, Argonne National Laboratory, Argonne, 15\u201317 November 2007, pp. 1\u201320."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549719846366","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0037549719846366","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549719846366","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:29:59Z","timestamp":1777634999000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549719846366"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,25]]},"references-count":34,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["10.1177\/0037549719846366"],"URL":"https:\/\/doi.org\/10.1177\/0037549719846366","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,25]]}}}