{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:55:24Z","timestamp":1757310924446,"version":"3.40.3"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031264375"},{"type":"electronic","value":"9783031264382"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,23]],"date-time":"2023-02-23T00:00:00Z","timestamp":1677110400000},"content-version":"vor","delay-in-days":53,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A bilevel optimization problem consists of an upper-level and a lower-level optimization problem connected to each other hierarchically. Efficient methods exist for special cases, but in general solving these problems is difficult. Bayesian optimization methods are an interesting approach that speed up search using an acquisition function, and this paper proposes a modified Bayesian approach. It treats the upper-level problem as an expensive black-box function, and uses multiple acquisition functions in a multi-objective manner by exploring the Pareto-front. Experiments on popular bilevel benchmark problems show the advantage of the method.<\/jats:p>","DOI":"10.1007\/978-3-031-26438-2_32","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T06:32:56Z","timestamp":1677047576000},"page":"409-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Bayesian Optimization with\u00a0Multi-objective Acquisition Function for\u00a0Bilevel Problems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3807-5425","authenticated-orcid":false,"given":"Vedat","family":"Dogan","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6218-9158","authenticated-orcid":false,"given":"Steven","family":"Prestwich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","unstructured":"Abo-Elnaga, Y., Nasr, S.: Modified evolutionary algorithm and chaotic search for bilevel programming problems. Symmetry 12 (2020). https:\/\/doi.org\/10.3390\/SYM12050767","DOI":"10.3390\/SYM12050767"},{"issue":"5","key":"32_CR2","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/0305-0483(83)90038-5","volume":"11","author":"JF Bard","year":"1983","unstructured":"Bard, J.F.: Coordination of a multidivisional organization through two levels of management. Omega 11(5), 457\u2013468 (1983)","journal-title":"Omega"},{"issue":"1","key":"32_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard, J.F., Falk, J.E.: An explicit solution to the multi-level programming problem. Comput. Oper. Res. 9(1), 77\u2013100 (1982). https:\/\/doi.org\/10.1016\/0305-0548(82)90007-7","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"32_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0911017","volume":"11","author":"JF Bard","year":"1990","unstructured":"Bard, J.F., Moore, J.T.: A branch and bound algorithm for the bilevel programming problem. SIAM J. Sci. Stat. Comput. 11(2), 281\u2013292 (1990). https:\/\/doi.org\/10.1137\/0911017","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"32_CR5","unstructured":"Bertinetto, L., Henriques, J.F., Torr, P., Vedaldi, A.: Meta-learning with differentiable closed-form solvers. In: International Conference on Learning Representations (2019). https:\/\/openreview.net\/forum?id=HyxnZh0ct7"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/TAC.1982.1102880","volume":"27","author":"W Bialas","year":"1982","unstructured":"Bialas, W., Karwan, M.: On two-level optimization. IEEE Trans. Autom. Control 27(1), 211\u2013214 (1982). https:\/\/doi.org\/10.1109\/TAC.1982.1102880","journal-title":"IEEE Trans. Autom. Control"},{"key":"32_CR7","unstructured":"Blank, J., Deb, K.: Pymoo: multi-objective optimization in python. CoRR abs\/2002.04504 (2020). https:\/\/arxiv.org\/abs\/2002.04504"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Bracken, J., McGill, J.T.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21(1), 37\u201344 (1973). https:\/\/www.jstor.org\/stable\/169087","DOI":"10.1287\/opre.21.1.37"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/trsc.35.4.345.10433","volume":"35","author":"L Brotcorne","year":"2001","unstructured":"Brotcorne, L., Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model for toll optimization on a multicommodity transportation network. Transp. Sci. 35, 345\u2013358 (2001). https:\/\/doi.org\/10.1287\/trsc.35.4.345.10433","journal-title":"Transp. Sci."},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1287\/opre.1050.0231","volume":"53","author":"G Brown","year":"2005","unstructured":"Brown, G., Carlyle, M., Diehl, D., Kline, J., Wood, R.: A two-sided optimization for theater ballistic missile defense. Oper. Res. 53, 745\u2013763 (2005). https:\/\/doi.org\/10.1287\/opre.1050.0231","journal-title":"Oper. Res."},{"issue":"2","key":"32_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1111\/j.1475-3995.1995.tb00011.x","volume":"2","author":"I Constantin","year":"1995","unstructured":"Constantin, I., Florian, M.: Optimizing frequencies in a transit network: a nonlinear bi-level programming approach. Int. Trans. Oper. Res. 2(2), 149\u2013164 (1995)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"32_CR13","series-title":"The Springer Series on Challenges in Machine Learning","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-05318-5_1","volume-title":"Automated Machine Learning","author":"M Feurer","year":"2019","unstructured":"Feurer, M., Hutter, F.: Hyperparameter optimization. In: Hutter, F., Kotthoff, L., Vanschoren, J. (eds.) Automated Machine Learning. TSSCML, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5_1"},{"key":"32_CR14","doi-asserted-by":"publisher","unstructured":"Fontaine, P., Minner, S.: Benders decomposition for discrete-continuous linear bilevel problems with application to traffic network design. Transp. Res. Part B: Methodol. 70(C), 163\u2013172 (2014). https:\/\/doi.org\/10.1016\/J.TRB.2014.09.007. https:\/\/ideas.repec.org\/a\/eee\/transb\/v70y2014icp163-172.html","DOI":"10.1016\/J.TRB.2014.09.007"},{"key":"32_CR15","unstructured":"Franceschi, L., Frasconi, P., Salzo, S., Grazzi, R., Pontil, M.: Bilevel programming for hyperparameter optimization and meta-learning. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 1568\u20131577. PMLR (2018). https:\/\/proceedings.mlr.press\/v80\/franceschi18a.html"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Frazier, P.: A tutorial on Bayesian optimization. arXiv abs\/1807.02811 (2018)","DOI":"10.1287\/educ.2018.0188"},{"key":"32_CR17","doi-asserted-by":"publisher","unstructured":"Hansen, P., Jaumard, B., Savard, G.: New branch-and-bound rules for bilevel linear programming. SIAM J. Sci. Stat. Comput. 13, 273 (1992). https:\/\/doi.org\/10.1137\/0913069","DOI":"10.1137\/0913069"},{"key":"32_CR18","unstructured":"Hoffman, M., Brochu, E., de Freitas, N.: Portfolio allocation for Bayesian optimization. In: Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, UAI 2011, Arlington, Virginia, USA, pp. 327\u2013336. AUAI Press (2011)"},{"key":"32_CR19","unstructured":"Hong, M., Wai, H.T., Wang, Z., Yang, Z.: A two-timescale framework for bilevel optimization: complexity analysis and application to actor-critic. arXiv abs\/2007.05170 (2020)"},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1162\/EVCOa00198","volume":"25","author":"MM Islam","year":"2017","unstructured":"Islam, M.M., Singh, H.K., Ray, T., Sinha, A.: An enhanced memetic algorithm for single-objective bilevel optimization problems. Evol. Comput. 25, 607\u2013642 (2017). https:\/\/doi.org\/10.1162\/EVCOa00198","journal-title":"Evol. Comput."},{"key":"32_CR21","unstructured":"Ji, K., Yang, J., Liang, Y.: Bilevel optimization: convergence analysis and enhanced design. In: Meila, M., Zhang, T. (eds.) Proceedings of the 38th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 139, pp. 4882\u20134892. PMLR (2021). https:\/\/proceedings.mlr.press\/v139\/ji21c.html"},{"key":"32_CR22","doi-asserted-by":"publisher","unstructured":"Johnson, M., Aghasadeghi, N., Bretl, T.: Inverse optimal control for deterministic continuous-time nonlinear systems. In: 52nd IEEE Conference on Decision and Control, pp. 2906\u20132913 (2013). https:\/\/doi.org\/10.1109\/CDC.2013.6760325","DOI":"10.1109\/CDC.2013.6760325"},{"key":"32_CR23","doi-asserted-by":"publisher","unstructured":"Kieffer, E., Danoy, G., Bouvry, P., Nagih, A.: Bayesian optimization approach of general bi-level problems. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 1614\u20131621. Association for Computing Machinery, New York (2017). https:\/\/doi.org\/10.1145\/3067695.3082537","DOI":"10.1145\/3067695.3082537"},{"issue":"1","key":"32_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1022647728419","volume":"98","author":"C Kirjner-Neto","year":"1998","unstructured":"Kirjner-Neto, C., Polak, E., Kiureghian, A.D.: An outer approximation approach to reliability-based optimal design of structures. J. Optim. Theory Appl. 98(1), 1\u201316 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"32_CR25","doi-asserted-by":"publisher","unstructured":"Koh, A.: Solving transportation bi-level programs with differential evolution. In: 2007 IEEE Congress on Evolutionary Computation, pp. 2243\u20132250 (2007). https:\/\/doi.org\/10.1109\/CEC.2007.4424750","DOI":"10.1109\/CEC.2007.4424750"},{"key":"32_CR26","unstructured":"Konda, V., Tsitsiklis, J.: Actor-critic algorithms. In: Solla, S., Leen, T., M\u00fcller, K. (eds.) Advances in Neural Information Processing Systems, vol. 12. MIT Press (1999). https:\/\/proceedings.neurips.cc\/paper\/1999\/file\/6449f44a102fde848669bdd9eb6b76fa-Paper.pdf"},{"issue":"1","key":"32_CR27","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/S10957-010-9668-3","volume":"146","author":"M Koppe","year":"2010","unstructured":"Koppe, M., Queyranne, M., Ryan, C.T.: Parametric integer programming algorithm for bilevel mixed integer programs. J. Optim. Theory Appl. 146(1), 137\u2013150 (2010). https:\/\/doi.org\/10.1007\/S10957-010-9668-3","journal-title":"J. Optim. Theory Appl."},{"key":"32_CR28","unstructured":"Kraft, D.: A software package for sequential quadratic programming. Deutsche Forschungs- und Versuchsanstalt fur Luft- und Raumfahrt Koln: Forschungsbericht, Wiss. Berichtswesen d. DFVLR (1988). https:\/\/books.google.ie\/books?id=4rKaGwAACAAJ"},{"issue":"4","key":"32_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1080\/10556780802102586","volume":"23","author":"G Kunapuli","year":"2008","unstructured":"Kunapuli, G., Bennett, K., Hu, J., Pang, J.S.: Classification model selection via bilevel programming. Optim. Methods Softw. 23(4), 475\u2013489 (2008)","journal-title":"Optim. Methods Softw."},{"key":"32_CR30","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1115\/1.3653121","volume":"86","author":"HJ Kushner","year":"1963","unstructured":"Kushner, H.J.: A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. J. Basic Eng. 86, 97\u2013106 (1963)","journal-title":"J. Basic Eng."},{"key":"32_CR31","doi-asserted-by":"publisher","unstructured":"Legillon, F., Liefooghe, A., Talbi, E.G.: Cobra: a cooperative coevolutionary algorithm for bi-level optimization. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012). https:\/\/doi.org\/10.1109\/CEC.2012.6256620","DOI":"10.1109\/CEC.2012.6256620"},{"key":"32_CR32","unstructured":"Likhosherstov, V., Song, X., Choromanski, K., Davis, J., Weller, A.: UFO-BLO: unbiased first-order bilevel optimization. arXiv abs\/2006.03631 (2020)"},{"key":"32_CR33","unstructured":"Lyu, W., Yang, F., Yan, C., Zhou, D., Zeng, X.: Batch Bayesian optimization via multi-objective acquisition ensemble for automated analog circuit design. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol. 80, pp. 3306\u20133314. PMLR (2018). https:\/\/proceedings.mlr.press\/v80\/lyu18a.html"},{"key":"32_CR34","doi-asserted-by":"crossref","unstructured":"Ma, L., Wang, G.: A solving algorithm for nonlinear bilevel programing problems based on human evolutionary model. Algorithms 13(10) (2020). https:\/\/www.mdpi.com\/1999-4893\/13\/10\/260","DOI":"10.3390\/a13100260"},{"key":"32_CR35","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF01099649","volume":"7","author":"A Migdalas","year":"1995","unstructured":"Migdalas, A.: Bilevel programming in traffic planning: models, methods and challenge. J. Glob. Optim. 7, 381\u2013405 (1995). https:\/\/doi.org\/10.1007\/BF01099649","journal-title":"J. Glob. Optim."},{"key":"32_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1007\/3-540-07165-2_55","volume-title":"Optimization Techniques 1974: Optimization Techniques IFIP Technical Conference Novosibirsk","author":"J Mo\u010dkus","year":"1975","unstructured":"Mo\u010dkus, J.: On Bayesian methods for seeking the extremum. In: Marchuk, G.I. (ed.) Optimization Techniques 1974: Optimization Techniques IFIP Technical Conference Novosibirsk. LNCS, vol. 27, pp. 400\u2013404. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07165-2_55"},{"key":"32_CR37","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10514-009-9170-7","volume":"28","author":"K Mombaur","year":"2010","unstructured":"Mombaur, K., Truong, A., Laumond, J.P.: From human to humanoid locomotion-an inverse optimal control approach. Auton. Robots 28, 369\u2013383 (2010). https:\/\/doi.org\/10.1007\/s10514-009-9170-7","journal-title":"Auton. Robots"},{"key":"32_CR38","unstructured":"Paszke, A., et al.: PyTorch: an imperative style, high-performance deep learning library. CoRR abs\/1912.01703 (2019). https:\/\/arxiv.org\/abs\/1912.01703"},{"key":"32_CR39","unstructured":"Rajeswaran, A., Finn, C., Kakade, S.M., Levine, S.: Meta-learning with implicit gradients. CoRR abs\/1909.04630 (2019). https:\/\/arxiv.org\/abs\/1909.04630"},{"key":"32_CR40","doi-asserted-by":"publisher","unstructured":"Sabach, S., Shtern, S.: A first order method for solving convex bi-level optimization problems (2017). https:\/\/doi.org\/10.48550\/ARXIV.1702.03999","DOI":"10.48550\/ARXIV.1702.03999"},{"key":"32_CR41","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0098-1354(98)00267-1","volume":"23","author":"K Sahin","year":"1998","unstructured":"Sahin, K., Ciric, A.R.: A dual temperature simulated annealing approach for solving bilevel programming problems. Comput. Chem. Eng. 23, 11\u201325 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"32_CR42","unstructured":"Shaban, A., Cheng, C.A., Hatch, N., Boots, B.: Truncated back-propagation for bilevel optimization. CoRR abs\/1810.10667 (2018). https:\/\/arxiv.org\/abs\/1810.10667"},{"key":"32_CR43","doi-asserted-by":"publisher","unstructured":"Sinha, A., Malo, P., Deb, K.: A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans. Evol. Comput. (2017). https:\/\/doi.org\/10.1109\/TEVC.2017.2712906","DOI":"10.1109\/TEVC.2017.2712906"},{"key":"32_CR44","doi-asserted-by":"publisher","unstructured":"Sinha, A., Malo, P., Deb, K.: Unconstrained scalable test problems for single-objective bilevel optimization. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012). https:\/\/doi.org\/10.1109\/CEC.2012.6256557","DOI":"10.1109\/CEC.2012.6256557"},{"key":"32_CR45","doi-asserted-by":"publisher","unstructured":"Sinha, A., Malo, P., Deb, K.: An improved bilevel evolutionary algorithm based on quadratic approximations. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 1870\u20131877 (2014). https:\/\/doi.org\/10.1109\/CEC.2014.6900391","DOI":"10.1109\/CEC.2014.6900391"},{"key":"32_CR46","doi-asserted-by":"publisher","unstructured":"Sinha, A., Malo, P., Frantsev, A., Deb, K.: Multi-objective stackelberg game between a regulating authority and a mining company: a case study in environmental economics. In: 2013 IEEE Congress on Evolutionary Computation, pp. 478\u2013485 (2013). https:\/\/doi.org\/10.1109\/CEC.2013.6557607","DOI":"10.1109\/CEC.2013.6557607"},{"key":"32_CR47","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/j.cor.2013.07.010","volume":"41","author":"A Sinha","year":"2014","unstructured":"Sinha, A., Malo, P., Frantsev, A., Deb, K.: Finding optimal strategies in a multi-period multi-leader-follower stackelberg game using an evolutionary algorithm. Comput. Oper. Res. 41, 374\u2013385 (2014)","journal-title":"Comput. Oper. Res."},{"key":"32_CR48","unstructured":"Smith, W.R., Missen, R.W.: Chemical reaction equilibrium analysis: theory and algorithms. In: Chemical Reaction Equilibrium Analysis: Theory and Algorithms (1982)"},{"issue":"5","key":"32_CR49","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/tit.2011.2182033","volume":"58","author":"N Srinivas","year":"2012","unstructured":"Srinivas, N., Krause, A., Kakade, S.M., Seeger, M.W.: Information-theoretic regret bounds for gaussian process optimization in the bandit setting. IEEE Trans. Inf. Theory 58(5), 3250\u20133265 (2012). https:\/\/doi.org\/10.1109\/tit.2011.2182033","journal-title":"IEEE Trans. Inf. Theory"},{"key":"32_CR50","unstructured":"von Stackelberg, H.: The Theory of the Market Economy. William Hodge (1952). https:\/\/books.google.ie\/books?id=fjIAtQEACAAJ"},{"issue":"4","key":"32_CR51","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.apm.2007.02.007","volume":"32","author":"H Sun","year":"2008","unstructured":"Sun, H., Gao, Z., Wu, J.: A bi-level programming model and solution algorithm for the location of logistics distribution centers. Appl. Math. Model. 32(4), 610\u2013616 (2008)","journal-title":"Appl. Math. Model."},{"key":"32_CR52","doi-asserted-by":"publisher","unstructured":"Suryan, V., Sinha, A., Malo, P., Deb, K.: Handling inverse optimal control problems using evolutionary bilevel optimization. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 1893\u20131900 (2016). https:\/\/doi.org\/10.1109\/CEC.2016.7744019","DOI":"10.1109\/CEC.2016.7744019"},{"key":"32_CR53","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-37838-6_1","volume-title":"Metaheuristics for Bi-level Optimization","author":"EG Talbi","year":"2013","unstructured":"Talbi, E.G.: A taxonomy of metaheuristics for bi-level optimization. In: Talbi, E.G. (ed.) Metaheuristics for Bi-level Optimization. SCI, vol. 482, pp. 1\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37838-6_1"},{"key":"32_CR54","doi-asserted-by":"publisher","unstructured":"Tusar, T., Filipic, B.: Demo: differential evolution for multiobjective optimization. In: Proceedings of the 3rd International Conference on Evolutionary Multi-Criterion Optimization, Guanajuato, Mexico, pp. 520\u2013533 (2005). https:\/\/doi.org\/10.1007\/978-3-540-31880-4-36","DOI":"10.1007\/978-3-540-31880-4-36"},{"issue":"6","key":"32_CR55","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712\u2013731 (2007). https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Communications in Computer and Information Science","Artificial Intelligence and Cognitive Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26438-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T06:39:26Z","timestamp":1677047966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26438-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264375","9783031264382"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26438-2_32","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Irish Conference on Artificial Intelligence and Cognitive Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munster","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aics2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aics2022.mtu.ie\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","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":"41","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":"0","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":"40% - 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":"3","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)"}}]}}