{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:22:43Z","timestamp":1776284563837,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T00:00:00Z","timestamp":1569024000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T00:00:00Z","timestamp":1569024000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00500-019-04337-0","type":"journal-article","created":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T05:02:30Z","timestamp":1569042150000},"page":"7211-7229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A co-evolutionary hybrid decomposition-based algorithm for bi-level combinatorial optimization problems"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0283-6111","authenticated-orcid":false,"given":"Abir","family":"Chaabani","sequence":"first","affiliation":[]},{"given":"Slim","family":"Bechikh","sequence":"additional","affiliation":[]},{"given":"Lamjed","family":"Ben Said","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,21]]},"reference":[{"issue":"1","key":"4337_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s11228-016-0369-4","volume":"25","author":"A Aboussoror","year":"2017","unstructured":"Aboussoror A, Adly S, Saissi FE (2017) Strong-weak nonlinear bilevel problems: existence of solutions in a sequential setting. Set-Valued Var Anal 25(1):113\u2013132","journal-title":"Set-Valued Var Anal"},{"issue":"12","key":"4337_CR2","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","volume":"29","author":"E Aiyoshi","year":"1984","unstructured":"Aiyoshi E, Shimizu K (1984) A solution method for the static constrained stackelberg problem via penalty method. IEEE Trans Autom Control 29(12):1111\u20131114","journal-title":"IEEE Trans Autom Control"},{"issue":"5","key":"4337_CR3","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1111\/itor.12268","volume":"24","author":"E Alekseeva","year":"2017","unstructured":"Alekseeva E, Kochetov Y, Talbi E-G (2017) A matheuristic for the discrete bilevel problem with multiple objectives at the lower level. Int Trans Oper Res 24(5):959\u2013981","journal-title":"Int Trans Oper Res"},{"key":"4337_CR4","doi-asserted-by":"crossref","unstructured":"Angelo JS, Krempser E, Barbosa HJ (2013) Differential evolution for bilevel programming. In: IEEE congress on evolutionary computation, pp 470\u2013477","DOI":"10.1109\/CEC.2013.6557606"},{"key":"4337_CR5","doi-asserted-by":"crossref","unstructured":"Angelo JS, Krempser E, Barbosa HJ (2014) Differential evolution assisted by a surrogate model for bilevel programming problems. In: IEEE congress on evolutionary computation, pp 1784\u20131791","DOI":"10.1109\/CEC.2014.6900529"},{"issue":"3","key":"4337_CR6","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TEVC.2014.2339823","volume":"19","author":"M Asafuddoula","year":"2015","unstructured":"Asafuddoula M, Ray T, Sarker R (2015) A decomposition based evolutionary algorithm for many objective optimization. IEEE Trans Evol Comput 19(3):445\u2013460","journal-title":"IEEE Trans Evol Comput"},{"key":"4337_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.eswa.2017.11.039","volume":"95","author":"SA Bagloee","year":"2018","unstructured":"Bagloee SA, Asadi M, Sarvi M, Patriksson M (2018) A hybrid machine-learning and optimization method to solve bi-level problems. Expert Syst Appl 95:142\u2013152","journal-title":"Expert Syst Appl"},{"issue":"1","key":"4337_CR8","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard JF, Falk JE (1982) An explicit solution to the multi-level programming problem. Comput Oper Res 9(1):77\u2013100","journal-title":"Comput Oper Res"},{"issue":"5","key":"4337_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/0305-0548(93)90013-9","volume":"20","author":"O Ben-Ayed","year":"1993","unstructured":"Ben-Ayed O (1993) Bilevel linear programming. Comput Oper Res 20(5):485\u2013501","journal-title":"Comput Oper Res"},{"key":"4337_CR10","volume-title":"A parametric complementary pivot approach for two-level linear programming","author":"W Bialas","year":"1980","unstructured":"Bialas W, Karwan M, Shaw J (1980) A parametric complementary pivot approach for two-level linear programming. State University of New York, Buffalo"},{"issue":"1","key":"4337_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/opre.21.1.37","volume":"21","author":"J Bracken","year":"1973","unstructured":"Bracken J, McGill JT (1973) Mathematical programs with optimization problems in the constraints. Oper Res 21(1):37\u201344","journal-title":"Oper Res"},{"issue":"1","key":"4337_CR12","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.cor.2010.05.007","volume":"38","author":"HI Calvete","year":"2011","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros M-J (2011) Bilevel model for production\u2013distribution planning solved by using ant colony optimization. Comput Oper Res 38(1):320\u2013327","journal-title":"Comput Oper Res"},{"key":"4337_CR13","first-page":"138","volume-title":"A hybrid algorithm for solving a bilevel production\u2013distribution planning problem","author":"HI Calvete","year":"2013","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros M-J (2013) A hybrid algorithm for solving a bilevel production\u2013distribution planning problem. Springer, Berlin, pp 138\u2013144"},{"key":"4337_CR14","volume-title":"Multi-level programming and development policy","author":"W Candler","year":"1977","unstructured":"Candler W, Norton R (1977) Multi-level programming and development policy. The World Bank, Geneva"},{"key":"4337_CR15","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1007\/s11590-015-0918-z","volume":"10","author":"M Caramia","year":"2016","unstructured":"Caramia M, Mari R (2016) A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints. Optim Lett 10:997\u20131019","journal-title":"Optim Lett"},{"key":"4337_CR16","first-page":"369","volume":"319","author":"MS Casas-Ramirez","year":"2018","unstructured":"Casas-Ramirez MS, Camacho-Vallejo JF, Mart\u00c3nez-Salazar IA (2018) Approximating solutions to a bilevel capacitated facility location problem with customer\u2019s patronization toward a list of preferences. Appl Math Comput 319:369\u2013386","journal-title":"Appl Math Comput"},{"issue":"9","key":"4337_CR17","doi-asserted-by":"crossref","first-page":"2847","DOI":"10.1007\/s10489-017-1115-9","volume":"48","author":"A Chaabani","year":"2019","unstructured":"Chaabani A, Ben Said L (2019) Transfer of learning with the co-evolutionary decomposition-based algorithm-II: a realization on the bi-level production\u2013distribution planning system. Appl Intell 48(9):2847\u20132872","journal-title":"Appl Intell"},{"key":"4337_CR18","unstructured":"Chaabani A, Bechikh S, Ben Said L (2015) A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In; Congress on evolutionary computation (CEC), pp 1659\u20131666"},{"key":"4337_CR19","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Said LB (2017) A co-evolutionary decomposition-based chemical reaction algorithm for bi-level combinatorial optimization problems. Proced Comput Sci 112:780\u2013789","DOI":"10.1016\/j.procs.2017.08.167"},{"issue":"9","key":"4337_CR20","doi-asserted-by":"crossref","first-page":"2847","DOI":"10.1007\/s10489-017-1115-9","volume":"48","author":"A Chaabani","year":"2018","unstructured":"Chaabani A, Bechikh S, Ben Said L (2018) A new co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. Appl Intell 48(9):2847\u20132872","journal-title":"Appl Intell"},{"issue":"1","key":"4337_CR21","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0098-1354(90)87007-C","volume":"14","author":"PA Clark","year":"1990","unstructured":"Clark PA, Westerberg AW (1990) Bilevel programming for steady-state chemical process design-I. Fundamentals and algorithms. Comput Chem Eng 14(1):87\u201397","journal-title":"Comput Chem Eng"},{"issue":"1","key":"4337_CR22","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153(1):235\u2013256","journal-title":"Ann Oper Res"},{"issue":"2","key":"4337_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J-F Cordeau","year":"1997","unstructured":"Cordeau J-F, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105\u2013119","journal-title":"Networks"},{"issue":"3","key":"4337_CR24","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/S1052623496307510","volume":"8","author":"I Das","year":"1998","unstructured":"Das I, Dennis JE (1998) Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J Optim 8(3):631\u2013657","journal-title":"SIAM J Optim"},{"issue":"3","key":"4337_CR25","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/s10489-015-0659-9","volume":"43","author":"LN de Barros","year":"2015","unstructured":"de Barros LN, Pinheiro WR, Delgado KV (2015) Learning to program using hierarchical model-based debugging. Appl Intell 43(3):544\u2013563","journal-title":"Appl Intell"},{"key":"4337_CR26","unstructured":"Dempe S (2018) Bilevel optimization: theory, algorithms and applications. TU Bergakademie Freiberg, Fakult\u00e4t f\u00fcr Mathematik und Informatik. ISSN 2512\u20133750"},{"key":"4337_CR27","doi-asserted-by":"crossref","unstructured":"Dempe S, Kalashnikov VV, Kalashnykova N (2006) Optimality conditions for bilevel programming problems. In: Optimization with multivalued mappings. Springer, pp 3\u201328","DOI":"10.1007\/0-387-34221-4_1"},{"issue":"1","key":"4337_CR28","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"4337_CR29","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10957-006-9136-2","volume":"131","author":"J Fliege","year":"2006","unstructured":"Fliege J, Vicente LN (2006) Multicriteria approach to bilevel optimization. J Optim Theory Appl 131(2):209\u2013225","journal-title":"J Optim Theory Appl"},{"key":"4337_CR30","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1057\/jors.1981.156","volume":"32","author":"J Fortuny-Amat","year":"1980","unstructured":"Fortuny-Amat J, McCarl B (1980) A representation and economic interpretation of a two-level programming problem. J Oper Res Soc 32:783\u2013792","journal-title":"J Oper Res Soc"},{"issue":"1","key":"4337_CR31","first-page":"109","volume":"30","author":"A Friedlander","year":"2011","unstructured":"Friedlander A, Gomes FA (2011) Solution of a truss topology bilevel programming problem by means of an inexact restoration method. Comput Appl Math 30(1):109\u2013125","journal-title":"Comput Appl Math"},{"issue":"3","key":"4337_CR32","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"issue":"2","key":"4337_CR33","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1109\/TEVC.2018.2849000","volume":"23","author":"X He","year":"2018","unstructured":"He X, Zhou Y, Chen Z (2018) Evolutionary bilevel optimization based on covariance matrix adaptation. IEEE Trans Evol Comput 23(2):258\u2013272","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"4337_CR34","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1162\/evco_a_00198","volume":"25","author":"MM Islam","year":"2017","unstructured":"Islam MM, Singh HK, Ray T, Sinha A (2017a) An enhanced memetic algorithm for single-objective bilevel optimization problems. Evol Comput 25(4):607\u2013642","journal-title":"Evol Comput"},{"issue":"5","key":"4337_CR35","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TEVC.2017.2670659","volume":"21","author":"MM Islam","year":"2017","unstructured":"Islam MM, Singh HK, Ray T (2017b) A surrogate assisted approach for single-objective bilevel optimization. IEEE Trans Evol Comput 21(5):681\u2013696","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4337_CR36","first-page":"1","volume":"11","author":"MM Islam","year":"2018","unstructured":"Islam MM, Singh HK, Ray T (2018) Efficient global optimization for solving computationally expensive bilevel optimization problems. IEEE Congr Evol Comput (CEC) 11(1):1\u20138","journal-title":"IEEE Congr Evol Comput (CEC)"},{"issue":"2","key":"4337_CR37","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"RG Jeroslow","year":"1985","unstructured":"Jeroslow RG (1985) The polynomial hierarchy and a simple model for competitive analysis. Math Program 32(2):146\u2013164","journal-title":"Math Program"},{"key":"4337_CR38","volume-title":"A review of the literature on bi-level mathematical programming","author":"CD Kolstad","year":"1985","unstructured":"Kolstad CD (1985) A review of the literature on bi-level mathematical programming. Los Alamos National Laboratory, Los Alamos"},{"key":"4337_CR39","doi-asserted-by":"crossref","unstructured":"Kuhn H, Tucker A (1951) Non linear programming. In: Proceedings of the second Berkeley symposium on mathematical statistics and probability, Berkeley, University of California, pp 481\u2013492","DOI":"10.1525\/9780520411586-036"},{"key":"4337_CR40","doi-asserted-by":"crossref","unstructured":"Legillon F, Liefooghe A, Talbi E-G (2012) Cobra: a cooperative coevolutionary algorithm for bi-level optimization. In: 2012 IEEE congress on evolutionary computation, pp 1\u20138","DOI":"10.1109\/CEC.2012.6256620"},{"key":"4337_CR41","doi-asserted-by":"crossref","unstructured":"Lei L, Guang-Nian X, Chen-Xin L (2010) Research on problems bilevel programming for personnel allocation in enterprise. In: 2010 international conference on management science and engineering (ICMSE). IEEE, pp 293\u2013298","DOI":"10.1109\/ICMSE.2010.5719819"},{"key":"4337_CR42","first-page":"1","volume":"99","author":"K Li","year":"2014","unstructured":"Li K, Deb K, Zhang Q, Kwong S (2014) Combining dominance and decomposition in evolutionary many-objective optimization. IEEE Trans Evol Comput 99:1\u201323","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"4337_CR43","doi-asserted-by":"crossref","first-page":"725","DOI":"10.2991\/ijcis.11.1.56","volume":"11","author":"J Liu","year":"2018","unstructured":"Liu J, Fan Y, Chen Z, Zheng Y (2018) Pessimistic bilevel optimization: a survey. Int J Comput Intell Syst 11(1):725\u2013736","journal-title":"Int J Comput Intell Syst"},{"issue":"4","key":"4337_CR44","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1007\/s10898-006-9094-0","volume":"38","author":"Y Marinakis","year":"2007","unstructured":"Marinakis Y, Migdalas A, Pardalos PM (2007) A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm. J Global Optim 38(4):555\u2013580","journal-title":"J Global Optim"},{"issue":"1","key":"4337_CR45","first-page":"1","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu R, Pittard L, Anandalingam G (1994) Genetic algorithm based approach to bi-level linear programming. Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle. Recherche op\u00e9rationnelle 28(1):1\u201321","journal-title":"Revue fran\u00e7aise d\u2019automatique, d\u2019informatique et de recherche op\u00e9rationnelle. Recherche op\u00e9rationnelle"},{"issue":"1","key":"4337_CR46","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0191-2615(00)00016-3","volume":"35","author":"Q Meng","year":"2001","unstructured":"Meng Q, Yang H, Bell MG (2001) An equivalent continuously differentiable model and a locally convergent algorithm for the continuous network design problem. Transp Res B: Methodol 35(1):83\u2013105","journal-title":"Transp Res B: Methodol"},{"issue":"4","key":"4337_CR47","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01099649","volume":"7","author":"A Migdalas","year":"1995","unstructured":"Migdalas A (1995) Bilevel programming in traffic planning: models, methods and challenge. J Global Optim 7(4):381\u2013405","journal-title":"J Global Optim"},{"issue":"11","key":"4337_CR48","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N, Hansen P (1997) Variable neighborhood search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"4337_CR49","doi-asserted-by":"crossref","unstructured":"Oduguwa V, Roy R (2002) Bi-level optimisation using genetic algorithm. In: 2002 IEEE international conference on artificial intelligence systems, 2002 (ICAIS 2002), pp 322\u2013327","DOI":"10.1109\/ICAIS.2002.1048121"},{"key":"4337_CR50","doi-asserted-by":"crossref","first-page":"3782","DOI":"10.1007\/s10489-018-1177-3","volume":"48","author":"A Ren","year":"2018","unstructured":"Ren A, Wang Y (2018) A new approach based on possibilistic programming technique and fractile optimization for bi-level programming in a hybrid uncertain circumstance. Appl Intell 48:3782\u20133796","journal-title":"Appl Intell"},{"key":"4337_CR51","volume-title":"Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design","author":"PJ Ross","year":"1988","unstructured":"Ross PJ (1988) Taguchi techniques for quality engineering: loss function, orthogonal experiments, parameter and tolerance design. McGraw-Hill, New York"},{"issue":"5","key":"4337_CR52","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0167-6377(94)90086-8","volume":"15","author":"G Savard","year":"1994","unstructured":"Savard G, Gauvin J (1994) The steepest descent direction for the nonlinear bilevel programming problem. Oper Res Lett 15(5):265\u2013272","journal-title":"Oper Res Lett"},{"issue":"18","key":"4337_CR53","doi-asserted-by":"crossref","first-page":"13440","DOI":"10.1016\/j.eswa.2012.05.059","volume":"39","author":"GA Segundo","year":"2012","unstructured":"Segundo GA, Krohling RA, Cosme RC (2012) A differential evolution approach for solving constrained min\u2013max optimization problems. Expert Syst Appl 39(18):13440\u201313450","journal-title":"Expert Syst Appl"},{"key":"4337_CR54","unstructured":"Sinha A, Malo P, Deb K (2013) Efficient evolutionary algorithm for single-objective bilevel optimization. arXiv:1303.3901"},{"issue":"2","key":"4337_CR55","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","volume":"257","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017a) Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping. Eur J Oper Res 257(2):395\u2013411","journal-title":"Eur J Oper Res"},{"key":"4337_CR56","first-page":"71","volume-title":"Evolutionary bilevel optimization: an introduction and recent advances","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017b) Evolutionary bilevel optimization: an introduction and recent advances. Recent advances in evolutionary multi-objective optimization. Springer, Berlin, pp 71\u2013103"},{"issue":"2","key":"4337_CR57","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","volume":"22","author":"A Sinha","year":"2017","unstructured":"Sinha A, Malo P, Deb K (2017c) A review on bilevel optimization: from classical to evolutionary approaches and applications. IEEE Trans Evol Comput 22(2):276\u2013295","journal-title":"IEEE Trans Evol Comput"},{"key":"4337_CR58","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1016\/j.swevo.2018.06.004","volume":"44","author":"A Sinha","year":"2019","unstructured":"Sinha A, Soun T, Deb K (2019) Using Karush\u2013Kuhn\u2013Tucker proximity measure for solving bi-level optimization problems. Swarm Evol Comput 44:496\u2013510","journal-title":"Swarm Evol Comput"},{"key":"4337_CR59","volume-title":"Marktform und gleichgewicht","author":"HV Stackelberg","year":"1934","unstructured":"Stackelberg HV (1934) Marktform und gleichgewicht. Springer, Wien"},{"issue":"2","key":"4337_CR60","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0305-0548(87)90008-6","volume":"14","author":"G Unlu","year":"1987","unstructured":"Unlu G (1987) A linear bilevel programming algorithm based on bicriteria programming. Comput Oper Res 14(2):173\u2013179","journal-title":"Comput Oper Res"},{"issue":"3","key":"4337_CR61","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"LN Vicente","year":"1994","unstructured":"Vicente LN, Calamai PH (1994) Bilevel and multilevel programming: a bibliography review. J Global Optim 5(3):291\u2013306","journal-title":"J Global Optim"},{"issue":"2","key":"4337_CR62","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1109\/TSMCC.2004.841908","volume":"35","author":"Y Wang","year":"2005","unstructured":"Wang Y, Jiao Y-C, Li H (2005) An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Trans Syst Man Cybern C (Applications and Reviews) 35(2):221\u2013232","journal-title":"IEEE Trans Syst Man Cybern C (Applications and Reviews)"},{"key":"4337_CR63","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1137\/120864015","volume":"23","author":"W Wiesemann","year":"2013","unstructured":"Wiesemann W, Tsoukalas A, Kleniati P-M, Rustem B (2013) Pessimistic bilevel optimization. SIAM J Optim 23:353\u2013380","journal-title":"SIAM J Optim"},{"issue":"2","key":"4337_CR64","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1061\/(ASCE)0733-947X(2000)126:2(115)","volume":"126","author":"Y Yin","year":"2000","unstructured":"Yin Y (2000) Genetic-algorithms-based approach for bilevel programming models. J Transp Eng 126(2):115\u2013120","journal-title":"J Transp Eng"},{"key":"4337_CR65","doi-asserted-by":"publisher","unstructured":"Yue D, You F (2016) Projection-based reformulation and decomposition algorithm for a class of mixed-integer bilevel linear programs. In: Computer aided chemical engineering, vol 38, pp 481\u2013486. https:\/\/doi.org\/10.1016\/B978-0-444-63428-3.50085-0","DOI":"10.1016\/B978-0-444-63428-3.50085-0"},{"key":"4337_CR66","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ins.2018.04.045","volume":"454","author":"Y Zheng","year":"2018","unstructured":"Zheng Y, Zhang G, Zhang Z, Lu J (2018) A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent. Inf Sci 454:46\u201358","journal-title":"Inf Sci"},{"issue":"23","key":"4337_CR67","doi-asserted-by":"crossref","first-page":"6983","DOI":"10.1007\/s00500-016-2237-4","volume":"21","author":"D Zou","year":"2017","unstructured":"Zou D, Lu R, Wang P (2017) Hierarchical multi-swarm cooperative teaching\u2013learning-based optimization for global optimization. Soft Comput 21(23):6983\u20137004","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04337-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04337-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04337-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T20:57:22Z","timestamp":1721768242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04337-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,21]]},"references-count":67,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["4337"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04337-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9,21]]},"assertion":[{"value":"21 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical standard"}}]}}