{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T16:11:14Z","timestamp":1781194274497,"version":"3.54.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key Research and Development Program of China","award":["2016YFB0800601"],"award-info":[{"award-number":["2016YFB0800601"]}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61472331"],"award-info":[{"award-number":["61472331"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61772434"],"award-info":[{"award-number":["61772434"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61806169"],"award-info":[{"award-number":["61806169"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00500-019-04445-x","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T23:20:04Z","timestamp":1572045604000},"page":"9161-9178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A two-layer algorithm based on PSO for solving unit commitment problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Yu","family":"Zhai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3372-9207","authenticated-orcid":false,"given":"Xiaofeng","family":"Liao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nankun","family":"Mu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junqing","family":"Le","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"key":"4445_CR1","doi-asserted-by":"publisher","unstructured":"Balasubramanian KP, Santhi RK (2016) Best compromised schedule for multi-objective unit commitment problems. Indian J Sci Technol 9(2). \nhttps:\/\/doi.org\/10.17485\/ijst\/2016\/v9i2\/80998","DOI":"10.17485\/ijst\/2016\/v9i2\/80998"},{"issue":"4","key":"4445_CR2","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1109\/AIEEPAS.1959.4500539","volume":"78","author":"CJ Baldwin","year":"1959","unstructured":"Baldwin CJ, Dale KM, Dittrich RF (1959) A study of the economic shutdown of generating units in daily dispatch. Trans Am Inst Electr Eng Part III: Power Appar Syst 78(4):1272\u20131282. \nhttps:\/\/doi.org\/10.1109\/AIEEPAS.1959.4500539","journal-title":"Trans Am Inst Electr Eng Part III: Power Appar Syst"},{"issue":"1","key":"4445_CR3","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1016\/j.ijepes.2012.06.014","volume":"43","author":"S Chakraborty","year":"2012","unstructured":"Chakraborty S, Ito T, Senjyu T, Saber AY (2012) Unit commitment strategy of thermal generators by using advanced fuzzy controlled binary particle swarm optimization algorithm. Int J Electr Power Energy Syst 43(1):1072\u20131080","journal-title":"Int J Electr Power Energy Syst"},{"issue":"1","key":"4445_CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ijepes.2010.06.022","volume":"33","author":"K Chandram","year":"2011","unstructured":"Chandram K, Subrahmanyam N, Sydulu M (2011) Unit commitment by improved pre-prepared power demand table and muller method. Int J Electr Power Energy Syst 33(1):106\u2013114","journal-title":"Int J Electr Power Energy Syst"},{"issue":"1","key":"4445_CR5","doi-asserted-by":"crossref","first-page":"921","DOI":"10.1016\/j.ijepes.2012.06.004","volume":"43","author":"K Chandrasekaran","year":"2012","unstructured":"Chandrasekaran K, Simon SP (2012) Network and reliability constrained unit commitment problem using binary real coded firefly algorithm. Int J Electr Power Energy Syst 43(1):921\u2013932","journal-title":"Int J Electr Power Energy Syst"},{"issue":"6","key":"4445_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ins.2014.08.039","volume":"291","author":"R Cheng","year":"2015","unstructured":"Cheng R, Jin Y (2015) A social learning particle swarm optimization algorithm for scalable optimization. Inf Sci 291(6):43\u201360","journal-title":"Inf Sci"},{"issue":"2","key":"4445_CR7","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/59.867163","volume":"15","author":"CP Cheng","year":"2000","unstructured":"Cheng CP, Liu CW, Liu CC (2000) Unit commitment by lagrangian relaxation and genetic algorithms. IEEE Trans Power Syst 15(2):707\u2013714","journal-title":"IEEE Trans Power Syst"},{"issue":"2","key":"4445_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0142-0615(01)00024-2","volume":"24","author":"CP Cheng","year":"2002","unstructured":"Cheng CP, Liu CW, Liu CC (2002) Unit commitment by annealing\u2013genetic algorithm. Int J Electr Power Energy Syst 24(2):149\u2013158","journal-title":"Int J Electr Power Energy Syst"},{"issue":"2","key":"4445_CR9","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1109\/TPWRS.2010.2059716","volume":"26","author":"CY Chung","year":"2011","unstructured":"Chung CY, Yu H, Wong KP (2011) An advanced quantum-inspired evolutionary algorithm for unit commitment. IEEE Trans Power Syst 26(2):847\u2013854","journal-title":"IEEE Trans Power Syst"},{"key":"4445_CR10","unstructured":"Chusanapiputt S, Nualhong D, Jantarang S, Phoomvuthisarn S (2009) A solution to unit commitment problem using hybrid ant system\/priority list method. In: IEEE international power and energy conference, 2008. Pecon 2008, pp 1183\u20131188"},{"issue":"2","key":"4445_CR11","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TPWRS.2003.821625","volume":"19","author":"IG Damousis","year":"2004","unstructured":"Damousis IG, Bakirtzis AG, Dokopoulos PS (2004) A solution to the unit-commitment problem using integer-coded genetic algorithm. IEEE Trans Power Syst 19(2):1165\u20131172. \nhttps:\/\/doi.org\/10.1109\/TPWRS.2003.821625","journal-title":"IEEE Trans Power Syst"},{"issue":"8","key":"4445_CR12","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1080\/15325008.2018.1510445","volume":"46","author":"JS Dhaliwal","year":"2018","unstructured":"Dhaliwal JS, Dhillon JS (2018) Modified binary differential evolution algorithm to solve unit commitment problem. Electr Power Compon Syst 46(8):900\u2013918. \nhttps:\/\/doi.org\/10.1080\/15325008.2018.1510445","journal-title":"Electr Power Compon Syst"},{"key":"4445_CR13","unstructured":"Eldin AS, El-Sayed MAH, Youssef HKM (2008) A two-stage genetic based technique for the unit commitment optimization problem. In: International middle-east power system conference, 2008. Mepcon 2008, pp 425\u2013430"},{"key":"4445_CR14","first-page":"1","volume":"1","author":"A Franz","year":"2018","unstructured":"Franz A, Rieck J, Zimmermann J (2018) Fix-and-optimize procedures for solving the long-term unit commitment problem with pumped storages. Ann Oper Res 1:1\u201325","journal-title":"Ann Oper Res"},{"key":"4445_CR15","doi-asserted-by":"publisher","unstructured":"Ghasemi M, Akbari E, Rahimnejad A, Razavi SE, Ghavidel S, Li L (2018) Phasor particle swarm optimization: a simple and efficient variant of PSO. Soft Comput. \nhttps:\/\/doi.org\/10.1007\/s00500-018-3536-8","DOI":"10.1007\/s00500-018-3536-8"},{"issue":"3","key":"4445_CR16","doi-asserted-by":"crossref","first-page":"323","DOI":"10.5370\/JEET.2009.4.3.323","volume":"4","author":"YW Jeong","year":"2009","unstructured":"Jeong YW, Lee WN, Kim HH, Park JB, Shin JR (2009) Thermal unit commitment using binary differential evolution. J Electr Eng Technol 4(3):323\u2013329","journal-title":"J Electr Eng Technol"},{"issue":"3","key":"4445_CR17","doi-asserted-by":"crossref","first-page":"1486","DOI":"10.1109\/TPWRS.2010.2042472","volume":"25","author":"YW Jeong","year":"2010","unstructured":"Jeong YW, Park JB, Jang SH, Lee KY (2010) A new quantum-inspired binary PSO: application to unit commitment problems for power systems. IEEE Trans Power Syst 25(3):1486\u20131495","journal-title":"IEEE Trans Power Syst"},{"issue":"4","key":"4445_CR18","doi-asserted-by":"crossref","first-page":"1452","DOI":"10.1109\/59.801925","volume":"14","author":"KA Juste","year":"1999","unstructured":"Juste KA, Kita H, Tanaka E, Hasegawa J (1999) An evolutionary programming solution to the unit commitment problem. IEEE Trans Power Syst 14(4):1452\u20131459","journal-title":"IEEE Trans Power Syst"},{"issue":"7","key":"4445_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00521-015-2124-4","volume":"28","author":"VK Kamboj","year":"2017","unstructured":"Kamboj VK, Bath SK, Dhillon JS (2017) A novel hybrid de-random search approach for unit commitment problem. Neural Comput Appl 28(7):1\u201323","journal-title":"Neural Comput Appl"},{"issue":"1","key":"4445_CR20","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/59.485989","volume":"11","author":"SA Kazarlis","year":"1996","unstructured":"Kazarlis SA, Bakirtzis AG, Petridis V (1996) A genetic algorithm solution to the unit commitment problem. IEEE Trans Power Syst 11(1):83\u201392","journal-title":"IEEE Trans Power Syst"},{"key":"4445_CR21","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: IEEE international conference on neural networks, 1995. Proceedings, vol 4, pp 1942\u20131948"},{"key":"4445_CR22","unstructured":"Kennedy J, Eberhart RC (2002) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on systems, man, and cybernetics, 1997. Computational cybernetics and simulation, vol 5, pp 4104\u20134108"},{"issue":"7","key":"4445_CR23","doi-asserted-by":"crossref","first-page":"3072","DOI":"10.1016\/j.energy.2010.03.049","volume":"35","author":"S Khanmohammadi","year":"2010","unstructured":"Khanmohammadi S, Amiri M, Haque MT (2010) A new three-stage method for solving unit commitment problem. Energy 35(7):3072\u20133080","journal-title":"Energy"},{"key":"4445_CR24","doi-asserted-by":"publisher","unstructured":"Kumar V, Kumar D (2018) Binary whale optimization algorithm and its application to unit commitment problem. Neural Comput Appl. \nhttps:\/\/doi.org\/10.1007\/s00521-018-3796-3","DOI":"10.1007\/s00521-018-3796-3"},{"key":"4445_CR25","volume-title":"Binary particle swarm optimization with bit change mutation","author":"S Lee","year":"2007","unstructured":"Lee S, Park H, Jeon M (2007) Binary particle swarm optimization with bit change mutation. Oxford University Press, Oxford"},{"issue":"10","key":"4445_CR26","doi-asserted-by":"crossref","first-page":"2350","DOI":"10.1109\/TCYB.2015.2424836","volume":"45","author":"J Li","year":"2017","unstructured":"Li J, Zhang JQ, Jiang CJ, Zhou MC (2017) Composite particle swarm optimizer with historical memory for function optimization. IEEE Trans Cybern 45(10):2350\u20132363","journal-title":"IEEE Trans Cybern"},{"key":"4445_CR27","doi-asserted-by":"crossref","unstructured":"Ling Y, Li H, Cao B (2016) Cooperative co-evolution with graph-based differential grouping for large scale global optimization. In: International conference on natural computation, fuzzy systems and knowledge discovery, pp 95\u2013102","DOI":"10.1109\/FSKD.2016.7603157"},{"key":"4445_CR28","unstructured":"Liu Y, Yao X, Zhao Q, Higuchi T (2001) Scaling up fast evolutionary programming with cooperative coevolution. In: Proceedings of the 2001 congress on evolutionary computation, 2001. vol 2, pp 1101\u20131108"},{"key":"4445_CR29","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/j.ins.2014.10.042","volume":"295","author":"S Mahdavi","year":"2015","unstructured":"Mahdavi S, Shiri ME, Rahnamayan S (2015) Metaheuristics in large-scale global continues optimization: a survey. Inf Sci 295:407\u2013428","journal-title":"Inf Sci"},{"issue":"3","key":"4445_CR30","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/59.536120","volume":"11","author":"TT Maifeld","year":"1996","unstructured":"Maifeld TT, Sheble GB (1996) Genetic-based unit commitment algorithm. IEEE Trans Power Syst 11(3):1359\u20131370","journal-title":"IEEE Trans Power Syst"},{"issue":"7","key":"4445_CR31","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1002\/etep.1633","volume":"23","author":"T Niknam","year":"2013","unstructured":"Niknam T, Narimani MR, Jabbari M (2013) Dynamic optimal power flow using hybrid particle swarm optimization and simulated annealing. Int Trans Electr Energy Syst 23(7):975\u20131001","journal-title":"Int Trans Electr Energy Syst"},{"issue":"1","key":"4445_CR32","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/TPWRS.2003.820707","volume":"19","author":"W Ongsakul","year":"2004","unstructured":"Ongsakul W, Petcharaks N (2004) Unit commitment by enhanced adaptive lagrangian relaxation. IEEE Trans Power Syst 19(1):620\u2013628","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"4445_CR33","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/59.119267","volume":"6","author":"Z Ouyang","year":"1991","unstructured":"Ouyang Z, Shahidehpour SM (1991) An intelligent dynamic programming for unit commitment application. IEEE Trans Power Syst 6(3):1203\u20131209","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"4445_CR34","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1109\/TPAS.1981.316592","volume":"100","author":"CK Pang","year":"1981","unstructured":"Pang CK, Sheble GB, Albuyeh F (1981) Evaluation of dynamic programming based methods and multiple area representation for thermal unit commitments. IEEE Trans Power Syst PAS 100(3):1212\u20131218","journal-title":"IEEE Trans Power Syst PAS"},{"issue":"2","key":"4445_CR35","doi-asserted-by":"crossref","first-page":"87","DOI":"10.4018\/IJSIR.2015040104","volume":"6","author":"LK Panwar","year":"2015","unstructured":"Panwar LK, Reddy S, Kumar R (2015) Binary fireworks algorithm based thermal unit commitment. Int J Swarm Intell Res (IJSIR) 6(2):87\u2013101","journal-title":"Int J Swarm Intell Res (IJSIR)"},{"key":"4445_CR36","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.swevo.2017.08.002","volume":"38","author":"LK Panwar","year":"2018","unstructured":"Panwar LK, Reddy S, Verma A, Panigrahi BK, Kumar R (2018) Binary grey wolf optimizer for large scale unit commitment problem. Swarm Evolut Comput 38:251\u2013266","journal-title":"Swarm Evolut Comput"},{"issue":"10","key":"4445_CR37","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1109\/TCYB.2015.2474153","volume":"46","author":"Q Qin","year":"2016","unstructured":"Qin Q, Cheng S, Zhang Q, Li L, Shi Y (2016) Particle swarm optimization with interswarm interactive learning strategy. IEEE Trans Cybern 46(10):2238\u20132251","journal-title":"IEEE Trans Cybern"},{"key":"4445_CR38","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.ijepes.2016.04.005","volume":"83","author":"KS Reddy","year":"2016","unstructured":"Reddy KS, Panwar LK, Kumar R, Panigrahi BK (2016) Binary fireworks algorithm for profit based unit commitment (PBUC) problem. Int J Electr Power Energy Syst 83:270\u2013282","journal-title":"Int J Electr Power Energy Syst"},{"issue":"4","key":"4445_CR39","first-page":"85","volume":"53","author":"PK Roy","year":"2013","unstructured":"Roy PK (2013) Solution of unit commitment problem using gravitational search algorithm. Int J Electr Power Energy Syst 53(4):85\u201394","journal-title":"Int J Electr Power Energy Syst"},{"key":"4445_CR40","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/j.energy.2016.10.082","volume":"117","author":"NA Saber","year":"2016","unstructured":"Saber NA, Salimi M, Mirabbasi D (2016) A priority list based approach for solving thermal unit commitment problem with novel hybrid genetic-imperialist competitive algorithm. Energy 117:272\u2013280","journal-title":"Energy"},{"issue":"1","key":"4445_CR41","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TPWRS.2014.2383911","volume":"31","author":"S S\u00e9guin","year":"2016","unstructured":"S\u00e9guin S, C\u00f4t\u00e9 P, Audet C (2016) Self-scheduling short-term unit commitment and loading problem. IEEE Trans Power Syst 31(1):133\u2013142","journal-title":"IEEE Trans Power Syst"},{"key":"4445_CR42","doi-asserted-by":"crossref","unstructured":"Senjyu T, Yamashiro H, Uezato K, Funabashi T (2002) A unit commitment problem by using genetic algorithm based on unit characteristic classification. In: Power engineering society winter meeting, vol 1, pp 58\u201363","DOI":"10.1109\/PESW.2002.984954"},{"issue":"2","key":"4445_CR43","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1109\/TPAS.1980.319654","volume":"99","author":"RR Shoults","year":"2007","unstructured":"Shoults RR, Chang SK, Helmick S, Grady WM (2007) A practical approach to unit commitment, economic dispatch and savings allocation for multiple-area pool operation with import\/export constraints. IEEE Trans Power Appar Syst PAS 99(2):625\u2013635","journal-title":"IEEE Trans Power Appar Syst PAS"},{"issue":"1","key":"4445_CR44","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TPWRS.2005.860922","volume":"21","author":"DN Simopoulos","year":"2006","unstructured":"Simopoulos DN, Kavatza SD, Vournas CD (2006) Unit commitment by an enhanced simulated annealing algorithm. IEEE Trans Power Syst 21(1):68\u201376","journal-title":"IEEE Trans Power Syst"},{"key":"4445_CR45","first-page":"298","volume":"25","author":"RK Srikanth","year":"2017","unstructured":"Srikanth RK, Panwar LK, Panigrahi BK, Kumar R (2017) Solution to unit commitment in power system operation planning using binary coded modified moth flame optimization algorithm (bmmfoa): A flame selection based computational technique. J Comput Sci 25:298\u2013317","journal-title":"J Comput Sci"},{"key":"4445_CR46","doi-asserted-by":"crossref","unstructured":"Sriyanyong P, Song YH (2005) Unit commitment using particle swarm optimization combined with lagrange relaxation. In: Power engineering society general meeting, vol 3, pp 2752\u20132759","DOI":"10.1109\/PES.2005.1489390"},{"key":"4445_CR47","doi-asserted-by":"crossref","unstructured":"Sudibyo S, Murat MN, Aziz N (2015) Simulated annealing-particle swarm optimization (SA-PSO): particle distribution study and application in neural wiener-based NMPC. In: Control conference","DOI":"10.1109\/ASCC.2015.7244567"},{"key":"4445_CR48","first-page":"1","volume":"2","author":"VA Tsalavoutis","year":"2018","unstructured":"Tsalavoutis VA, Vrionis CG, Tolis AI (2018) Optimizing a unit commitment problem using an evolutionary algorithm and a plurality of priority lists. Oper Res 2:1\u201354","journal-title":"Oper Res"},{"key":"4445_CR49","volume-title":"A seeded memetic algorithm for large unit commitment problems","author":"J Valenzuela","year":"2002","unstructured":"Valenzuela J, Smith AE (2002) A seeded memetic algorithm for large unit commitment problems. Kluwer Academic Publishers, Dordrecht"},{"key":"4445_CR50","first-page":"16","volume":"04","author":"Z Wang","year":"2004","unstructured":"Wang Z, Yu YX, Zhang HP (2004) Social evolutionary programming based unit commitment. Proc CSEE 04:16\u201321","journal-title":"Proc CSEE"},{"key":"4445_CR51","doi-asserted-by":"crossref","unstructured":"Wang B, Li Y, Watada J (2011) Re-scheduling the unit commitment problem in fuzzy environment. In: IEEE international conference on fuzzy systems, pp 1090\u20131095","DOI":"10.1109\/FUZZY.2011.6007313"},{"issue":"3","key":"4445_CR52","first-page":"90","volume":"37","author":"AJ Wood","year":"1996","unstructured":"Wood AJ (1996) Power generation operation and control. Fuel Energy Abstr 37(3):90\u201393","journal-title":"Fuel Energy Abstr"},{"key":"4445_CR53","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/j.ijepes.2014.03.061","volume":"61","author":"Y Xiang","year":"2014","unstructured":"Xiang Y, Zhang X (2014) Unit commitment using lagrangian relaxation and particle swarm optimization. Int J Electr Power Energy Syst 61:510\u2013522","journal-title":"Int J Electr Power Energy Syst"},{"key":"4445_CR54","unstructured":"Yang T, Ting TO (2008) Methodological priority list for unit commitment problem. In: International conference on computer science and software engineering, pp 176\u2013179"},{"issue":"9","key":"4445_CR55","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1109\/TCYB.2016.2616170","volume":"47","author":"Q Yang","year":"2016","unstructured":"Yang Q, Chen WN, Gu T, Zhang H, Deng JD, Li Y, Zhang J (2016) Segment-based predominant learning swarm optimizer for large-scale optimization. IEEE Trans Cybern 47(9):2896\u20132910","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"4445_CR56","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/TEVC.2017.2743016","volume":"22","author":"Q Yang","year":"2018","unstructured":"Yang Q, Chen WN, Deng JD, Li Y, Gu T, Zhang J (2018) A level-based learning swarm optimizer for large-scale optimization. IEEE Trans Evolut Comput 22(4):578\u2013594","journal-title":"IEEE Trans Evolut Comput"},{"key":"4445_CR57","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.energy.2016.05.057","volume":"109","author":"J Zhang","year":"2016","unstructured":"Zhang J, Tang Q, Chen Y, Lin S (2016) A hybrid particle swarm optimization with small population size to solve the optimal short-term hydro-thermal unit commitment problem. Energy 109:765\u2013780","journal-title":"Energy"},{"issue":"7","key":"4445_CR58","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1007\/s00500-013-1153-0","volume":"18","author":"X Zuo","year":"2014","unstructured":"Zuo X, Xiao L (2014) A DE and PSO based hybrid algorithm for dynamic optimization problems. Soft Comput 18(7):1405\u20131424","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04445-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T23:19:35Z","timestamp":1603495175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04445-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":58,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["4445"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04445-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,25]]},"assertion":[{"value":"25 October 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 approval"}}]}}