{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T19:31:33Z","timestamp":1777663893282,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T00:00:00Z","timestamp":1526083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503416"],"award-info":[{"award-number":["61503416"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61533021"],"award-info":[{"award-number":["61533021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["B17048"],"award-info":[{"award-number":["B17048"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61533020"],"award-info":[{"award-number":["61533020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cogn Comput"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s12559-018-9561-1","type":"journal-article","created":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T07:18:36Z","timestamp":1526109516000},"page":"816-826","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["A Novel Cognitively Inspired State Transition Algorithm for Solving the Linear Bi-Level Programming Problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Zhaoke","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weihua","family":"Gui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,12]]},"reference":[{"key":"9561_CR1","unstructured":"Bard JF. Practical bilevel optimization: algorithms and applications. Springer Science & Business Media; 2013. vol. 30."},{"issue":"1","key":"9561_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","volume":"9","author":"JF Bard","year":"1982","unstructured":"Bard JF, Falk JE. An explicit solution to the multi-level programming problem. Comput Oper Res 1982;9 (1):77\u2013100.","journal-title":"Comput Oper Res"},{"issue":"8","key":"9561_CR3","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"WF Bialas","year":"1984","unstructured":"Bialas W F, Karwan MH. Two-level linear programming. Manag Sci 1984;30(8):1004\u20131020.","journal-title":"Manag Sci"},{"key":"9561_CR4","unstructured":"Dempe S. 2002. Foundations of bilevel programming. Springer Science & Business Media."},{"key":"9561_CR5","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.hydromet.2017.08.007","volume":"173","author":"J Han","year":"2017","unstructured":"Han J, Yang C, Zhou X, Gui W. Dynamic multi-objective optimization arising in iron precipitation of zinc hydrometallurgy. Hydrometallurgy 2017;173:134\u2013148.","journal-title":"Hydrometallurgy"},{"key":"9561_CR6","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1016\/j.apm.2017.02.015","volume":"44","author":"J Han","year":"2017","unstructured":"Han J, Yang C, Zhou X, Gui W. A new multi-threshold image segmentation approach using state transition algorithm. Appl Math Model 2017;44:588\u2013601.","journal-title":"Appl Math Model"},{"key":"9561_CR7","unstructured":"Han J, Yang C, Zhou X, Gui W. A two-stage state transition algorithm for constrained engineering optimization problems. Int J Control Autom Syst 2017:1\u201313."},{"issue":"5","key":"9561_CR8","doi-asserted-by":"publisher","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P Hansen","year":"1992","unstructured":"Hansen P, Jaumard B, Savard G. New branch-and-bound rules for linear bilevel programming. SIAM J Sci Statist Comput 1992;13(5):1194\u20131217.","journal-title":"SIAM J Sci Statist Comput"},{"issue":"4","key":"9561_CR9","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TNNLS.2013.2280905","volume":"25","author":"X He","year":"2014","unstructured":"He X, Li C, Huang T, Li C, Huang J. A recurrent neural network for solving bilevel linear programming problem. IEEE Trans Neural Netw Learn Syst 2014;25(4):824\u2013830.","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"issue":"13","key":"9561_CR10","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/S0305-0548(01)00066-1","volume":"29","author":"S Reza Hejazi","year":"2002","unstructured":"Reza Hejazi S, Memariani A, Jahanshahloo G, Sepehri MM. Linear bilevel programming solution by genetic algorithm. Comput Oper Res 2002;29(13):1913\u20131925.","journal-title":"Comput Oper Res"},{"key":"9561_CR11","doi-asserted-by":"crossref","unstructured":"Huang M, Zhou X, Huang T, Yang C, Gui W. Dynamic optimization based on state transition algorithm for copper removal process. Neural Comput and Applic. 2017:1\u201313.","DOI":"10.1007\/s00521-017-3232-0"},{"issue":"4","key":"9561_CR12","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1007\/s12559-016-9416-6","volume":"8","author":"SG Javed","year":"2016","unstructured":"Javed SG, Majid A, Ali S, Kausar N. A bio-inspired parallel-framework based multi-gene genetic programming approach to denoise biomedical images. Cogn Comput 2016;8(4):776\u2013793.","journal-title":"Cogn Comput"},{"issue":"2","key":"9561_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s12559-016-9447-z","volume":"9","author":"S-S Kim","year":"2017","unstructured":"Kim S-S, McLoone S, Byeon J-H, Lee S, Liu H. Cognitively inspired artificial bee colony clustering for cognitive wireless sensor networks. Cogn Comput 2017;9(2):207\u2013224.","journal-title":"Cogn Comput"},{"issue":"8","key":"9561_CR14","doi-asserted-by":"publisher","first-page":"3905","DOI":"10.1016\/j.apm.2011.02.008","volume":"35","author":"RJ Kuo","year":"2011","unstructured":"Kuo R J, Han Y S. A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem\u2013a case study on supply chain model. Appl Math Model 2011;35(8):3905\u20133917.","journal-title":"Appl Math Model"},{"issue":"4","key":"9561_CR15","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1016\/j.camwa.2009.02.028","volume":"58","author":"RJ Kuo","year":"2009","unstructured":"Kuo R J, Huang C C. Application of particle swarm optimization algorithm for solving bi-level linear programming problem. Comput Math Appl 2009;58(4):678\u2013685.","journal-title":"Comput Math Appl"},{"issue":"5","key":"9561_CR16","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.1109\/TII.2017.2739339","volume":"13","author":"C Li","year":"2017","unstructured":"Li C, Xu Y, Yu X, Ryan C, Huang T. Risk-averse energy trading in multienergy microgrids: a two-stage stochastic game approach. IEEE Trans Indus Inf 2017;13(5):2620\u20132630.","journal-title":"IEEE Trans Indus Inf"},{"issue":"1","key":"9561_CR17","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/TSG.2016.2521377","volume":"8","author":"C Li","year":"2017","unstructured":"Li C, Yu X, Yu W, Chen G, Wang J. Efficient computation for sparse load shifting in demand side management. IEEE Trans Smart Grid 2017;8(1):250\u2013261.","journal-title":"IEEE Trans Smart Grid"},{"issue":"1","key":"9561_CR18","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0377-2217(94)90155-4","volume":"73","author":"Y-H Liu","year":"1994","unstructured":"Liu Y-H, Hart SM. Characterizing an optimal solution to the linear bilevel programming problem. Eur J Oper Res 1994;73(1):164\u2013166.","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9561_CR19","doi-asserted-by":"publisher","first-page":"49","DOI":"10.5430\/air.v5n1p49","volume":"5","author":"Y Lv","year":"2015","unstructured":"Lv Y, Wan Z. Solving linear bilevel programs via a new neural network. Artif Intell Res 2015;5(1):49.","journal-title":"Artif Intell Res"},{"issue":"1","key":"9561_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ro\/1994280100011","volume":"28","author":"R Mathieu","year":"1994","unstructured":"Mathieu R, Pittard L, Anandalingam G. Genetic algorithm based approach to bi-level linear programming. Oper Res 1994;28(1):1\u201321.","journal-title":"Oper Res"},{"issue":"1","key":"9561_CR21","first-page":"39","volume":"4","author":"N Safaei","year":"2014","unstructured":"Safaei N, Saraj M. A new method for solving fully fuzzy linear bi-level programming problems. Int J Appl Oper Res 2014;4(1):39\u201346.","journal-title":"Int J Appl Oper Res"},{"key":"9561_CR22","doi-asserted-by":"crossref","unstructured":"Siddique N, Adeli H. Nature-inspired chemical reaction optimisation algorithms. Cogn Comput. 2017:1\u201312.","DOI":"10.1201\/9781315118628"},{"issue":"2","key":"9561_CR23","first-page":"125","volume":"42","author":"Ue-Pyng Wen","year":"1991","unstructured":"Wen U-P, Hsu S-T. Linear bi-level programming problems\u2013a review. J Oper Res Soc. 1991:125\u2013133.","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"9561_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0305-0548(90)90037-8","volume":"17","author":"U-P Wen","year":"1990","unstructured":"Wen U-P, Yang YH. Algorithms for solving the mixed integer two-level linear programming problem. Comput Oper Res 1990;17(2):133\u2013142.","journal-title":"Comput Oper Res"},{"issue":"4","key":"9561_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"DJ White","year":"1993","unstructured":"White DJ, Anandalingam G. A penalty function approach for solving bi-level linear programs. J Glob Optim 1993;3(4):397\u2013419.","journal-title":"J Glob Optim"},{"issue":"10","key":"9561_CR26","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s00521-016-2605-0","volume":"29","author":"F Zhang","year":"2018","unstructured":"Zhang F, Yang C, Zhou X, Gui W. Fractional-order pid controller tuning using continuous state transition algorithm 2006:1\u201310. Neural Comput Applic 2018;29(10):795\u2013804.","journal-title":"Neural Comput Applic"},{"issue":"7","key":"9561_CR27","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1080\/02331934.2016.1154553","volume":"65","author":"Y Zheng","year":"2016","unstructured":"Zheng Y, Fang D, Wan Z. A solution approach to the weak linear bilevel programming problems. Optimization 2016;65(7):1437\u20131449.","journal-title":"Optimization"},{"issue":"4","key":"9561_CR28","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1080\/0305215X.2015.1025775","volume":"48","author":"X Zhou","year":"2016","unstructured":"Zhou X, Gao DY, Simpson AR. Optimal design of water distribution networks by a discrete state transition algorithm. Eng Optim 2016;48(4):603\u2013628.","journal-title":"Eng Optim"},{"key":"9561_CR29","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1016\/j.neucom.2015.08.041","volume":"173","author":"X Zhou","year":"2016","unstructured":"Zhou X, Gao DY, Yang C, Gui W. Discrete state transition algorithm for unconstrained integer optimization problems. Neurocomputing 2016;173:864\u2013874.","journal-title":"Neurocomputing"},{"key":"9561_CR30","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.neucom.2017.08.010","volume":"273","author":"X Zhou","year":"2018","unstructured":"Zhou X, Shi P, Lim C-C, Yang C, Gui W. A dynamic state transition algorithm with application to sensor network localization. Neurocomputing 2018;273:237\u2013250.","journal-title":"Neurocomputing"},{"issue":"4","key":"9561_CR31","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.3934\/jimo.2012.8.1039","volume":"8","author":"X Zhou","year":"2012","unstructured":"Zhou X, Yang C, Gui W. State transition algorithm. J Indus Manag Optim 2012;8(4):1039\u20131056.","journal-title":"J Indus Manag Optim"},{"key":"9561_CR32","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.amc.2013.09.055","volume":"226","author":"X Zhou","year":"2014","unstructured":"Zhou X, Yang C, Gui W. Nonlinear system identification and control using state transition algorithm. Appl Math Comput 2014;226:169\u2013179.","journal-title":"Appl Math Comput"}],"container-title":["Cognitive Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12559-018-9561-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-018-9561-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12559-018-9561-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T22:24:50Z","timestamp":1604269490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12559-018-9561-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,12]]},"references-count":32,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["9561"],"URL":"https:\/\/doi.org\/10.1007\/s12559-018-9561-1","relation":{},"ISSN":["1866-9956","1866-9964"],"issn-type":[{"value":"1866-9956","type":"print"},{"value":"1866-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,12]]},"assertion":[{"value":"20 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2018","order":3,"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":"<!--Emphasis Type='Bold' removed-->Conflict of Interest"}},{"value":"This article does not contain any experiments with human or animal participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}]}}