{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T14:11:25Z","timestamp":1750083085202},"publisher-location":"Cham","reference-count":73,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030374938"},{"type":"electronic","value":"9783030374945"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-37494-5_16","type":"book-chapter","created":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T10:02:38Z","timestamp":1576317758000},"page":"317-337","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Effect of Laziness on Agents for Large Scale Global Optimization"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Bremer","sequence":"first","affiliation":[]},{"given":"Sebastian","family":"Lehnhoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,15]]},"reference":[{"key":"16_CR1","unstructured":"Aggarwal, S., Goswami, P.: Implementation of Dejong function by various selection method and analyze their performance. IJRCCT 3(6) (2014). \nhttp:\/\/www.ijrcct.org\/index.php\/ojs\/article\/view\/755"},{"issue":"12","key":"16_CR2","doi-asserted-by":"publisher","first-page":"2567","DOI":"10.1080\/02331934.2013.836651","volume":"64","author":"A Ahrari","year":"2015","unstructured":"Ahrari, A., Shariat-Panahi, M.: An improved evolution strategy with adaptive population size. Optimization 64(12), 2567\u20132586 (2015). \nhttps:\/\/doi.org\/10.1080\/02331934.2013.836651","journal-title":"Optimization"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Anders, G., Hinrichs, C., Siefert, F., Behrmann, P., Reif, W., Sonnenschein, M.: On the influence of inter-agent variation on multi-agent algorithms solving a dynamic task allocation problem under uncertainty. In: Sixth IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2012), pp. 29\u201338. IEEE Computer Society, Lyon (2012). \nhttps:\/\/doi.org\/10.1109\/SASO.2012.16\n\n, (Best Paper Award)","DOI":"10.1109\/SASO.2012.16"},{"key":"16_CR4","volume-title":"Handbook of Evolutionary Computation","year":"1997","unstructured":"B\u00e4ck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation, 1st edn. IOP Publishing Ltd., Bristol (1997)","edition":"1"},{"key":"16_CR5","doi-asserted-by":"publisher","unstructured":"Bremer, J., Sonnenschein, M.: Parallel tempering for constrained many criteria optimization in dynamic virtual power plants. In: 2014 IEEE Symposium on Computational Intelligence Applications in Smart Grid (CIASG), pp. 1\u20138, December 2014. \nhttps:\/\/doi.org\/10.1109\/CIASG.2014.7011551","DOI":"10.1109\/CIASG.2014.7011551"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-31204-0_28","volume-title":"Applications of Evolutionary Computation","author":"J Bremer","year":"2016","unstructured":"Bremer, J., Lehnhoff, S.: A decentralized PSO with decoder for scheduling distributed electricity generation. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016. LNCS, vol. 9597, pp. 427\u2013442. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-31204-0_28"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Bremer, J., Lehnhoff, S.: An agent-based approach to decentralized global optimization: adapting cohda to coordinate descent. In: van den Herik, J., Rocha, A., Filipe, J. (eds.) ICAART 2017 - Proceedings of the 9th International Conference on Agents and Artificial Intelligence, vol. 1, pp. 129\u2013136. SciTePress, Science and Technology Publications, Lda., Porto (2017)","DOI":"10.5220\/0006116101290136"},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.14201\/ADCAIJ2017632944","volume":"6","author":"J\u00f6rg Bremer","year":"2017","unstructured":"Bremer, J., Lehnhoff, S.: Decentralized coalition formation with agent-based combinatorial heuristics. ADCAIJ: Adv. Distrib. Comput. Artif. Intell. J. 6(3) (2017). \nhttp:\/\/revistas.usal.es\/index.php\/2255-2863\/article\/view\/ADCAIJ2017632944","journal-title":"ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-319-55849-3_23","volume-title":"Applications of Evolutionary Computation","author":"J Bremer","year":"2017","unstructured":"Bremer, J., Lehnhoff, S.: Hybrid multi-ensemble scheduling. In: Squillero, G., Sim, K. (eds.) EvoApplications 2017. LNCS, vol. 10199, pp. 342\u2013358. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-55849-3_23"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-77538-8_16","volume-title":"Applications of Evolutionary Computation","author":"J Bremer","year":"2018","unstructured":"Bremer, J., Lehnhoff, S.: Phase-space sampling of energy ensembles with CMA-ES. In: Sim, K., Kaufmann, P. (eds.) EvoApplications 2018. LNCS, vol. 10784, pp. 222\u2013230. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77538-8_16"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Bremer, J., Lehnhoff, S.: Lazy agents for large scale global optimization. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence. SciTePress, January 2019","DOI":"10.5220\/0007571600720079"},{"key":"16_CR12","unstructured":"Bremer, J., Sonnenschein, M.: Automatic reconstruction of performance indicators from support vector based search space models in distributed real power planning scenarios. In: Horbach, M. (ed.) Informatik 2013, 43. Jahrestagung der Gesellschaft f\u00fcr Informatik e.V. (GI), Informatik angepasst an Mensch, Organisation und Umwelt. LNI, Koblenz, 16\u201320 September 2013, vol. 220, pp. 1441\u20131454. GI (2013)"},{"key":"16_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-662-44440-5_14","volume-title":"Agents and Artificial Intelligence","author":"J Bremer","year":"2014","unstructured":"Bremer, J., Sonnenschein, M.: Constraint-handling with support vector decoders. In: Filipe, J., Fred, A. (eds.) ICAART 2013. CCIS, vol. 449, pp. 228\u2013244. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-662-44440-5_14"},{"issue":"4","key":"16_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1093\/comjnl\/14.4.422","volume":"14","author":"RP Brent","year":"1971","unstructured":"Brent, R.P.: An algorithm with guaranteed convergence for finding a zero of a function. Comput. J. 14(4), 422\u2013425 (1971)","journal-title":"Comput. J."},{"key":"16_CR15","volume-title":"Algorithms for Minimization Without Derivatives: Dover Books on Mathematics","author":"R Brent","year":"1973","unstructured":"Brent, R.: Algorithms for Minimization Without Derivatives: Dover Books on Mathematics. Dover Publications, Mineola (1973). \nhttps:\/\/books.google.de\/books?id=6Ay2biHG-GEC"},{"key":"16_CR16","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V., et al.: Distributed optimization by ant colonies. In: Proceedings of the First European Conference on Artificial Life, Paris, France, vol. 142, pp. 134\u2013142 (1991)"},{"key":"16_CR17","unstructured":"Dekker, T.: Finding a zero by means of successive linear interpolation. In: Constructive Aspects of the Fundamental Theorem of Algebra, pp. 37\u201351 (1969)"},{"key":"16_CR18","unstructured":"Dethlefs, T., Beewen, D., Preisler, T., Renz, W.: A consumer-orientated architecture for distributed demand-side-optimization. In: EnviroInfo, pp. 349\u2013356. BIS-Verlag (2014)"},{"key":"16_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company, Scituate (2004)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Gano, S.E., Kim, H., Brown II, D.E.: Comparison of three surrogate modeling techniques: datascape, kriging, and second order regression. In: Proceedings of the 11th AIAA\/ISSMO Multidisciplinary Analysis and Optimization Conference, AIAA 2006, Portsmouth, Virginia, p. 7048 (2006)","DOI":"10.2514\/6.2006-7048"},{"issue":"3","key":"16_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF01396702","volume":"34","author":"E Hansen","year":"1980","unstructured":"Hansen, E.: Global optimization using interval analysis - the multi-dimensional case. Numer. Math. 34(3), 247\u2013270 (1980). \nhttps:\/\/doi.org\/10.1007\/BF01396702","journal-title":"Numer. Math."},{"key":"16_CR22","series-title":"Studies in Fuzziness and Soft Computing","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-32494-1_4","volume-title":"Towards a New Evolutionary Computation","author":"N Hansen","year":"2006","unstructured":"Hansen, N.: The CMA evolution strategy: a comparing review. In: Lozano, J.A., Larranaga, P., Inza, I., Bengoetxea, E. (eds.) Towards a New Evolutionary Computation. STUDFUZZ, vol. 192, pp. 75\u2013102. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/3-540-32494-1_4"},{"key":"16_CR23","unstructured":"Hansen, N.: The CMA evolution strategy: a tutorial. Technical report (2011). \nwww.lri.fr\/~hansen\/cmatutorial.pdf"},{"issue":"2","key":"16_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1162\/106365601750190398","volume":"9","author":"N Hansen","year":"2001","unstructured":"Hansen, N., Ostermeier, A.: Completely derandomized self-adaptation in evolution strategies. Evol. Comput. 9(2), 159\u2013195 (2001). \nhttps:\/\/doi.org\/10.1162\/106365601750190398","journal-title":"Evol. Comput."},{"issue":"3","key":"16_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF01581203","volume":"55","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., Lu, S.H.: Global optimization of univariate lipschitz functions II: new algorithms and computational comparison. Math. Program. 55(3), 273\u2013292 (1992). \nhttps:\/\/doi.org\/10.1007\/BF01581203","journal-title":"Math. Program."},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Hinrichs, C., Bremer, J., Martens, S., Sonnenschein, M.: Partitioning the data domain of combinatorial problems for sequential optimization. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) 9th International Workshop on Computational Optimization, Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, Gdansk (2016)","DOI":"10.15439\/2016F19"},{"key":"16_CR27","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-00795-3_43","volume-title":"Operations Research Proceedings 2012","author":"C Hinrichs","year":"2014","unstructured":"Hinrichs, C., Lehnhoff, S., Sonnenschein, M.: A decentralized heuristic for multiple-choice combinatorial optimization problems. In: Helber, S., et al. (eds.) Operations Research Proceedings 2012. ORP, pp. 297\u2013302. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-00795-3_43"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-319-11584-9_12","volume-title":"Multiagent System Technologies","author":"C Hinrichs","year":"2014","unstructured":"Hinrichs, C., Sonnenschein, M.: The effects of variation on solving a combinatorial optimization problem in collaborative multi-agent systems. In: M\u00fcller, J.P., Weyrich, M., Bazzan, A.L.C. (eds.) MATES 2014. LNCS (LNAI), vol. 8732, pp. 170\u2013187. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-11584-9_12"},{"key":"16_CR29","series-title":"Progress in IS","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-23455-7_8","volume-title":"Advances and New Trends in Environmental and Energy Informatics","author":"C Hinrichs","year":"2016","unstructured":"Hinrichs, C., Sonnenschein, M.: Design, analysis and evaluation of control algorithms for applications in smart grids. In: G\u00f3mez, J.M., Sonnenschein, M., Vogel, U., Winter, A., Rapp, B., Giesen, N. (eds.) Advances and New Trends in Environmental and Energy Informatics. PI, pp. 135\u2013155. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23455-7_8"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1504\/IJBIC.2017.085895","volume":"10","author":"C Hinrichs","year":"2017","unstructured":"Hinrichs, C., Sonnenschein, M.: A distributed combinatorial optimisation heuristic for the scheduling of energy resources represented by self-interested agents. Int. J. Bio-Inspired Comput. 10, 69 (2017). \nhttps:\/\/doi.org\/10.1504\/IJBIC.2017.085895","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"16_CR31","doi-asserted-by":"publisher","unstructured":"Hinrichs, C., Sonnenschein, M., Lehnhoff, S.: Evaluation of a self-organizing heuristic for interdependent distributed search spaces. In: Filipe, J., Fred, A.L.N. (eds.) International Conference on Agents and Artificial Intelligence (ICAART 2013), vol. Volume 1 - Agents, pp. 25\u201334. SciTePress (2013). \nhttps:\/\/doi.org\/10.5220\/0004227000250034","DOI":"10.5220\/0004227000250034"},{"key":"16_CR32","unstructured":"Hinrichs, C., Vogel, U., Sonnenschein, M.: Approaching decentralized demand side management via self-organizing agents. In: ATES Workshop (2011)"},{"volume-title":"Handbook of Global Optimization","year":"1995","key":"16_CR33","unstructured":"Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"16_CR34","unstructured":"Jamil, M., Yang, X.: A literature survey of benchmark functions for global optimization problems. CoRR abs\/1308.4008 (2013)"},{"key":"16_CR35","doi-asserted-by":"publisher","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: 1995 Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942\u20131948. IEEE, November 1995. \nhttps:\/\/doi.org\/10.1109\/ICNN.1995.488968","DOI":"10.1109\/ICNN.1995.488968"},{"key":"16_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2010\/185063","volume":"2010","author":"O Kramer","year":"2010","unstructured":"Kramer, O.: A review of constraint-handling techniques for evolution strategies. Appl. Comp. Intell. Soft Comput. 2010, 1\u201319 (2010). \nhttps:\/\/doi.org\/10.1155\/2010\/185063","journal-title":"Appl. Comp. Intell. Soft Comput."},{"issue":"5","key":"16_CR37","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/72.623217","volume":"8","author":"Y Leung","year":"1997","unstructured":"Leung, Y., Gao, Y., Xu, Z.B.: Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov chain analysis. IEEE Trans. Neural Netw. 8(5), 1165\u20131176 (1997). \nhttps:\/\/doi.org\/10.1109\/72.623217","journal-title":"IEEE Trans. Neural Netw."},{"key":"16_CR38","unstructured":"Li, X., Tang, K., Omidvar, M.N., Yang, Z., Qin, K.: Benchmark functions for the CEC 2013 special session and competition on large-scale global optimization. Techical report (2013)"},{"issue":"5","key":"16_CR39","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.parco.2008.12.009","volume":"35","author":"Y Li","year":"2009","unstructured":"Li, Y., Mascagni, M., Gorin, A.: A decentralized parallel implementation for parallel tempering algorithm. Parallel Comput. 35(5), 269\u2013283 (2009)","journal-title":"Parallel Comput."},{"issue":"2","key":"16_CR40","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1021956306041","volume":"25","author":"M Locatelli","year":"2003","unstructured":"Locatelli, M.: A note on the Griewank test function. J. Glob. Optim. 25(2), 169\u2013174 (2003). \nhttps:\/\/doi.org\/10.1023\/A:1021956306041","journal-title":"J. Glob. Optim."},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Loshchilov, I., Schoenauer, M., Sebag, M.: Self-adaptive surrogate-assisted covariance matrix adaptation evolution strategy. CoRR abs\/1204.2356 (2012)","DOI":"10.1145\/2330163.2330210"},{"key":"16_CR42","volume-title":"Response Surface Methodology: Process and Product Optimization Using Designed Experiments","author":"RH Myers","year":"2016","unstructured":"Myers, R.H., Montgomery, D.C., Anderson-Cook, C.M.: Response Surface Methodology: Process and Product Optimization Using Designed Experiments. Wiley, Hoboken (2016)"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-27430-0_6","volume-title":"Data Analytics for Renewable Energy Integration","author":"J Neugebauer","year":"2015","unstructured":"Neugebauer, J., Kramer, O., Sonnenschein, M.: Classification cascades of overlapping feature ensembles for energy time series data. In: Woon, W.L., Aung, Z., Madnick, S. (eds.) DARE 2015. LNCS (LNAI), vol. 9518, pp. 76\u201393. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27430-0_6"},{"key":"16_CR44","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1017\/S0962492904000194","volume":"13","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A.: Complete search in continuous global optimization and constraint satisfaction. Acta Numer. 13, 271\u2013369 (2004). \nhttps:\/\/doi.org\/10.1017\/S0962492904000194","journal-title":"Acta Numer."},{"key":"16_CR45","unstructured":"Nie\u00dfe, A.: Verteilte kontinuierliche Einsatzplanung in Dynamischen Virtuellen Kraftwerken. Ph.D. thesis (2015)"},{"key":"16_CR46","doi-asserted-by":"publisher","unstructured":"Nie\u00dfe, A., Beer, S., Bremer, J., Hinrichs, C., L\u00fcnsdorf, O., Sonnenschein, M.: Conjoint dynamic aggregation and scheduling methods for dynamic virtual power plants. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Proceedings of the 2014 Federated Conference on Computer Science and Information Systems. Annals of Computer Science and Information Systems, vol. 2, pp. 1505\u20131514. IEEE (2014). \nhttps:\/\/doi.org\/10.15439\/2014F76","DOI":"10.15439\/2014F76"},{"key":"16_CR47","doi-asserted-by":"publisher","unstructured":"Nie\u00dfe, A., Bremer, J., Hinrichs, C., Sonnenschein, M.: Local soft constraints in distributed energy scheduling. In: Proceedings of the 2016 Federated Conference on Computer Science and Information Systems (FEDCSIS), pp. 1517\u20131525. IEEE (2016). \nhttps:\/\/doi.org\/10.15439\/2016F76","DOI":"10.15439\/2016F76"},{"key":"16_CR48","doi-asserted-by":"crossref","unstructured":"Nie\u00dfe, A., Bremer, J., Lehnhoff, S.: On local minima in distributed energy scheduling. In: Ganzha, M., Maciaszek, L.A., Paprzycki, M. (eds.) Position Papers of the 2017 Federated Conference on Computer Science and Information Systems, FedCSIS 2017, Prague, Czech Republic, 3\u20136 September 2017. Annals of Computer Science and Information Systems, vol. 12 (2017)","DOI":"10.15439\/2017F544"},{"key":"16_CR49","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/B978-0-12-528550-6.50017-X","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"1970","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative solution of nonlinear equations in several variables (1970)"},{"key":"16_CR50","first-page":"2010","volume":"6","author":"M Othman","year":"2015","unstructured":"Othman, M., Hegazy, Y., Abdelaziz, A.: A review of virtual power plant definitions, components, framework and optimization. Int. Electr. Eng. J. (IEEJ) 6, 2010\u20132024 (2015)","journal-title":"Int. Electr. Eng. J. (IEEJ)"},{"key":"16_CR51","doi-asserted-by":"publisher","unstructured":"Pampara, G., Engelbrecht, A.P., Cloete, T.: Cilib: a collaborative framework for computational intelligence algorithms - part I. In: 2008 IEEE International Joint Conference on Neural Networks. IEEE World Congress on Computational Intelligence, pp. 1750\u20131757, June 2008. \nhttps:\/\/doi.org\/10.1109\/IJCNN.2008.4634035","DOI":"10.1109\/IJCNN.2008.4634035"},{"key":"16_CR52","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","volume":"53","author":"S Rahnamayan","year":"2007","unstructured":"Rahnamayan, S., Tizhoosh, H., Salama, M.: A novel population initialization method for accelerating evolutionary algorithms. Comput. Math. Appl. 53, 1605\u20131614 (2007). \nhttps:\/\/doi.org\/10.1016\/j.camwa.2006.07.013","journal-title":"Comput. Math. Appl."},{"issue":"10","key":"16_CR53","doi-asserted-by":"publisher","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","volume":"53","author":"S Rahnamayan","year":"2007","unstructured":"Rahnamayan, S., Tizhoosh, H.R., Salama, M.M.: A novel population initialization method for accelerating evolutionary algorithms. Comput. Math. Appl. 53(10), 1605\u20131614 (2007). \nhttps:\/\/doi.org\/10.1016\/j.camwa.2006.07.013\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0898122107001344","journal-title":"Comput. Math. Appl."},{"key":"16_CR54","unstructured":"Rechenberg, I.: Cybernetic solution path of an experimental problem. Technical report, Royal Air Force Establishment (1965)"},{"key":"16_CR55","unstructured":"Rigling, B.D., Moore, F.W.: Exploitation of sub-populations in evolution strategies for improved numerical optimization, vol. 1001, p. 48105, Ann Arbor (1999)"},{"issue":"3","key":"16_CR56","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Glob. Optim. 56(3), 1247\u20131293 (2013). \nhttps:\/\/doi.org\/10.1007\/s10898-012-9951-y","journal-title":"J. Glob. Optim."},{"issue":"3","key":"16_CR57","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1093\/comjnl\/3.3.175","volume":"3","author":"HH Rosenbrock","year":"1960","unstructured":"Rosenbrock, H.H.: An automatic method for finding the greatest or least value of a function. Comput. J. 3(3), 175\u2013184 (1960). \nhttps:\/\/doi.org\/10.1093\/comjnl\/3.3.175","journal-title":"Comput. J."},{"issue":"4","key":"16_CR58","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1109\/4235.942534","volume":"5","author":"G Rudolph","year":"2001","unstructured":"Rudolph, G.: Self-adaptive mutations may lead to premature convergence. IEEE Trans. Evol. Comput. 5(4), 410\u2013414 (2001). \nhttps:\/\/doi.org\/10.1109\/4235.942534","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"16_CR59","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1162\/106365606776022733","volume":"14","author":"YW Shang","year":"2006","unstructured":"Shang, Y.W., Qiu, Y.H.: A note on the extended rosenbrock function. Evol. Comput. 14(1), 119\u2013126 (2006). \nhttps:\/\/doi.org\/10.1162\/106365606776022733","journal-title":"Evol. Comput."},{"key":"16_CR60","volume-title":"Evolutionary Optimization Algorithms","author":"D Simon","year":"2013","unstructured":"Simon, D.: Evolutionary Optimization Algorithms. Wiley, Hoboken (2013)"},{"issue":"1","key":"16_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01197554","volume":"14","author":"J Sobieszczanski-Sobieski","year":"1997","unstructured":"Sobieszczanski-Sobieski, J., Haftka, R.T.: Multidisciplinary aerospace design optimization: survey of recent developments. Struct. Optim. 14(1), 1\u201323 (1997). \nhttps:\/\/doi.org\/10.1007\/BF01197554","journal-title":"Struct. Optim."},{"key":"16_CR62","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.eiar.2014.08.004","volume":"52","author":"M Sonnenschein","year":"2015","unstructured":"Sonnenschein, M., L\u00fcnsdorf, O., Bremer, J., Tr\u00f6schel, M.: Decentralized control of units in smart grids for the support of renewable energy supply. Environ. Impact Assess. Rev. 52, 40\u201352 (2015)","journal-title":"Environ. Impact Assess. Rev."},{"issue":"4","key":"16_CR63","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 11(4), 341\u2013359 (1997). \nhttps:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J. Glob. Optim."},{"key":"16_CR64","series-title":"Wiley Series on Parallel and Distributed Computing","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E Talbi","year":"2009","unstructured":"Talbi, E.: Metaheuristics: From Design to Implementation. Wiley Series on Parallel and Distributed Computing. Wiley, Hoboken (2009). \nhttps:\/\/books.google.de\/books?id=SIsa6zi5XV8C"},{"key":"16_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-50871-6_1","volume-title":"Global Optimization","author":"A T\u00f6rn","year":"1989","unstructured":"T\u00f6rn, A., \u017dilinskas, A.: Introduction. In: T\u00f6rn, A., \u017dilinskas, A. (eds.) Global Optimization. LNCS, vol. 350, pp. 1\u201324. Springer, Heidelberg (1989). \nhttps:\/\/doi.org\/10.1007\/3-540-50871-6_1"},{"issue":"6","key":"16_CR66","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0020-0190(02)00447-7","volume":"85","author":"IC Trelea","year":"2003","unstructured":"Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Inf. Process. Lett. 85(6), 317\u2013325 (2003). \nhttps:\/\/doi.org\/10.1016\/S0020-0190(02)00447-7","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"16_CR67","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/moor.10.3.498","volume":"10","author":"H Tuy","year":"1985","unstructured":"Tuy, H., Thieu, T., Thai, N.: A conical algorithm for globally minimizing a concave function over a closed convex set. Math. Oper. Res. 10(3), 498\u2013514 (1985). \nhttps:\/\/doi.org\/10.1287\/moor.10.3.498","journal-title":"Math. Oper. Res."},{"key":"16_CR68","unstructured":"Ulmer, H., Streichert, F., Zell, A.: Evolution strategies assisted by Gaussian processes with improved pre-selection criterion. In: IEEE Congress on Evolutionary Computation, CEC 2003, pp. 692\u2013699 (2003)"},{"issue":"2","key":"16_CR69","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s00354-010-0102-z","volume":"29","author":"L Vanneschi","year":"2011","unstructured":"Vanneschi, L., Codecasa, D., Mauri, G.: A comparative study of four parallel and distributed pso methods. New Gener. Comput. 29(2), 129\u2013161 (2011)","journal-title":"New Gener. Comput."},{"key":"16_CR70","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"D Watts","year":"1998","unstructured":"Watts, D., Strogatz, S.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"5","key":"16_CR71","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1007\/s11390-012-1274-4","volume":"27","author":"T Weise","year":"2012","unstructured":"Weise, T., Chiong, R., Tang, K.: Evolutionary optimization: Pitfalls and booby traps. J. Comput. Sci. Technol. 27(5), 907\u2013936 (2012). \nhttps:\/\/doi.org\/10.1007\/s11390-012-1274-4","journal-title":"J. Comput. Sci. Technol."},{"key":"16_CR72","unstructured":"Wipke, K., Markel, T., Nelson, D.: Optimizing energy management strategy and degree of hybridization for a hydrogen fuel cell SUV. In: Proceedings of 18th Electric Vehicle Symposium, pp. 1\u201312 (2001)"},{"issue":"1","key":"16_CR73","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015). \nhttps:\/\/doi.org\/10.1007\/s10107-015-0892-3","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Agents and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37494-5_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,14]],"date-time":"2019-12-14T10:05:25Z","timestamp":1576317925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37494-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374938","9783030374945"],"references-count":73,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37494-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAART","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Agents and Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaart2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaart.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"202","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"66","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36 poster papers were also accepted. 17 of the 46 accepted full papers are included in LNAI 11978.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}