{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T06:27:07Z","timestamp":1780554427744,"version":"3.54.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T00:00:00Z","timestamp":1427414400000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10479-015-1842-4","type":"journal-article","created":{"date-parts":[[2015,3,27]],"date-time":"2015-03-27T14:01:55Z","timestamp":1427464915000},"page":"771-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)"],"prefix":"10.1007","volume":"229","author":[{"given":"Ashenafi Teklay","family":"Woldemariam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Semu Mitiku","family":"Kassa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,27]]},"reference":[{"key":"1842_CR1","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.31.4.670","volume":"31","author":"JF Bard","year":"1983","unstructured":"Bard, J. F. (1983). An efficient point algorithm for a linear two-stage optimization problem. Operations Research, 31, 670\u2013684.","journal-title":"Operations Research"},{"key":"1842_CR2","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed, O., & Blair, C. (1990). Computational difficulties of bilevel linear programming. Operations Research, 38, 556\u2013560.","journal-title":"Operations Research"},{"key":"1842_CR3","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"WF Bialas","year":"1984","unstructured":"Bialas, W. F., & Karwan, M. H. (1984). Two-level linear programming. Management Science, 30, 1004\u20131020.","journal-title":"Management Science"},{"key":"1842_CR4","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.22.5.1086","volume":"22","author":"J Bracken","year":"1973","unstructured":"Bracken, J., & McGill, J. (1973). Mathematical programs with optimization problems in the constraints. Operational Research, 22, 1086\u20131096.","journal-title":"Operational Research"},{"key":"1842_CR5","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10479-008-0416-0","volume":"166","author":"HI Calvete","year":"2009","unstructured":"Calvete, H. I., Gal\u00e9, C., & Mateo, P. M. (2009). A genetic algorithm for solving linear fractional bilevel problems. Annals of Operation Research, 166, 39\u201356.","journal-title":"Annals of Operation Research"},{"key":"1842_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(82)90006-5","volume":"9","author":"W Candler","year":"1982","unstructured":"Candler, W., & Townsley, R. (1982). A linear two-level programming problem. Computers and Operation Research, 9, 59\u201376.","journal-title":"Computers and Operation Research"},{"key":"1842_CR7","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. Annals of Operation Research, 153, 235\u2013256.","journal-title":"Annals of Operation Research"},{"key":"1842_CR8","volume-title":"Foundation of bileve programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S. (2002). Foundation of bileve programming. Boston: Kluwer Academic Publisher."},{"key":"1842_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1162\/evco.1999.7.3.275","volume":"7","author":"G Greenwood","year":"1999","unstructured":"Greenwood, G., & Zhu, Q. (1999). Convergence in evolutionary programs with self-adaptation. Evolutionary Computation, 7, 275\u2013312.","journal-title":"Evolutionary Computation"},{"key":"1842_CR10","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13, 1194\u20131217.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"1842_CR11","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"S Hejazi","year":"2002","unstructured":"Hejazi, S., Memariani, A., Jahanshahloo, G., & Sepehri, M. (2002). Linear bilevel programming solution by genetic algorithm. Computers and Operations Research, 29, 1913\u20131925.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"1842_CR12","first-page":"133","volume":"3","author":"A Kassa","year":"2013","unstructured":"Kassa, A., & Kassa, S. (2013). A multi-parametric programming algorithm for special classes of non-convex multilevel optimization problems. An International Journal of Optimization and Control Theories and Application (IJOCTA), 3(2), 133\u2013144.","journal-title":"An International Journal of Optimization and Control Theories and Application (IJOCTA)"},{"key":"1842_CR13","first-page":"139","volume":"5","author":"H Li","year":"2011","unstructured":"Li, H., & Wang, Y. (2011). An evolutionary algorithm with local search for convex quadratic bilevel programming problems. Applied Mathematics and Information Sciences, 5, 139\u2013146.","journal-title":"Applied Mathematics and Information Sciences"},{"key":"1842_CR14","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0898-1221(98)00174-6","volume":"36","author":"B Liu","year":"1998","unstructured":"Liu, B. (1998). Stackelberg-Nash equilibrium for multilevel programming with multiple followers using genetic algorithms. Computer Mathematics Application, 36, 79\u201389.","journal-title":"Computer Mathematics Application"},{"key":"1842_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(99)00052-8","volume":"25","author":"M Patriksson","year":"1999","unstructured":"Patriksson, M., & Wynter, L. (1999). Stochastic mathematical programs with equilibrium constraints. Journal Operations Research Letters, 25, 159\u2013167.","journal-title":"Journal Operations Research Letters"},{"key":"1842_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/72.265964","volume":"5","author":"G Rudolph","year":"1994","unstructured":"Rudolph, G. (1994). Convergence properties of canonical genetic algorithms. IEEE Transactions on Neural Networks, 5, 96\u2013101.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"1842_CR17","doi-asserted-by":"crossref","unstructured":"Rudolph, G. (1996). Convergence of evolutionary algorithms in general search spaces: Proceedings of the Third IEEE Conference on Evolutionary Computation, (pp. 50\u201354).","DOI":"10.1109\/ICEC.1996.542332"},{"key":"1842_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1998-341201","volume":"34","author":"G Rudolph","year":"1998","unstructured":"Rudolph, G. (1998). Finite Markov chain results in evolutionary computation: A tour d\u2019Horizon. Fundamenta Informaticae, 34, 1\u201322.","journal-title":"Fundamenta Informaticae"},{"key":"1842_CR19","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 nonlinear bilevel programming problem. Operations Research letters, 15, 265\u2013272.","journal-title":"Operations Research letters"},{"issue":"1","key":"1842_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0305-0548(95)00007-9","volume":"23","author":"H Shih","year":"1996","unstructured":"Shih, H., Lai, Y., & Lee, E. (1996). Fuzzy approach for multi-level programming problems. Computers and Operations Research, 23(1), 73\u201391.","journal-title":"Computers and Operations Research"},{"key":"1842_CR21","doi-asserted-by":"crossref","unstructured":"Tilahun, S., Kassa, S.M., & Ong, H. (2012). A New Algorithm for Multilevel Optimization Problems Using Evolutionary Strategy Inspired by Natural Adaptation. In P. Anthony, M. Ishizuka, and D. Lkose (Eds.), PRICAI 2012, LNAI 7458, (pp. 577\u2013588). Berlin: Springer.","DOI":"10.1007\/978-3-642-32695-0_51"},{"key":"1842_CR22","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1287\/ijoc.1100.0430","volume":"23","author":"Y Wang","year":"2011","unstructured":"Wang, Y., Li, H., & Dang, C. (2011). A new evolutionary algorithm for a class of nonlinear bilevel programming problems and its global convergence. INFORMS Journal on Computing, 23, 618\u2013629.","journal-title":"INFORMS Journal on Computing"},{"key":"1842_CR23","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., & Li, H. (2005). An evolutionary algorithm for solving nonlinear bilevel programming based on a new constraint-handling scheme. IEEE Transactions on Systems, Man, and Cybernetics Applications and Reviews, 35, 221\u2013232.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics Applications and Reviews"},{"key":"1842_CR24","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"D White","year":"1993","unstructured":"White, D., & Anandalingam, A. (1993). A penalty function approach for solving bilevel linear programs. Journal of Global Optimization, 3, 397\u2013419.","journal-title":"Journal of Global Optimization"},{"key":"1842_CR25","unstructured":"Wikipedia., (2013). Wikipedia\u2014the free encyclopedia. Accessed January 26, 2013 from http:\/\/en.wikipedia.org\/wiki\/Systematic_Sampling"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1842-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-1842-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-1842-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,31]],"date-time":"2020-08-31T05:53:17Z","timestamp":1598853197000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-1842-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,27]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["1842"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-1842-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,27]]}}}