{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:12:26Z","timestamp":1773249146896,"version":"3.50.1"},"reference-count":107,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T00:00:00Z","timestamp":1479081600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004569","name":"Ministerstwo Nauki i Szkolnictwa Wy\u017cszego (PL)","doi-asserted-by":"publisher","award":["No 3841\/E-41\/S\/2014"],"award-info":[{"award-number":["No 3841\/E-41\/S\/2014"]}],"id":[{"id":"10.13039\/501100004569","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Swarm Intell"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s11721-016-0129-y","type":"journal-article","created":{"date-parts":[[2016,11,14]],"date-time":"2016-11-14T11:34:48Z","timestamp":1479123288000},"page":"307-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Searching for structural bias in particle swarm optimization and differential evolution algorithms"],"prefix":"10.1007","volume":"10","author":[{"given":"Adam P.","family":"Piotrowski","sequence":"first","affiliation":[]},{"given":"Jaroslaw J.","family":"Napiorkowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,14]]},"reference":[{"key":"129_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s11721-016-0121-6","volume":"10","author":"E Ampellio","year":"2016","unstructured":"Ampellio, E., & Vassio, L. (2016). A hybrid swarm-based algorithm for single-objective optimization problems involving high-cost analyses. Swarm Intelligence, 10, 99\u2013121.","journal-title":"Swarm Intelligence"},{"key":"129_CR2","doi-asserted-by":"crossref","DOI":"10.1142\/7438","volume-title":"Theory of randomized search heuristics. Vol. 1 of theoretical computer science","author":"A Auger","year":"2011","unstructured":"Auger, A., & Doerr, B. (2011). Theory of randomized search heuristics. Vol. 1 of theoretical computer science. Singapore: World Scientific."},{"key":"129_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s11047-007-9050-z","volume":"7","author":"A Banks","year":"2008","unstructured":"Banks, A., Vincent, J., & Anyakoha, C. (2008). A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing, 7, 109\u2013124.","journal-title":"Natural Computing"},{"key":"129_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s11721-014-0095-1","volume":"8","author":"MR Bonyadi","year":"2014","unstructured":"Bonyadi, M. R., & Michalewicz, Z. (2014). A locally convergent rotationally invariant particle swarm optimization algorithm. Swarm Intelligence, 8, 159\u2013198.","journal-title":"Swarm Intelligence"},{"key":"129_CR5","doi-asserted-by":"publisher","unstructured":"Bonyadi, M. R., & Michalewicz, Z. (2016). Particle swarm optimization for single objective continuous space problems: A review. Evolutionary Computation. doi: 10.1162\/EVCO_r_00180 .","DOI":"10.1162\/EVCO_r_00180"},{"key":"129_CR6","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","volume":"237","author":"I Boussad","year":"2013","unstructured":"Boussad, I., Lepagnot, J., & Siarry, P. (2013). A survey on optimization metaheuristics. Information Sciences, 237, 82\u2013117.","journal-title":"Information Sciences"},{"issue":"1","key":"129_CR7","doi-asserted-by":"crossref","first-page":"1363","DOI":"10.1016\/j.asoc.2010.04.008","volume":"11","author":"ZH Cai","year":"2011","unstructured":"Cai, Z. H., Gong, W. Y., Ling, C. X., & Zhang, H. (2011). A clustering-based differential evolution for global optimization. Applied Soft Computing, 11(1), 1363\u20131379.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"129_CR8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TEVC.2011.2173577","volume":"17","author":"WN Chen","year":"2013","unstructured":"Chen, W. N., Zhang, J., Lin, Y., Chen, N., Zhan, Z. H., Chung, H. S. H., et al. (2013). Particle swarm optimization with an aging leader and challengers. IEEE Transactions on Evolutionary Computation, 17(2), 241\u2013258.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.ins.2016.08.061","volume":"373","author":"S Chinta","year":"2016","unstructured":"Chinta, S., Kommadath, R., & Kotecha, P. (2016). A note on multi-objective improved teaching-learning based optimization algorithm (MO-ITLBO). Information Sciences, 373, 337\u2013350.","journal-title":"Information Sciences"},{"key":"129_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s11721-013-0090-y","volume":"8","author":"CW Cleghorn","year":"2014","unstructured":"Cleghorn, C. W., & Engelbrecht, A. P. (2014). A generalized theoretical deterministic particle swarm model. Swarm Intelligence, 8, 35\u201359.","journal-title":"Swarm Intelligence"},{"key":"129_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11721-015-0109-7","volume":"9","author":"CW Cleghorn","year":"2015","unstructured":"Cleghorn, C. W., & Engelbrecht, A. P. (2015). Particle swarm variants: Standardized convergence analysis. Swarm Intelligence, 9, 177\u2013203.","journal-title":"Swarm Intelligence"},{"key":"129_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9780470612163","volume-title":"Particle swarm optimization","author":"M Clerc","year":"2006","unstructured":"Clerc, M. (2006). Particle swarm optimization. London: ISTE Ltd."},{"issue":"1","key":"129_CR13","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/4235.985692","volume":"6","author":"M Clerc","year":"2002","unstructured":"Clerc, M., & Kennedy, J. (2002). The particle swarm\u2014Explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1), 58\u201373.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.ins.2012.05.009","volume":"212","author":"M \u010crepin\u0161ek","year":"2012","unstructured":"\u010crepin\u0161ek, M., Liu, S. H., & Mernik, L. (2012). A note on teaching-learning-based optimization algorithm. Information Sciences, 212, 79\u201393.","journal-title":"Information Sciences"},{"key":"129_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.asoc.2014.02.009","volume":"19","author":"M \u010crepin\u0161ek","year":"2014","unstructured":"\u010crepin\u0161ek, M., Liu, S. H., & Mernik, M. (2014). Replication and comparison of computational experiments in applied evolutionary computing: Common pitfalls and guidelines to avoid them. Applied Soft Computing, 19, 161\u2013170.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"129_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s00500-014-1493-4","volume":"20","author":"M \u010crepin\u0161ek","year":"2016","unstructured":"\u010crepin\u0161ek, M., Liu, S. H., Mernik, L., & Mernik, M. (2016). Is a comparison of results meaningful from the inexact replications of computational experiments? Soft Computing, 20(1), 223\u2013235.","journal-title":"Soft Computing"},{"key":"129_CR17","doi-asserted-by":"crossref","unstructured":"Das, S., Abraham, A., & Konar, A. (2008). Particle swarm optimization and differential evolution algorithms: Technical analysis, applications and hybridization perspectives. In Studies in computational intelligence (Vol. 116). Berlin: Springer.","DOI":"10.1007\/978-3-540-78297-1_1"},{"issue":"3","key":"129_CR18","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TEVC.2008.2009457","volume":"13","author":"S Das","year":"2009","unstructured":"Das, S., Abraham, A., Chakraboty, U. K., & Konar, A. (2009). Differential evolution using a neighborhood-based mutation operator. IEEE Transactions on Evolutionary Computation, 13(3), 526\u2013553.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2016.01.004","volume":"27","author":"S Das","year":"2016","unstructured":"Das, S., Mullick, S. S., & Suganthan, P. N. (2016). Recent advances in differential evolution\u2014An updated survey. Swarm and Evolutionary Computation, 27, 1\u201330.","journal-title":"Swarm and Evolutionary Computation"},{"key":"129_CR20","unstructured":"Das, S., & Suganthan, P. N. (2010). Problem definitions and evaluation criteria for CEC 2011 competition on testing evolutionary algorithms on real world optimization problems. Jadavpur Univ., Nanyang Technol. Univ., Kolkata, India, Technical Report, Dec. 2010."},{"issue":"1","key":"129_CR21","first-page":"27","volume":"15","author":"S Das","year":"2011","unstructured":"Das, S., & Suganthan, P. N. (2011). Differential evolution: A survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation, 15(1), 27\u201354.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2014.06.009","volume":"289","author":"J Derrac","year":"2014","unstructured":"Derrac, J., Garcia, S., Hui, S., Suganthan, P. N., & Herrera, F. (2014). Analyzing convergence performance of evolutionary algorithms: A statistical approach. Information Sciences, 289, 41\u201358.","journal-title":"Information Sciences"},{"key":"129_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.asoc.2015.05.015","volume":"34","author":"A Draa","year":"2015","unstructured":"Draa, A. (2015). On the performances of the flower pollination algorithm\u2014Qualitative and quantitative analyses. Applied Soft Computing, 34, 349\u2013371.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"129_CR24","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0304-3975(02)00094-4","volume":"287","author":"S Droste","year":"2002","unstructured":"Droste, S., Jansen, T., & Wegener, I. (2002). Optimization with randomized search heuristics\u2014The (A)NFL theorem, realistic scenarios, and difficult functions. Theoretical Computer Science, 287(1), 131\u2013144.","journal-title":"Theoretical Computer Science"},{"key":"129_CR25","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s00224-004-1177-z","volume":"39","author":"S Droste","year":"2006","unstructured":"Droste, S., Jansen, T., & Wegener, I. (2006). Upper and lower bounds for randomized search heuristics in black-box optimization. Theory of Computing Systems, 39, 525\u2013544.","journal-title":"Theory of Computing Systems"},{"issue":"2","key":"129_CR26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1162\/EVCO_a_00077","volume":"21","author":"EA Du\u00e9\u00f1ez-Guzm\u00e1n","year":"2013","unstructured":"Du\u00e9\u00f1ez-Guzm\u00e1n, E. A., & Vose, M. D. (2013). No free lunch and benchmarks. Evolutionary Computation, 21(2), 293\u2013312.","journal-title":"Evolutionary Computation"},{"issue":"3","key":"129_CR27","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1109\/TEVC.2014.2322883","volume":"19","author":"AS Dymond","year":"2015","unstructured":"Dymond, A. S., Engelbrecht, A. P., Kok, S., & Heyns, P. S. (2015). Tuning optimization algorithms under multiple objective function evaluation budgets. IEEE Transactions on Evolutionary Computation, 19(3), 341\u2013358.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR28","doi-asserted-by":"crossref","unstructured":"Eberhart, R. C., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the 6th international symposium on micro machine and human science (pp. 39\u201343). Institute of Electrical and Electronics Engineers (IEEE).","DOI":"10.1109\/MHS.1995.494215"},{"key":"129_CR29","doi-asserted-by":"crossref","unstructured":"Eiben, A. E., & Jelasity, M. (2002). A critical note on experimental research methodology in EC. In Proceedings of the 2002 Congress (CEC2002) (Vol. 1, pp. 582\u2013587). Institute of Electrical and Electronics Engineers (IEEE).","DOI":"10.1109\/CEC.2002.1006991"},{"key":"129_CR30","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1038\/nature14544","volume":"521","author":"AE Eiben","year":"2015","unstructured":"Eiben, A. E., & Smith, J. (2015). From evolutionary computation to the evolution of things. Nature, 521, 476\u2013482.","journal-title":"Nature"},{"key":"129_CR31","doi-asserted-by":"crossref","unstructured":"Elsayed, S. M., Sarker, R. A. & Essam, D. L. (2011). GA with a new multi-parent crossover for constrained optimization. In IEEE Congress on evolutionary computation 2011 (pp. 857\u2013864). Institute of Electrical and Electronics Engineers (IEEE).","DOI":"10.1109\/CEC.2011.5949708"},{"key":"129_CR32","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.engappai.2013.09.013","volume":"27","author":"SM Elsayed","year":"2014","unstructured":"Elsayed, S. M., Sarker, R. A., & Essam, D. L. (2014). A new genetic algorithm for solving optimization problems. Engineering Applications of Artificial Intelligence, 27, 57\u201369.","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"129_CR33","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.ins.2012.05.017","volume":"216","author":"MG Epitropakis","year":"2012","unstructured":"Epitropakis, M. G., Plagianakos, V. P., & Vrahatis, M. N. (2012). Evolving cognitive and social experience in particle swarm optimization through differential evolution: A hybrid approach. Information Sciences, 216, 50\u201392.","journal-title":"Information Sciences"},{"key":"129_CR34","unstructured":"Fister, I, Jr., Maklar, U., Brest, J., & Fister, I. (2016). A new population-based nature-inspired algorithm every month: Is the current era coming to the end? In Proceedings of the 3rd Student Computer Science Research Conference (pp. 33\u201337). Ljubljana: Slovenia, University of Primorska Press."},{"issue":"2","key":"129_CR35","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/6.819926","volume":"37","author":"DB Fogel","year":"2000","unstructured":"Fogel, D. B. (2000). What is evolutionary computation? IEEE Spectrum, 37(2), 26\u201332.","journal-title":"IEEE Spectrum"},{"key":"129_CR36","doi-asserted-by":"crossref","first-page":"3764","DOI":"10.1007\/s11227-015-1592-8","volume":"72","author":"S Fong","year":"2016","unstructured":"Fong, S., Wang, X., Xu, Q., Wong, R., Fiaidhi, J., & Mohammed, S. (2016). Recent advances in metaheuristic algorithms: Does the Makara dragon exist? The Journal of Supercomputing, 72, 3764\u20133786.","journal-title":"The Journal of Supercomputing"},{"key":"129_CR37","unstructured":"G\u00e4mperle, R., M\u00fcller, S. D., & Koumoutsakos, P. (2002). A parameter study of differential evolution. In Advances in intelligent systems, fuzzy systems, evolutionary computation. Interlaken: WSEAS Press."},{"key":"129_CR38","first-page":"2677","volume":"9","author":"S Garcia","year":"2008","unstructured":"Garcia, S., & Herrera, F. (2008). An extension on \u201cStatistical comparisons of classifiers over multiple data sets\u201d for all pairwise comparisons. Journal of Machine Learning Research, 9, 2677\u20132694.","journal-title":"Journal of Machine Learning Research"},{"issue":"4","key":"129_CR39","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/S0039-6060(96)80149-8","volume":"119","author":"JC Hall","year":"1996","unstructured":"Hall, J. C., Mills, B., Nguyen, H., & Hall, J. L. (1996). Methodologic standards in surgical trials. Surgery, 119(4), 466\u2013472.","journal-title":"Surgery"},{"issue":"2","key":"129_CR40","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1109\/TEVC.2012.2189404","volume":"17","author":"S Helwig","year":"2013","unstructured":"Helwig, S., Branke, J., & Mostaghim, S. (2013). Experimental analysis of bound handling techniques in particle swarm optimization. IEEE Transactions on Evolutionary Computation, 17(2), 259\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR41","volume-title":"Adaptation in natural and artificial systems","author":"IH Holland","year":"1975","unstructured":"Holland, I. H. (1975). Adaptation in natural and artificial systems. Ann Arbor: University of Michigan Press."},{"key":"129_CR42","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/j.asoc.2016.01.001","volume":"41","author":"ZB Hu","year":"2016","unstructured":"Hu, Z. B., Su, Q. H., Yang, X. S., & Xiong, Z. G. (2016). Not guaranteeing convergence of differential evolution on a class of multimodal functions. Applied Soft Computing, 41, 479\u2013487.","journal-title":"Applied Soft Computing"},{"key":"129_CR43","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.cam.2014.02.034","volume":"268","author":"ZB Hu","year":"2014","unstructured":"Hu, Z. B., Xiong, S. W., Su, Q. H., & Fang, Z. X. (2014). Finite Markov chain analysis of classical differential evolution algorithm. Journal of Computational and Applied Mathematics, 268, 121\u2013134.","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"6","key":"129_CR44","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0020-0190(03)00222-9","volume":"86","author":"C Igel","year":"2003","unstructured":"Igel, C., & Toussaint, M. (2003). On classes of functions for which no free lunch results hold. Information Processing Letters, 86(6), 317\u2013321.","journal-title":"Information Processing Letters"},{"key":"129_CR45","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:JMMA.0000049381.24625.f7","volume":"3","author":"C Igel","year":"2004","unstructured":"Igel, C., & Toussaint, M. (2004). A no-free lunch theorem for non-uniform distributions of target functions. Journal of Mathematical Modelling and Algorithms, 3, 313\u2013322.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"issue":"2","key":"129_CR46","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/TSMCB.2011.2167966","volume":"42","author":"SM Islam","year":"2012","unstructured":"Islam, S. M., Das, S., Ghosh, S., Roy, S., & Suganthan, P. N. (2012). An adaptive differential evolution algorithm with novel mutation and crossover strategies for global numerical optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B - Cybernetics, 42(2), 482\u2013500.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics, Part B - Cybernetics"},{"key":"129_CR47","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga, D., & Basturk, B. (2008). On the performance of artificial bee colony (ABC) algorithm. Applied Soft Computing, 8, 687\u2013697.","journal-title":"Applied Soft Computing"},{"key":"129_CR48","doi-asserted-by":"crossref","unstructured":"Kennedy, J., & Eberhart, R. C. (1995). Particle swam optimization. In Proceedings of the IEEE international conference on neural networks (pp. 1942\u20131948). Institute of Electrical and Electronics Engineers (IEEE), 1995.","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"8","key":"129_CR49","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1109\/TSE.2002.1027796","volume":"28","author":"BA Kitchenham","year":"2002","unstructured":"Kitchenham, B. A., Pfleeger, S. L., Pickard, L. M., Jones, P. W., Hoaglin, D. C., El Emam, K., et al. (2002). Preliminary guidelines for empirical research in software engineering. IEEE Transactions on Software Engineering, 28(8), 721\u2013734.","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"129_CR50","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T. G., Lewis, R. A., & Torczon, V. (2003). Optimization by direct search: New perspectives on some classical and modern methods. SIAM Review, 45(3), 385\u2013482.","journal-title":"SIAM Review"},{"key":"129_CR51","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1016\/j.ins.2014.11.035","volume":"298","author":"AV Kononova","year":"2015","unstructured":"Kononova, A. V., Corne, D. W., De Wilde, P., Shneer, V., & Caraffini, F. (2015). Structural bias in population-based algorithms. Information Sciences, 298, 468\u2013490.","journal-title":"Information Sciences"},{"issue":"3","key":"129_CR52","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1109\/4235.930318","volume":"5","author":"M K\u00f6ppen","year":"2001","unstructured":"K\u00f6ppen, M., Wolpert, D. H., & Macready, W. G. (2001). Remarks on a recent paper on the \u201c No free lunch\u201d theorems. IEEE Transactions on Evolutionary Computation, 5(3), 295\u2013296.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"129_CR53","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1137\/S1052623496303470","volume":"9","author":"JC Lagarias","year":"1998","unstructured":"Lagarias, J. C., Reeds, J. A., Wright, M. H., & Wright, P. E. (1998). Convergence properties of the Nelder\u2013Mead simplex method in low dimensions. SIAM Journal of Optimization, 9(1), 112\u2013147.","journal-title":"SIAM Journal of Optimization"},{"key":"129_CR54","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s11721-015-0114-x","volume":"9","author":"BJ Leonard","year":"2015","unstructured":"Leonard, B. J., Engelbrecht, A. P., & Cleghorn, C. W. (2015). Critical considerations on angle modulated particle swarm optimizers. Swarm Intelligence, 9, 291\u2013314.","journal-title":"Swarm Intelligence"},{"key":"129_CR55","unstructured":"Liang, J. J., Qu, B. Y., & Suganthan, P. N. (2013). Problem definitions and evaluation criteria for the CEC 2014 special session and competition on single objective real-parameter numerical optimization. Technical Report 201311, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore."},{"issue":"3","key":"129_CR56","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1109\/TEVC.2005.857610","volume":"10","author":"JJ Liang","year":"2006","unstructured":"Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006). Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation, 10(3), 281\u2013295.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR57","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s11721-013-0088-5","volume":"7","author":"T Liao","year":"2013","unstructured":"Liao, T., Aydin, D., & St\u00fctzle, T. (2013). Artificial bee colonies for continuous optimization: Experimental analysis and improvements. Swarm Intelligence, 7, 327\u2013356.","journal-title":"Swarm Intelligence"},{"key":"129_CR58","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ins.2013.04.015","volume":"241","author":"KM Malan","year":"2013","unstructured":"Malan, K. M., & Engelbrecht, A. P. (2013). A survey of techniques for characterising fitness landscapes and some possible ways forward. Information Sciences, 241, 148\u2013163.","journal-title":"Information Sciences"},{"key":"129_CR59","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s11721-014-0099-x","volume":"8","author":"KM Malan","year":"2014","unstructured":"Malan, K. M., & Engelbrecht, A. P. (2014). Characterising the searchability of continuous optimisation problems for PSO. Swarm Intelligence, 8, 275\u2013302.","journal-title":"Swarm Intelligence"},{"key":"129_CR60","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modelling and Computer Simulation, 8, 3\u201330.","journal-title":"ACM Transactions on Modelling and Computer Simulation"},{"key":"129_CR61","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.ins.2014.08.040","volume":"291","author":"M Mernik","year":"2015","unstructured":"Mernik, M., Liu, S. H., Karaboga, D., & \u010crepin\u0161ek, M. (2015). On clarifying misconceptions when comparing variants of the Artificial Bee Colony Algorithm by offering a new implementation. Information Sciences, 291, 115\u2013127.","journal-title":"Information Sciences"},{"key":"129_CR62","unstructured":"Michalewicz, Z. (2012). Quo Vadis, evolutionary computation? On a growing gap between theory and practice. In Proceedings of the 2012 World Congress conference on advances in computational intelligence (WCCI\u201912) (pp. 98\u2013121). Berlin: Springer."},{"key":"129_CR63","doi-asserted-by":"publisher","unstructured":"Mu\u00f1oz, A. A., & Smith-Miles, K. A. (2016). Performance analysis of continuous black-box optimization algorithms via footprints in instance space. Evolutionary Computation. doi: 10.1162\/EVCO_a_00194 .","DOI":"10.1162\/EVCO_a_00194"},{"key":"129_CR64","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.ins.2015.05.010","volume":"317","author":"MA Mu\u00f1oz","year":"2015","unstructured":"Mu\u00f1oz, M. A., Sun, Y., Kirley, M., & Halgamuge, S. K. (2015). Algorithm selection for black-box continuous optimization problems: A survey on methods and challenges. Information Sciences, 317, 224\u2013245.","journal-title":"Information Sciences"},{"issue":"4","key":"129_CR65","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J. A., & Mead, R. (1965). A simplex-method for function minimization. Computer Journal, 7(4), 308\u2013313.","journal-title":"Computer Journal"},{"issue":"1\u20132","key":"129_CR66","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10462-009-9137-2","volume":"33","author":"F Neri","year":"2010","unstructured":"Neri, F., & Tirronen, V. (2010). Recent advances in differential evolution: A survey and experimental analysis. Artificial Intelligence Review, 33(1\u20132), 61\u2013106.","journal-title":"Artificial Intelligence Review"},{"key":"129_CR67","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ins.2014.11.023","volume":"297","author":"AP Piotrowski","year":"2015","unstructured":"Piotrowski, A. P. (2015). Regarding the rankings of optimization heuristics based on artificially-constructed benchmark functions. Information Sciences, 297, 191\u2013201.","journal-title":"Information Sciences"},{"key":"129_CR68","doi-asserted-by":"publisher","unstructured":"Piotrowski, A. P. (2016). Review of differential evolution population size. Swarm and Evolutionary Computation. doi: 10.1016\/j.swevo.2016.05.003 .","DOI":"10.1016\/j.swevo.2016.05.003"},{"key":"129_CR69","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2016.08.057","volume":"373","author":"AP Piotrowski","year":"2016","unstructured":"Piotrowski, A. P., & Napiorkowski, M. J. (2016). May the same numerical optimizer be used when searching either for the best or for the worst solution to a real-world problem? Information Sciences, 373, 124\u2013148.","journal-title":"Information Sciences"},{"key":"129_CR70","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.ins.2014.01.026","volume":"267","author":"AP Piotrowski","year":"2014","unstructured":"Piotrowski, A. P., Napiorkowski, J. J., & Rowinski, P. M. (2014). How novel is the \u201cnovel\u201d black hole optimization approach? Information Sciences, 267, 191\u2013200.","journal-title":"Information Sciences"},{"key":"129_CR71","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11721-007-0002-0","volume":"1","author":"R Poli","year":"2007","unstructured":"Poli, R., Kennedy, J., & Blackwell, T. (2007). Particle swarm optimization. An overview. Swarm Intelligence, 1, 33\u201357.","journal-title":"Swarm Intelligence"},{"issue":"4","key":"129_CR72","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1162\/EVCO_a_00084","volume":"20","author":"P Po\u0161ik","year":"2012","unstructured":"Po\u0161ik, P., Huyer, W., & Pal, L. (2012). A comparison of global search algorithms for continuous black box optimization. Evolutionary Computation, 20(4), 509\u2013541.","journal-title":"Evolutionary Computation"},{"key":"129_CR73","volume-title":"Numerical recipes in FORTRAN 77: The art of scientific computing","author":"WH Press","year":"2006","unstructured":"Press, W. H., Flannery, B. P., Teukolsky, S. A., & Vetterling, W. T. (2006). Numerical recipes in FORTRAN 77: The art of scientific computing. Cambridge: Cambridge University Press."},{"key":"129_CR74","volume-title":"Differential evolution. A practical approach to global optimization","author":"KV Price","year":"2005","unstructured":"Price, K. V., Storn, R. M., & Lampinen, J. A. (2005). Differential evolution. A practical approach to global optimization. Berlin: Springer."},{"issue":"2","key":"129_CR75","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1109\/TEVC.2008.927706","volume":"13","author":"AK Qin","year":"2009","unstructured":"Qin, A. K., Huang, V. L., & Suganthan, P. N. (2009). Differential evolution algorithm with strategy adaptation for global numerical optimization. IEEE Transactions on Evolutionary Computation, 13(2), 398\u2013417.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR76","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s11721-014-0098-y","volume":"8","author":"J Rada-Vilela","year":"2014","unstructured":"Rada-Vilela, J., Johnston, M., & Zhang, M. (2014). Deception, blindness and disorientation in particle swarm optimization applied to noisy problems. Swarm Intelligence, 8, 247\u2013273.","journal-title":"Swarm Intelligence"},{"key":"129_CR77","volume-title":"Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I. (1973). Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution. Stuttgart: Frommann-Holzboog."},{"issue":"3","key":"129_CR78","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"HH Rosenbrock","year":"1960","unstructured":"Rosenbrock, H. H. (1960). An automated method for finding the greatest or least value of a function. Computer Journal, 3(3), 175\u2013184.","journal-title":"Computer Journal"},{"issue":"1","key":"129_CR79","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1162\/evco.2009.17.1.117","volume":"17","author":"JE Rowe","year":"2009","unstructured":"Rowe, J. E., Vose, M. D., & Wright, A. H. (2009). Reinterpreting no free lunch. Evolutionary Computation, 17(1), 117\u2013129.","journal-title":"Evolutionary Computation"},{"key":"129_CR80","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2016.08.001","volume":"65","author":"S Salcedo-Sanz","year":"2016","unstructured":"Salcedo-Sanz, S. (2016). Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures. Physics Reports, 65, 1\u201370.","journal-title":"Physics Reports"},{"key":"129_CR81","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0303-2647(96)01621-8","volume":"39","author":"R Salomon","year":"1996","unstructured":"Salomon, R. (1996). Re-evaluating genetic algorithm performance under coordinate rotation on benchmark functions. A survey of some theoretical and practical aspects of genetic algorithms. BioSystems, 39, 263\u2013278.","journal-title":"BioSystems"},{"key":"129_CR82","unstructured":"Schumacher, C., Vose, M. D., & Whitley, L. D. (2001). The no free lunch and problem description length. In Proceedings of the 2001 genetic and evolutionary computation conference (pp. 565\u2013570). Morgan Kaufmann."},{"issue":"395","key":"129_CR83","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1080\/01621459.1986.10478341","volume":"81","author":"JP Shaffer","year":"1986","unstructured":"Shaffer, J. P. (1986). Modified sequentially rejective multiple test procedures. Journal of the American Statistical Association, 81(395), 826\u2013831.","journal-title":"Journal of the American Statistical Association"},{"key":"129_CR84","doi-asserted-by":"crossref","unstructured":"Shi, Y., & Eberhart, R. C. (1998). A modified particle swarm optimizer. In Proceeding in IEEE Congress on Evolutionary Computation (CEC1998) (pp. 69\u201373). Institute of Electrical and Electronics Engineers (IEEE).","DOI":"10.1109\/ICEC.1998.699146"},{"key":"129_CR85","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1016\/j.ins.2010.12.006","volume":"181","author":"D Simon","year":"2011","unstructured":"Simon, D., Rarick, R., Ergezer, M., & Du, D. W. (2011). Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms. Information Sciences, 181, 1224\u20131248.","journal-title":"Information Sciences"},{"key":"129_CR86","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1111\/itor.12001","volume":"22","author":"K S\u00f6rensen","year":"2015","unstructured":"S\u00f6rensen, K. (2015). Metaheuristics\u2014The metaphor exposed. International Transactions in Operational Research, 22, 3\u201318.","journal-title":"International Transactions in Operational Research"},{"key":"129_CR87","unstructured":"S\u00f6rensen, K., Sevaux, M., & Glover, F. (2015). A history of Metaheuristics. InProceedings of ORBEL29\u201429th Belgian conference on Operations Research."},{"key":"129_CR88","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.2517-6161.1970.tb00821.x","volume":"32","author":"MA Stephens","year":"1970","unstructured":"Stephens, M. A. (1970). Use of the Kolmogorov\u2013Smirnov, Cramer\u2013von Mises and related statistics without extensive tables. Journal of the Royal Statistical Society Series B - Statistical Methodology, 32, 115\u2013122.","journal-title":"Journal of the Royal Statistical Society Series B - Statistical Methodology"},{"key":"129_CR89","unstructured":"Storn, R., & Price, K. V. (1995). Differential evolution\u2014A simple and efficient adaptive scheme for global optimization over continuous spaces. Tech. Report TR-95-012, International Computer Sciences Institute, Berkeley, California, USA."},{"issue":"4","key":"129_CR90","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., & Price, K. V. (1997). Differential evolution\u2014A simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4), 341\u2013359.","journal-title":"Journal of Global Optimization"},{"key":"129_CR91","unstructured":"Suganthan, P. N., Hansen, N., Liang, J. J., Deb, K., Chen, Y. P., Auger, A., et al. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Nanyang Technol. Univ., Singapore, Tech. Rep. KanGAL #2005005, IIT Kanpur, India."},{"key":"129_CR92","doi-asserted-by":"crossref","first-page":"1772","DOI":"10.1016\/j.patcog.2011.10.005","volume":"45","author":"A Ulas","year":"2012","unstructured":"Ulas, A., Yildiz, O. T., & Alpaydin, E. (2012). Cost-conscious comparison of supervised learning algorithms over multiple data sets. Pattern Recognition, 45, 1772\u20131781.","journal-title":"Pattern Recognition"},{"issue":"3","key":"129_CR93","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1109\/TEVC.2004.826069","volume":"8","author":"F Bergh Van den","year":"2004","unstructured":"Van den Bergh, F., & Engelbrecht, A. P. (2004). A cooperative approach to particle swarm optimization. IEEE Transactions on Evolutionary Computation, 8(3), 225\u2013239.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR94","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1016\/j.ins.2014.02.154","volume":"277","author":"N Ve\u010dek","year":"2014","unstructured":"Ve\u010dek, N., Mernik, M., & \u010crepin\u0161ek, M. (2014). A chess rating system for evolutionary algorithms: A new method for the comparison and ranking of evolutionary algorithms. Information Sciences, 277, 656\u2013679.","journal-title":"Information Sciences"},{"key":"129_CR95","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.ins.2012.10.012","volume":"223","author":"H Wang","year":"2013","unstructured":"Wang, H., Sun, H., Li, C., Rahnamayan, S., & Pan, J. S. (2013). Diversity enhanced particle swarm optimization with neighborhood search. Information Sciences, 223, 119\u2013135.","journal-title":"Information Sciences"},{"issue":"5","key":"129_CR96","doi-asserted-by":"crossref","first-page":"907","DOI":"10.1007\/s11390-012-1274-4","volume":"27","author":"T Weise","year":"2012","unstructured":"Weise, T., Chiong, R., & Tang, K. (2012). Evolutionary optimization: Pitfalls and booby traps. Journal of Computer Science and Technology, 27(5), 907\u2013936.","journal-title":"Journal of Computer Science and Technology"},{"key":"129_CR97","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4018\/jamc.2010040104","volume":"1\u20132","author":"D Weyland","year":"2010","unstructured":"Weyland, D. (2010). A rigorous analysis of the harmony search algorithm\u2014How the research community can be misled by a \u201cnovel\u201d methodology. International Journal of Applied Metaheuristic Computing, 1\u20132, 50\u201360.","journal-title":"International Journal of Applied Metaheuristic Computing"},{"key":"129_CR98","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.orp.2015.04.001","volume":"2","author":"D Weyland","year":"2015","unstructured":"Weyland, D. (2015). A critical analysis of the harmony search algorithm\u2014How not to solve sudoku. Operations Research Perspectives, 2, 97\u2013105.","journal-title":"Operations Research Perspectives"},{"key":"129_CR99","doi-asserted-by":"crossref","unstructured":"Whitley, D., & Rowe, J. (2008). Focused no free lunch theorems. In Proceedings of the 10th annual conference on genetic and evolutionary computation (pp. 811\u2013818). Association for Computing Machinery (ACM), 2008.","DOI":"10.1145\/1389095.1389254"},{"issue":"1","key":"129_CR100","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"5","key":"129_CR101","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1109\/TSMCC.2011.2160941","volume":"42","author":"B Xin","year":"2012","unstructured":"Xin, B., Chen, J., Zhang, J., Fang, H., & Peng, Z. H. (2012). Hybridizing differential evolution and particle swarm optimization to design powerful optimizers: A review and taxonomy. IEEE Transactions on Systems, Mac and Cybernetics, Part C - Applications and Reviews, 42(5), 744\u2013767.","journal-title":"IEEE Transactions on Systems, Mac and Cybernetics, Part C - Applications and Reviews"},{"key":"129_CR102","volume-title":"Innovative computational intelligence: A rough guide to 134 clever algorithms. Intelligent Systems Reference Library","author":"B Xing","year":"2014","unstructured":"Xing, B., & Gao, W. J. (2014). Innovative computational intelligence: A rough guide to 134 clever algorithms. Intelligent Systems Reference Library (Vol. 62). Berlin: Springer."},{"issue":"6","key":"129_CR103","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0002-9610(06)80059-0","volume":"159","author":"JM Yancey","year":"1990","unstructured":"Yancey, J. M. (1990). Ten rules for reading clinical research reports. The American Journal of Surgery, 159(6), 533\u2013539.","journal-title":"The American Journal of Surgery"},{"issue":"2","key":"129_CR104","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1109\/4235.771163","volume":"3","author":"X Yao","year":"1999","unstructured":"Yao, X., Liu, Y., & Li, G. (1999). Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2), 82\u2013102.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"129_CR105","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/s12293-015-0159-9","volume":"7","author":"SY Yuen","year":"2015","unstructured":"Yuen, S. Y., & Zhang, X. (2015). On composing an algorithm portfolio. Memetic Computing, 7, 203\u2013214.","journal-title":"Memetic Computing"},{"key":"129_CR106","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.swevo.2015.06.002","volume":"25","author":"I Zelinka","year":"2015","unstructured":"Zelinka, I. (2015). A survey on evolutionary algorithms dynamics and its complexity\u2014Mutual relations, past, present and future. Swarm and Evolutionary Computation, 25, 2\u201314.","journal-title":"Swarm and Evolutionary Computation"},{"key":"129_CR107","unstructured":"Zhang, Y. D., Wang, S. H., & Ji, G. L. (2015). A comprehensive survey on particle swarm optimization algorithm and its applications. Mathematical Problems in Engineering. Article ID: 931256."}],"container-title":["Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-016-0129-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11721-016-0129-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11721-016-0129-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T15:33:37Z","timestamp":1718897617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11721-016-0129-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,14]]},"references-count":107,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s11721-016-0129-y","relation":{},"ISSN":["1935-3812","1935-3820"],"issn-type":[{"value":"1935-3812","type":"print"},{"value":"1935-3820","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,14]]}}}