{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T12:51:03Z","timestamp":1753879863127,"version":"3.41.2"},"reference-count":35,"publisher":"ASME International","issue":"4","license":[{"start":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T00:00:00Z","timestamp":1644192000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.asme.org\/publications-submissions\/publishing-information\/legal-policies"}],"content-domain":{"domain":["asmedigitalcollection.asme.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Bi-level programming, where one objective is nested within the other, is widely used in engineering design, e.g., structural optimization and electronic system design. One major issue of current solvers for these bi-level problems is their low computational efficiency, especially for complex nonlinear problems. The existing methods usually applied time-consuming nested computational structure, which requires an amount of function evaluations (FEs) since a lower-level (LL) optimization needs to be constructed for each upper-level (UL) solution. To solve this issue, a new method based on bi-level grey wolf optimizer (BLGWO) is proposed in this paper. The basic idea is to drop the conventional nested computational structure and instead use a simultaneous computational structure. The simultaneous structure is built on top of a dominance determination process for the grey wolf optimizer, so that the upper-level and lower-level problems can be optimized simultaneously, which greatly improves the efficiency of solving the bi-level problems. The effectiveness of this new method has been validated with ten benchmark functions and two engineering design examples, as well as comparisons with three important existing methods in the bi-level programming domain.<\/jats:p>","DOI":"10.1115\/1.4053037","type":"journal-article","created":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T09:13:58Z","timestamp":1637226838000},"update-policy":"https:\/\/doi.org\/10.1115\/crossmarkpolicy-asme","source":"Crossref","is-referenced-by-count":0,"title":["A Highly Efficient Approach for Bi-Level Programming Problems Based on Dominance Determination"],"prefix":"10.1115","volume":"22","author":[{"given":"Guan","family":"Wang","sequence":"first","affiliation":[{"name":"State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Qiang","family":"Zou","sequence":"additional","affiliation":[{"name":"State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Chuke","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Electrical and Electronic Engineering, Huazhong University of Science and Technology, Wuhan 323000, China"}]},{"given":"Yusheng","family":"Liu","sequence":"additional","affiliation":[{"name":"State Key Laboratory of CAD and CG, Zhejiang University, Hangzhou 310027, China"}]},{"given":"Xiaoping","family":"Ye","sequence":"additional","affiliation":[{"name":"Key Laboratory of Digital Design and Intelligent Manufacturing for Creative Cultural Products of Zhejiang Province, Lishui University, Lishui 323000, China"}]}],"member":"33","published-online":{"date-parts":[[2022,2,7]]},"reference":[{"issue":"3","key":"2022020714353915500_CIT0001","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1115\/1.2013290","article-title":"A Survey of Structural Optimization in Mechanical Product Development","volume":"5","author":"Saitou","year":"2005","journal-title":"ASME J. Comput. Inf. Sci. Eng."},{"key":"2022020714353915500_CIT0002","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1016\/j.apenergy.2016.08.009","article-title":"Operational Scheduling of Microgrids Via Parametric Programming","volume":"180","author":"Umeozor","year":"2016","journal-title":"Appl. Energy"},{"issue":"2","key":"2022020714353915500_CIT0003","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TEVC.2017.2712906","article-title":"A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications","volume":"22","author":"Sinha","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"2022020714353915500_CIT0004","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","article-title":"Bilevel and Multilevel Programming: A Bibliography Review","volume":"5","author":"Vicente","year":"1994","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2022020714353915500_CIT0005","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/02331939508844060","article-title":"Optimality Conditions for Bilevel Programming Problems","volume":"33","author":"Ye","year":"1995","journal-title":"Optimization"},{"issue":"1","key":"2022020714353915500_CIT0006","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","article-title":"An Overview of Bilevel Optimization","volume":"153","author":"Colson","year":"2007","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"2022020714353915500_CIT0007","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.ejor.2016.08.027","article-title":"Evolutionary Algorithm for Bilevel Optimization Using Approximations of the Lower Level Optimal Solution Mapping","volume":"257","author":"Sinha","year":"2017","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2022020714353915500_CIT0008","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","article-title":"An Explicit Solution to the Multi-Level Programming Problem","volume":"9","author":"Bard","year":"1982","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2022020714353915500_CIT0009","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.ejor.2020.10.002","article-title":"An Enhanced Branch-and-Bound Algorithm for Bilevel Integer Linear Programming","volume":"291","author":"Liu","year":"2021","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2022020714353915500_CIT0010","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF00939562","article-title":"Derivative Evaluation and Computational Experience With Large Bilevel Mathematical Programs","volume":"65","author":"Kolstad","year":"1990","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2022020714353915500_CIT0011","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1287\/ijoc.2019.0945","article-title":"Computing Feasible Points of Bilevel Problems With a Penalty Alternating Direction Method","volume":"33","author":"Kleinert","year":"2021","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"2022020714353915500_CIT0012","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","article-title":"A Solution Method for the Static Constrained Stackelberg Problem Via Penalty Method","volume":"29","author":"Aiyoshi","year":"1984","journal-title":"IEEE Trans. Automat. Contr."},{"issue":"8","key":"2022020714353915500_CIT0013","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","article-title":"Two-Level Linear Programming","volume":"30","author":"Bialas","year":"1984","journal-title":"Manag. Sci."},{"issue":"1","key":"2022020714353915500_CIT0014","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/21.101139","article-title":"Algorithms for Nonlinear Bilevel Mathematical Programs","volume":"21","author":"Edmunds","year":"1991","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"2022020714353915500_CIT0015","doi-asserted-by":"publisher","first-page":"115505","DOI":"10.1016\/j.eswa.2021.115505","article-title":"Bi-Level Programming Model and Kkt Penalty Function Solution Approach for Reliable Hub Location Problem","volume":"184","author":"Korani","year":"2021","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"2022020714353915500_CIT0016","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0167-6377(94)90086-8","article-title":"The Steepest Descent Direction for the Nonlinear Bilevel Programming Problem","volume":"15","author":"Savard","year":"1994","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2022020714353915500_CIT0017","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro\/1994280100011","article-title":"Genetic Algorithm Based Approach to Bi-Level Linear Programming","volume":"28","author":"Mathieu","year":"1994","journal-title":"RAIRO Oper. Res."},{"issue":"4","key":"2022020714353915500_CIT0018","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1023\/A:1025699819419","article-title":"A Tabu Search Based Approach for Solving a Class of Bilevel Programming Problems in Chemical Engineering","volume":"9","author":"Rajesh","year":"2003","journal-title":"J. Heuristics"},{"issue":"13","key":"2022020714353915500_CIT0019","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","article-title":"Linear Bilevel Programming Solution by Genetic Algorithm","volume":"29","author":"Hejazi","year":"2002","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2022020714353915500_CIT0020","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1162\/EVCO_a_00116","article-title":"Test Problem Construction for Single-Objective Bilevel Optimization","volume":"22","author":"Sinha","year":"2014","journal-title":"Evol. Comput."},{"key":"2022020714353915500_CIT0021","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.knosys.2017.09.038","article-title":"A Bilevel Improved Fruit Fly Optimization Algorithm for the Nonlinear Bilevel Programming Problem","volume":"138","author":"Wang","year":"2017","journal-title":"Knowl. Based Syst."},{"issue":"5","key":"2022020714353915500_CIT0022","doi-asserted-by":"publisher","first-page":"767","DOI":"10.3390\/SYM12050767","article-title":"Modified Evolutionary Algorithm and Chaotic Search for Bilevel Programming Problems","volume":"12","author":"Abo-Elnaga","year":"2020","journal-title":"Symmetry"},{"issue":"3","key":"2022020714353915500_CIT0023","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-021-01453-2","article-title":"A Bi-Level Model and Memetic Algorithm for Arc Interdiction Location-Routing Problem","volume":"40","author":"Nadizadeh","year":"2021","journal-title":"Comput. Appl. Math."},{"key":"2022020714353915500_CIT0024","doi-asserted-by":"publisher","first-page":"102403","DOI":"10.1016\/j.simpat.2021.102403","article-title":"Metamodel-Based Simulation Optimization: A Systematic Literature Review","volume":"114","author":"Amaral","year":"2022","journal-title":"Simul. Model. Pract. Theory"},{"key":"2022020714353915500_CIT0025","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.ins.2021.03.002","article-title":"Surrogate Models in Evolutionary Single-Objective Optimization: A New Taxonomy and Experimental Study","volume":"562","author":"Tong","year":"2021","journal-title":"Inf. Sci."},{"issue":"4","key":"2022020714353915500_CIT0026","doi-asserted-by":"publisher","first-page":"041010","DOI":"10.1115\/1.4007988","article-title":"Robust Optimization of Mixed-Integer Problems Using Nurbs-Based Metamodels","volume":"12","author":"Steuben","year":"2012","journal-title":"ASME J. Comput. Inf. Sci. Eng."},{"key":"2022020714353915500_CIT0027","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900391","article-title":"An improved bilevel evolutionary algorithm based on Quadratic Approximations","author":"Sinha","year":"2014"},{"issue":"2","key":"2022020714353915500_CIT0028","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10732-019-09426-9","article-title":"Bilevel Optimization Based on Iterative Approximation of Multiple Mappings","volume":"26","author":"Sinha","year":"2020","journal-title":"J. Heuristics"},{"issue":"5","key":"2022020714353915500_CIT0029","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1109\/TEVC.2017.2670659","article-title":"A Surrogate Assisted Approach for Single-Objective Bilevel Optimization","volume":"21","author":"Islam","year":"2017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2022020714353915500_CIT0030","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.eswa.2015.10.039","article-title":"Multi-Objective Grey Wolf Optimizer: A Novel Algorithm for Multi-Criterion Optimization","volume":"47","author":"Mirjalili","year":"2016","journal-title":"Expert Syst. Appl."},{"issue":"1","key":"2022020714353915500_CIT0031","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0305-0548(89)90054-3","article-title":"A Note on a Linear Bilevel Programming Algorithm Based on Bicriteria Programming","volume":"16","author":"Wen","year":"1989","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"2022020714353915500_CIT0032","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10957-006-9136-2","article-title":"Multicriteria Approach to Bilevel Optimization","volume":"131","author":"Fliege","year":"2006","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2022020714353915500_CIT0033","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1287\/ijoc.1100.0430","article-title":"A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence","volume":"23","author":"Wang","year":"2011","journal-title":"NFORMS J. Comput."},{"issue":"4","key":"2022020714353915500_CIT0034","doi-asserted-by":"publisher","first-page":"041010","DOI":"10.1115\/1.4049996","article-title":"An Efficient Multi-Objective Robust Optimization Method by Sequentially Searching From Nominal Pareto Solutions","volume":"21","author":"Xia","year":"2021","journal-title":"ASME J. Comput. Inf. Sci. Eng."},{"issue":"2","key":"2022020714353915500_CIT0035","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1115\/1.2919393","article-title":"An Augmented Lagrange Multiplier Based Method for Mixed Integer Discrete Continuous Optimization and Its Applications to Mechanical Design","volume":"116","author":"Kannan","year":"1994","journal-title":"ASME J. Mech. Des."}],"container-title":["Journal of Computing and Information Science in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/22\/4\/041006\/6837058\/jcise_22_4_041006.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article-pdf\/22\/4\/041006\/6837058\/jcise_22_4_041006.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,7]],"date-time":"2022-02-07T14:35:51Z","timestamp":1644244551000},"score":1,"resource":{"primary":{"URL":"https:\/\/asmedigitalcollection.asme.org\/computingengineering\/article\/22\/4\/041006\/1128638\/A-Highly-Efficient-Approach-for-Bi-Level"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,7]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,8,1]]}},"URL":"https:\/\/doi.org\/10.1115\/1.4053037","relation":{},"ISSN":["1530-9827","1944-7078"],"issn-type":[{"type":"print","value":"1530-9827"},{"type":"electronic","value":"1944-7078"}],"subject":[],"published":{"date-parts":[[2022,2,7]]},"article-number":"041006"}}