{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:37:53Z","timestamp":1740109073635,"version":"3.37.3"},"reference-count":90,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T00:00:00Z","timestamp":1622160000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"crossref","award":["SFI\/12\/RC\/2289"],"award-info":[{"award-number":["SFI\/12\/RC\/2289"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a new class of multiple-follower bilevel problems and a heuristic approach to solving them. In this new class of problems, the followers may be nonlinear, do not share constraints or variables, and are at most weakly constrained. This allows the leader variables to be partitioned among the followers. We show that current approaches for solving multiple-follower problems are unsuitable for our new class of problems and instead we propose a novel analytics-based heuristic decomposition approach. This approach uses Monte Carlo simulation and<jats:italic>k<\/jats:italic>-medoids clustering to reduce the bilevel problem to a single level, which can then be solved using integer programming techniques. The examples presented show that our approach produces better solutions and scales up better than the other approaches in the literature. Furthermore, for large problems, we combine our approach with the use of self-organising maps in place of<jats:italic>k<\/jats:italic>-medoids clustering, which significantly reduces the clustering times. Finally, we apply our approach to a real-life cutting stock problem. Here a forest harvesting problem is reformulated as a multiple-follower bilevel problem and solved using our approach.<\/jats:p>","DOI":"10.1007\/s00291-021-00638-9","type":"journal-article","created":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T10:16:56Z","timestamp":1622197016000},"page":"665-692","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An analytics-based heuristic decomposition of a bilevel multiple-follower cutting stock problem"],"prefix":"10.1007","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0648-3800","authenticated-orcid":false,"given":"Adejuyigbe O.","family":"Fajemisin","sequence":"first","affiliation":[]},{"given":"Laura","family":"Climent","sequence":"additional","affiliation":[]},{"given":"Steven D.","family":"Prestwich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,28]]},"reference":[{"key":"638_CR1","unstructured":"Anderson D, Sweeney D, Williams T, Camm J, Cochran J (2015) An introduction to management science: quantitative approaches to decision making. Cengage learning"},{"key":"638_CR2","doi-asserted-by":"crossref","unstructured":"Angelo J, Barbosa H(2015) Differential evolution to find stackelberg-nash equilibrium in bilevel problems with multiple followers. In: IEEE congress on evolutionary computation, CEC 2015, Sendai, Japan, May 25\u201328, 2015, pp 1675\u20131682","DOI":"10.1109\/CEC.2015.7257088"},{"issue":"1","key":"638_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1002\/nav.3800310104","volume":"31","author":"J Bard","year":"1984","unstructured":"Bard J (1984) Optimality conditions for the bilevel programming problem. Naval Res Logist Q 31(1):13\u201326","journal-title":"Naval Res Logist Q"},{"issue":"1","key":"638_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01580720","volume":"40","author":"J Bard","year":"1988","unstructured":"Bard J (1988) Convex two-level optimization. Math Program 40(1):15\u201327","journal-title":"Math Program"},{"key":"638_CR5","doi-asserted-by":"crossref","unstructured":"Bazaraa M, Jarvis J, Sherali H (2010) Linear Programming and Network Flows. Wiley (2010). https:\/\/books.google.ie\/books?id=2DKKHvV_xVwC","DOI":"10.1002\/9780471703778"},{"key":"638_CR6","unstructured":"Bellman R, Dreyfus S (2015) Applied dynamic programming. Princeton University Press"},{"key":"638_CR7","unstructured":"Bertsekas D (1999) Nonlinear programming. Athena scientific Belmont"},{"key":"638_CR8","unstructured":"Bullinaria J (2004) Self organizing maps: algorithms and applications . http:\/\/www.cs.bham.ac.uk\/~jxb\/NN\/l17.pdf"},{"issue":"3","key":"638_CR9","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10898-007-9144-2","volume":"39","author":"H Calvete","year":"2007","unstructured":"Calvete H, Gal\u00e9 C (2007) Linear bilevel multi-follower programming with independent followers. J Glob Optim 39(3):409\u2013417","journal-title":"J Glob Optim"},{"issue":"1","key":"638_CR10","doi-asserted-by":"publisher","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 MJ (2011) Bilevel model for production-distribution planning solved by using ant colony optimization. Comput Oper Res 38(1):320\u2013327","journal-title":"Comput Oper Res"},{"issue":"5","key":"638_CR11","doi-asserted-by":"publisher","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(5):997\u20131019","journal-title":"Optim Lett"},{"key":"638_CR12","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Said L (2015) A co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In: IEEE congress on evolutionary computation, CEC 2015, Sendai, Japan, May 25\u201328, 2015, pp 1659\u20131666","DOI":"10.1109\/CEC.2015.7257086"},{"key":"638_CR13","doi-asserted-by":"crossref","unstructured":"Chaabani A, Bechikh S, Said L, Azzouz R(2015) An improved co-evolutionary decomposition-based algorithm for bi-level combinatorial optimization. In: Genetic and evolutionary computation conference, GECCO 2015, Madrid, Spain, July 11\u201315, 2015, Companion Material Proceedings, pp 1363\u20131364","DOI":"10.1145\/2739482.2764701"},{"key":"638_CR14","doi-asserted-by":"crossref","unstructured":"Climent L, O\u2019Sullivan B, Prestwich S(2016) Bounding the search space of the population harvest cutting problem with multiple size stock selection. In: Learning and intelligent optimization conference (LION)","DOI":"10.1007\/978-3-319-50349-3_6"},{"issue":"1","key":"638_CR15","doi-asserted-by":"publisher","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"},{"key":"638_CR16","first-page":"35","volume-title":"Weighting features for partition around medoids using the minkowski metric","author":"R de Amorim","year":"2012","unstructured":"de Amorim R, Fenner T (2012) Weighting features for partition around medoids using the minkowski metric. Springer, Berlin, pp 35\u201344"},{"issue":"2\u20134","key":"638_CR17","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","volume":"186","author":"K Deb","year":"2000","unstructured":"Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2\u20134):311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"5","key":"638_CR18","doi-asserted-by":"publisher","first-page":"1220","DOI":"10.1287\/opre.1080.0686","volume":"57","author":"V DeMiguel","year":"2009","unstructured":"DeMiguel V, Xu H (2009) A stochastic multiple-leader stackelberg model: analysis, computation, and application. Oper Res 57(5):1220\u20131235","journal-title":"Oper Res"},{"key":"638_CR19","doi-asserted-by":"crossref","unstructured":"Dempe S, Franke S (2014) The bilevel road pricing problem. TU Bergakademie","DOI":"10.12988\/ijco.2015.5415"},{"issue":"3","key":"638_CR20","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1007\/s10589-015-9795-8","volume":"63","author":"S Dempe","year":"2016","unstructured":"Dempe S, Franke S (2016) On the solution of convex bilevel optimization problems. Comput Optim Appl 63(3):685\u2013703","journal-title":"Comput Optim Appl"},{"issue":"3","key":"638_CR21","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1016\/j.na.2011.05.097","volume":"75","author":"S Dempe","year":"2012","unstructured":"Dempe S, Zemkoho A (2012) On the karush-kuhn-tucker reformulation of the bilevel optimization problem. Nonlinear Anal Theory Methods Appl 75(3):1202\u20131218","journal-title":"Nonlinear Anal Theory Methods Appl"},{"issue":"1","key":"638_CR22","first-page":"65","volume":"232","author":"A Dems","year":"2015","unstructured":"Dems A, Rousseau LM, Frayret JM (2015) Effects of different cut-to-length harvesting structures on the economic value of a wood procurement planning problem. Ann Oper Res 232(1):65\u201386","journal-title":"Ann Oper Res"},{"issue":"2","key":"638_CR23","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1016\/j.ejor.2016.10.039","volume":"259","author":"A Dems","year":"2017","unstructured":"Dems A, Rousseau LM, Frayret JM (2017) Annual timber procurement planning with bucking decisions. Eur J Oper Res 259(2):713\u2013720","journal-title":"Eur J Oper Res"},{"issue":"1","key":"638_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.12785\/jsap\/010107","volume":"1","author":"J Divvela","year":"2012","unstructured":"Divvela J, Sinha B (2012) Statistical aspects of forest harvesting: price-weighted apportionment index and related inference. J Stat Appl Probab 1(1):53","journal-title":"J Stat Appl Probab"},{"issue":"1","key":"638_CR25","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","volume":"90","author":"G Dueck","year":"1990","unstructured":"Dueck G, Scheuer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90(1):161\u2013175","journal-title":"J Comput Phys"},{"key":"638_CR26","unstructured":"Duffner W (1980) Decision making from market to stump. In: Proceedings of weyerhaeuser science symposium, Tacoma, Washington, USA, pp 81\u201395"},{"issue":"2","key":"638_CR27","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44(2):145\u2013159","journal-title":"Eur J Oper Res"},{"issue":"4","key":"638_CR28","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1080\/03052159708941137","volume":"28","author":"A Elkamel","year":"1997","unstructured":"Elkamel A, Zentner M, Pekny F, Reklaitis G (1997) A decomposition heuristic for scheduling the general batch chemical plant. Eng Optim 28(4):299\u2013330","journal-title":"Eng Optim"},{"key":"638_CR29","doi-asserted-by":"publisher","first-page":"1030","DOI":"10.1139\/x86-179","volume":"16","author":"G Eng","year":"1986","unstructured":"Eng G, Daellenbach H, Whyte A (1986) Bucking tree-length stems optimally. Can J For Res 16:1030\u20131035","journal-title":"Can J For Res"},{"key":"638_CR30","first-page":"617","volume-title":"Analytics-based decomposition of a class of bilevel problems","author":"A Fajemisin","year":"2020","unstructured":"Fajemisin A, Climent L, Prestwich S (2020) Analytics-based decomposition of a class of bilevel problems, vol 991. Springer International Publishing, Cham, pp 617\u2013626"},{"issue":"3","key":"638_CR31","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/s001580050149","volume":"20","author":"J Herskovits","year":"2000","unstructured":"Herskovits J, Leontiev A, Dias G, Santos G (2000) Contact shape optimization: a bilevel programming approach. Struct Multidiscip Optim 20(3):214\u2013221","journal-title":"Struct Multidiscip Optim"},{"key":"638_CR32","unstructured":"IBM (2017) User\u2019s manual of ibm cplex optimizer for z\/os: What is an indicator constraint? (2017). https:\/\/ibm.co\/2Wjwo67"},{"key":"638_CR33","doi-asserted-by":"crossref","unstructured":"Islam M, Singh H, Ray T(2016) A memetic algorithm for solving bilevel optimization problems with multiple followers. In: IEEE congress on evolutionary computation, CEC 2016, Vancouver, BC, Canada, July 24\u201329, 2016, pp 1901\u20131908","DOI":"10.1109\/CEC.2016.7744020"},{"issue":"2","key":"638_CR34","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1021\/ie970383i","volume":"37","author":"R Iyer","year":"1998","unstructured":"Iyer R, Grossmann I (1998) A bilevel decomposition algorithm for long-range planning of process networks. Ind Eng Chem Res 37(2):474\u2013481","journal-title":"Ind Eng Chem Res"},{"key":"638_CR35","first-page":"187","volume-title":"Extremum problems with inequalities as side conditions","author":"F John","year":"1948","unstructured":"John F (1948) Extremum problems with inequalities as side conditions. Wiley, New York, pp 187\u2013204"},{"key":"638_CR36","unstructured":"Komatsu forest machines. https:\/\/www.komatsuforest.com\/forest-machines"},{"issue":"4","key":"638_CR37","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/mnsc.6.4.366","volume":"6","author":"L Kantorovich","year":"1960","unstructured":"Kantorovich L (1960) Mathematical methods of organizing and planning production. Manag Sci 6(4):366\u2013422","journal-title":"Manag Sci"},{"key":"638_CR38","unstructured":"Kaufman L, Rousseeuw P (2009) Finding groups in data: an introduction to cluster analysis, vol 344. John Wiley & Sons"},{"issue":"3","key":"638_CR39","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1080\/03081079.2015.1086579","volume":"45","author":"H Ke","year":"2016","unstructured":"Ke H, Huang H, Ralescu D, Wang L (2016) Fuzzy bilevel programming with multiple non-cooperative followers: model, algorithm and application. Int J Gen Syst 45(3):336\u2013351","journal-title":"Int J Gen Syst"},{"issue":"5","key":"638_CR40","first-page":"696","volume":"50","author":"VP Kivinen","year":"2004","unstructured":"Kivinen VP (2004) A genetic algorithm approach to tree bucking optimization. For Sci 50(5):696\u2013710","journal-title":"For Sci"},{"issue":"7","key":"638_CR41","doi-asserted-by":"publisher","first-page":"1705","DOI":"10.1139\/x06-055","volume":"36","author":"VP Kivinen","year":"2006","unstructured":"Kivinen VP (2006) A forest-level genetic algorithm based control system for generating stand-specific log demand distributions. Can J For Res 36(7):1705\u20131722","journal-title":"Can J For Res"},{"issue":"3","key":"638_CR42","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1139\/x04-196","volume":"35","author":"VP Kivinen","year":"2005","unstructured":"Kivinen VP, Uusitalo J, Nummi T (2005) Comparison of four measures designed for assessing the fit between the demand and output distributions of logs. Can J For Res 35(3):693\u2013702","journal-title":"Can J For Res"},{"issue":"1","key":"638_CR43","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF00337288","volume":"43","author":"T Kohonen","year":"1982","unstructured":"Kohonen T (1982) Self-organized formation of topologically correct feature maps. Biol Cybern 43(1):59\u201369","journal-title":"Biol Cybern"},{"issue":"5","key":"638_CR44","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/s10845-012-0692-z","volume":"24","author":"Y Kristianto","year":"2013","unstructured":"Kristianto Y, Helo P, Jiao R (2013) Mass customization design of engineer-to-order products using benders\u2019 decomposition and bi-level stochastic programming. J Intell Manuf 24(5):961\u2013975","journal-title":"J Intell Manuf"},{"issue":"12","key":"638_CR45","doi-asserted-by":"publisher","first-page":"1481","DOI":"10.1057\/jors.1995.208","volume":"46","author":"K Kr\u00fcger","year":"1995","unstructured":"Kr\u00fcger K, Shakhlevich NV, Sotskov YN, Werner F (1995) A heuristic decomposition algorithm for scheduling problems on mixed graphs. J Oper Res Soc 46(12):1481\u20131497","journal-title":"J Oper Res Soc"},{"issue":"2","key":"638_CR46","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BF00118594","volume":"2","author":"J Lampinen","year":"1992","unstructured":"Lampinen J, Oja E (1992) Clustering properties of hierarchical self-organizing maps. J Math Imaging Vis 2(2):261\u2013272","journal-title":"J Math Imaging Vis"},{"issue":"1","key":"638_CR47","doi-asserted-by":"publisher","first-page":"87","DOI":"10.4236\/ijcns.2010.31013","volume":"3","author":"H Li","year":"2010","unstructured":"Li H, Wang Y (2010) An evolutionary algorithm based on a new decomposition scheme for nonlinear bilevel programming problems. IJCNS 3(1):87\u201393","journal-title":"IJCNS"},{"key":"638_CR48","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.knosys.2016.06.018","volume":"107","author":"H Li","year":"2016","unstructured":"Li H, Zhang Q, Chen Q, Zhang L, Jiao YC (2016) Multiobjective differential evolution algorithm based on decomposition for a type of multiobjective bilevel programming problems. Knowl-Based Syst 107:271\u2013288","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"638_CR49","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s11067-008-9093-4","volume":"11","author":"DY Lin","year":"2011","unstructured":"Lin DY, Karoonsoontawong A, Waller ST (2011) A dantzig-wolfe decomposition based heuristic scheme for bi-level dynamic network design problem. Netw Spatial Econ 11(1):101\u2013126","journal-title":"Netw Spatial Econ"},{"issue":"7","key":"638_CR50","doi-asserted-by":"publisher","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. Comput Math Appl 36(7):79\u201389","journal-title":"Comput Math Appl"},{"key":"638_CR51","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1016\/j.ins.2016.01.084","volume":"346\u2013347","author":"J Lu","year":"2016","unstructured":"Lu J, Han J, Hu Y, Zhang G (2016) Multilevel decision-making: a survey. Inf Sci 346\u2013347:463\u2013487. https:\/\/doi.org\/10.1016\/j.ins.2016.01.084","journal-title":"Inf Sci"},{"issue":"11","key":"638_CR52","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1016\/j.ins.2005.04.010","volume":"176","author":"J Lu","year":"2006","unstructured":"Lu J, Shi C, Zhang G (2006) On bilevel multi-follower decision making: general framework and solutions. Inf Sci 176(11):1607\u20131627","journal-title":"Inf Sci"},{"issue":"4","key":"638_CR53","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-006-9098-9","volume":"38","author":"J Lu","year":"2007","unstructured":"Lu J, Shi C, Zhang G, Dillon T (2007) Model and extended kuhn-tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation. J Glob Optim 38(4):597\u2013608","journal-title":"J Glob Optim"},{"key":"638_CR54","unstructured":"Lu J, Shi C, Zhang G, Ruan D (2005) Multi-follower linear bilevel programming: model and kuhn-tucker approach. In: AC 2005, Proceedings of the IADIS international conference on applied computing, Algarve, Portugal, February 22\u201325, 2005, 2 Volumes, pp 81\u201388"},{"issue":"2","key":"638_CR55","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1142\/S0219622007002459","volume":"6","author":"J Lu","year":"2007","unstructured":"Lu J, Shi C, Zhang G, Ruan D (2007) An extended branch and bound algorithm for bilevel multi-follower decision making in a referential-uncooperative situation. Int J Inf Technol Decis Mak 6(2):371\u2013388","journal-title":"Int J Inf Technol Decis Mak"},{"key":"638_CR56","unstructured":"Maechler M, Rousseeuw P, Struyf A, Hubert M, Hornik K (2017) cluster: cluster Analysis Basics and Extensions , R package version 2.0.6\u2014For new features, see the \u2019Changelog\u2019 file (in the package source)"},{"issue":"1","key":"638_CR57","first-page":"33","volume":"15","author":"J Malinen","year":"2004","unstructured":"Malinen J, Palander T (2004) Metrics for distribution similarity applied to the bucking to demand procedure. Int J For Eng 15(1):33\u201340","journal-title":"Int J For Eng"},{"issue":"2","key":"638_CR58","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1214\/aoms\/1177692644","volume":"43","author":"G Marsaglia","year":"1972","unstructured":"Marsaglia G (1972) Choosing a point from the surface of a sphere. Ann Math Stat 43(2):645\u2013646. https:\/\/doi.org\/10.1214\/aoms\/1177692644","journal-title":"Ann Math Stat"},{"issue":"1","key":"638_CR59","doi-asserted-by":"publisher","first-page":"127","DOI":"10.14214\/sf.356","volume":"40","author":"H Marshall","year":"2006","unstructured":"Marshall H, Murphy G, Boston K (2006) Three mathematical models for bucking-to-order. Silva Fennica 40(1):127","journal-title":"Silva Fennica"},{"issue":"4","key":"638_CR60","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/377939.377946","volume":"2","author":"M Muller","year":"1959","unstructured":"Muller M (1959) A note on a method for generating points uniformly on n-dimensional spheres. Commun ACM 2(4):19\u201320","journal-title":"Commun ACM"},{"issue":"12","key":"638_CR61","first-page":"114","volume":"54","author":"G Murphy","year":"2004","unstructured":"Murphy G, Marshall H, Bolding M (2004) Adaptive control of bucking on harvesters to meet order book constraints. For Prod J Index 54(12):114\u2013121","journal-title":"For Prod J Index"},{"issue":"5","key":"638_CR62","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.cor.2010.08.012","volume":"38","author":"T Nishi","year":"2011","unstructured":"Nishi T, Hiranaka Y, Grossmann I (2011) A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles. Comput OR 38(5):876\u2013888","journal-title":"Comput OR"},{"key":"638_CR63","unstructured":"Nogales\u00a0Mart\u00edn F, Miguel A, et\u00a0al (2004) On the relationship between bilevel decomposition algorithms and direct interior-point methods. Tech. rep., Universidad Carlos III de Madrid. Departamento de Estad\u00edstica"},{"key":"638_CR64","first-page":"335","volume-title":"Solving a hard cutting stock problem by machine learning and optimisation","author":"S Prestwich","year":"2015","unstructured":"Prestwich S, Fajemisin A, Climent L, O\u2019Sullivan B (2015) Solving a hard cutting stock problem by machine learning and optimisation. Springer International Publishing, Cham, pp 335\u2013347"},{"key":"638_CR65","first-page":"183","volume-title":"Speeding up logic-based benders\u2019 decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem","author":"G Raidl","year":"2014","unstructured":"Raidl G, Baumhauer T, Hu B (2014) Speeding up logic-based benders\u2019 decomposition by a metaheuristic for a bi-level capacitated vehicle routing problem. Springer International Publishing, Cham, pp 183\u2013197"},{"issue":"Supplement C","key":"638_CR66","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.compchemeng.2016.01.005","volume":"87","author":"M Ramos","year":"2016","unstructured":"Ramos M, Boix M, Aussel D, Montastruc L, Domenech S (2016) Water integration in eco-industrial parks using a multi-leader-follower approach. Comput Chem Eng 87(Supplement C):190\u2013207. https:\/\/doi.org\/10.1016\/j.compchemeng.2016.01.005","journal-title":"Comput Chem Eng"},{"key":"638_CR67","unstructured":"Rybarski J, Habdank-Wojew\u00f3dzki S (2006) Java kohonen neural network library (jknnl) http:\/\/jknnl.sourceforge.net\/"},{"issue":"1","key":"638_CR68","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10898-008-9291-0","volume":"44","author":"G Saharidis","year":"2009","unstructured":"Saharidis G, Ierapetritou M (2009) Resolution method for mixed integer bi-level linear problems based on decomposition technique. J Glob Optim 44(1):29\u201351","journal-title":"J Glob Optim"},{"issue":"1","key":"638_CR69","first-page":"271","volume":"35","author":"J Sessions","year":"1989","unstructured":"Sessions J, Olsen E, Garland J (1989) Notes: tree bucking for optimal stand value with log allocation constraints. For Sci 35(1):271\u2013276","journal-title":"For Sci"},{"key":"638_CR70","unstructured":"Shi C, Lu J, Zhang G, Zhou H (2005) An extended kuhn-tucker approach for linear bilevel multifollower programming with partial shared variables among followers. In: Proceedings of the IEEE international conference on systems, man and cybernetics, Waikoloa, Hawaii, USA, October 10\u201312, 2005, pp 3350\u20133357"},{"issue":"4","key":"638_CR71","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10898-004-7739-4","volume":"33","author":"C Shi","year":"2005","unstructured":"Shi C, Zhang G, Lu J (2005) The K th-best approach for linear bilevel multi-follower programming. J Glob Optim 33(4):563\u2013578","journal-title":"J Glob Optim"},{"issue":"2","key":"638_CR72","doi-asserted-by":"crossref","first-page":"1686","DOI":"10.1016\/j.amc.2006.11.176","volume":"188","author":"C Shi","year":"2007","unstructured":"Shi C, Zhou H, Lu J, Zhang G, Zhang Z (2007) The kth-best approach for linear bilevel multifollower programming with partial shared variables among followers. Appl Math Comput 188(2):1686\u20131698","journal-title":"Appl Math Comput"},{"key":"638_CR73","doi-asserted-by":"crossref","unstructured":"Sinha A, Malo P, Deb K (2013) Efficient evolutionary algorithm for single-objective bilevel optimization. arXiv:1303.3901","DOI":"10.1145\/2464576.2480812"},{"key":"638_CR74","doi-asserted-by":"crossref","unstructured":"Sinha A, Malo P, Deb K (2014) An improved bilevel evolutionary algorithm based on quadratic approximations. In: 2014 IEEE congress on evolutionary computation (CEC), pp 1870\u20131877","DOI":"10.1109\/CEC.2014.6900391"},{"key":"638_CR75","unstructured":"Sinha A, Malo P, Deb K (2017) A Review on bilevel optimization: from classical to evolutionary approaches and applications. arXiv:1705.06270v1"},{"issue":"2","key":"638_CR76","doi-asserted-by":"publisher","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 (2017) 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":"638_CR77","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 (2014) Finding optimal strategies in a multi-period multi-leader-follower stackelberg game using an evolutionary algorithm. Comput Oper Res 41:374\u2013385","journal-title":"Comput Oper Res"},{"key":"638_CR78","doi-asserted-by":"crossref","unstructured":"Sugiyama T, Nishi T, Inuiguchi M, Takahashi S, Ueda K (2012) A bilevel decomposition approach to railway crew rostering problems for fair labor condition. In: 2012 IEEE international conference on automation science and engineering, CASE 2012, Seoul, Korea (South), August 20\u201324, 2012, pp 383\u2013389","DOI":"10.1109\/CoASE.2012.6386407"},{"key":"638_CR79","doi-asserted-by":"crossref","unstructured":"Talbi EG (2013) Metaheuristics for bi-level optimization, vol 482. Springer","DOI":"10.1007\/978-3-642-37838-6"},{"key":"638_CR80","unstructured":"Vanderbei R (2007) Linear programming: foundations and extensions. International Series in Operations Research & Management Science. Springer US. https:\/\/books.google.ie\/books?id=T-BW1g69wbYC"},{"key":"638_CR81","doi-asserted-by":"crossref","unstructured":"Visweswaran V, Floudas C, Ierapetritou M, Pistikopoulos E (1996) A decomposition-based global optimization approach for solving bilevel linear and quadratic programs. State of the art in global optimization 139","DOI":"10.1007\/978-1-4613-3437-8_10"},{"issue":"7","key":"638_CR82","doi-asserted-by":"publisher","first-page":"10471","DOI":"10.1016\/j.eswa.2009.01.017","volume":"36","author":"G Wang","year":"2009","unstructured":"Wang G, Wang X, Wan Z (2009) A fuzzy interactive decision making algorithm for bilevel multi-followers programming with partial shared variables among followers. Expert Syst Appl 36(7):10471\u201310474","journal-title":"Expert Syst Appl"},{"issue":"3","key":"638_CR83","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher G, Hau\u00dfner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109\u20131130","journal-title":"Eur J Oper Res"},{"key":"638_CR84","unstructured":"Wei CP, Lee YH, Hsu CM (2000) Empirical comparison of fast clustering algorithms for large data sets. In: Proceedings of the 33rd annual hawaii international conference on system sciences, 2000, IEEE, p 10"},{"key":"638_CR85","unstructured":"Zeng B, An Y(2014) Solving bilevel mixed integer program by reformulations and decomposition. Optim:1\u201334"},{"issue":"3","key":"638_CR86","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10898-008-9365-z","volume":"47","author":"G Zhang","year":"2010","unstructured":"Zhang G, Lu J (2010) Fuzzy bilevel programming with multiple objectives and cooperative multiple followers. J Glob Optim 47(3):403\u2013419","journal-title":"J Glob Optim"},{"key":"638_CR87","doi-asserted-by":"crossref","unstructured":"Zhang G, Lu J, Dillon T (2007) Models and algorithm for fuzzy multi-objective multi-follower linear bilevel programming. In: FUZZ-IEEE 2007, IEEE International Conference on Fuzzy Systems, Imperial College, London, UK, 23\u201326 July, 2007, Proceedings, pp 1\u20136","DOI":"10.1109\/FUZZY.2007.4295448"},{"issue":"4\u20135","key":"638_CR88","first-page":"303","volume":"19","author":"G Zhang","year":"2008","unstructured":"Zhang G, Lu J, Gao Y (2008a) An algorithm for fuzzy multi-objective multi-follower partial cooperative bilevel programming. J Intell Fuzzy Syst 19(4\u20135):303\u2013319","journal-title":"J Intell Fuzzy Syst"},{"issue":"Supplement\u20132","key":"638_CR89","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S0218488508005510","volume":"16","author":"G Zhang","year":"2008","unstructured":"Zhang G, Lu J, Gao Y (2008b) Fuzzy bilevel programming: multi-objective and multi-follower with shared variables. Int J Uncertain Fuzziness Knowl-Based Syst 16(Supplement\u20132):105\u2013133","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"issue":"3","key":"638_CR90","first-page":"205","volume":"1","author":"G Zhang","year":"2008","unstructured":"Zhang G, Shi C, Lu J (2008) An extended Kth-best approach for referential-uncooperative bilevel multi-follower decision making. Int J Comput Intell Syst 1(3):205\u2013214","journal-title":"Int J Comput Intell Syst"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00638-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-021-00638-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-021-00638-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T07:54:00Z","timestamp":1699084440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-021-00638-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,28]]},"references-count":90,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["638"],"URL":"https:\/\/doi.org\/10.1007\/s00291-021-00638-9","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2021,5,28]]},"assertion":[{"value":"16 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}