{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T00:17:42Z","timestamp":1772842662278,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T00:00:00Z","timestamp":1679356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100011174","name":"State Key Laboratory of Biogeology and Environmental Geology","doi-asserted-by":"publisher","award":["No. GBL21801"],"award-info":[{"award-number":["No. GBL21801"]}],"id":[{"id":"10.13039\/501100011174","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["No. 61972136"],"award-info":[{"award-number":["No. 61972136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Hubei Provincial Department of Education Outstanding Youth Scientific Innovation Team Support Foundation","award":["No. T201410"],"award-info":[{"award-number":["No. T201410"]}]},{"name":"Education Bureau of Hunan Province of China","award":["No.15B061"],"award-info":[{"award-number":["No.15B061"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,9]]},"DOI":"10.1007\/s10489-023-04527-2","type":"journal-article","created":{"date-parts":[[2023,3,21]],"date-time":"2023-03-21T04:37:17Z","timestamp":1679373437000},"page":"19922-19939","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hybridizing genetic algorithm with grey prediction evolution algorithm for solving unit commitment problem"],"prefix":"10.1007","volume":"53","author":[{"given":"Wangyu","family":"Tong","sequence":"first","affiliation":[]},{"given":"Di","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhongbo","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Qinghua","family":"Su","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,21]]},"reference":[{"key":"4527_CR1","unstructured":"Wood AJ, Wollenberg BF, Shebl\u00e9 GB (2013) Power generation operation and control. Wiley"},{"issue":"2","key":"4527_CR2","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1109\/TPWRS.2003.811000","volume":"18","author":"T Senjyu","year":"2003","unstructured":"Senjyu T, Shimabukuro K, Uezato K, Funabashi T (2003) A fast technique for unit commitment problem by extended priority list. IEEE Trans Power Syst 18(2):882\u2013888","journal-title":"IEEE Trans Power Syst"},{"issue":"3","key":"4527_CR3","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/59.119267","volume":"6","author":"Z Ouyang","year":"1991","unstructured":"Ouyang Z, Shahidehpour S (1991) An intelligent dynamic programming for unit commitment application. IEEE Trans Power Syst 6(3):1203\u20131209","journal-title":"IEEE Trans Power Syst"},{"key":"4527_CR4","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TPAS.1983.317714","volume":"2","author":"AI Cohen","year":"1983","unstructured":"Cohen AI, Yoshimura M (1983) A branch-and-bound algorithm for unit commitment. IEEE Trans Power Appar Syst 2:444\u2013451","journal-title":"IEEE Trans Power Appar Syst"},{"issue":"12","key":"4527_CR5","doi-asserted-by":"crossref","first-page":"1968","DOI":"10.1109\/TPAS.1968.292156","volume":"PAS-87","author":"JA Muckstadt","year":"1968","unstructured":"Muckstadt JA, Wilson RC (1968) An application of mixed-integer programming duality to scheduling thermal generating systems. IEEE Trans Power Appar Syst PAS-87(12):1968\u20131978","journal-title":"IEEE Trans Power Appar Syst"},{"issue":"1","key":"4527_CR6","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":"Complete","key":"4527_CR7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.ins.2013.06.022","volume":"249","author":"K Chandrasekaran","year":"2013","unstructured":"Chandrasekaran K, Simon SP, Padhy NP (2013) Binary real coded firefly algorithm for solving unit commitment problem. Inf Sci 249(Complete):67\u201384","journal-title":"Inf Sci"},{"key":"4527_CR8","doi-asserted-by":"crossref","unstructured":"Song X, Zhang Y, Gong D, Gao X (2021) A fast hybrid feature selection based on correlation-guided clustering and particle swarm optimization for high-dimensional data. IEEE Trans Cybernet","DOI":"10.1109\/TCYB.2021.3061152"},{"key":"4527_CR9","doi-asserted-by":"crossref","unstructured":"Ji X, Zhang Y, Gong D, Sun X (2021) Dual-surrogate assisted cooperative particle swarm optimization for expensive multimodal problems. IEEE Trans Evol Comput","DOI":"10.1109\/TEVC.2021.3064835"},{"issue":"2","key":"4527_CR10","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1109\/TCYB.2020.3015756","volume":"51","author":"Y Hu","year":"2020","unstructured":"Hu Y, Zhang Y, Gong D (2020) Multiobjective particle swarm optimization for feature selection with fuzzy cost. IEEE Trans Cybernet 51(2):874\u2013888","journal-title":"IEEE Trans Cybernet"},{"issue":"2","key":"4527_CR11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1177\/0734242X19865782","volume":"38","author":"E Babaee Tirkolaee","year":"2020","unstructured":"Babaee Tirkolaee E, Mahdavi I, Seyyed Esfahani MM, Weber G-W (2020) A hybrid augmented ant colony optimization for the multi-trip capacitated arc routing problem under fuzzy demands for urban solid waste management. Waste Manag Res 38(2):156\u2013172","journal-title":"Waste Manag Res"},{"issue":"1","key":"4527_CR12","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/59.485989","volume":"11","author":"SA Kazarlis","year":"1996","unstructured":"Kazarlis SA, Bakirtzis AG (1996) A genetic algorithm solution to the unit commitment problem. IEEE Trans Power Syst 11(1):83\u201392","journal-title":"IEEE Trans Power Syst"},{"issue":"1","key":"4527_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s00500-010-0541-y","volume":"15","author":"X Yuan","year":"2011","unstructured":"Yuan X, Su A, Nie H, Yuan Y, Wang L (2011) Unit commitment problem using enhanced particle swarm optimization algorithm. Soft Comput 15(1):139\u2013148","journal-title":"Soft Comput"},{"issue":"Complete","key":"4527_CR14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/j.asoc.2014.05.029","volume":"22","author":"X Yuan","year":"2014","unstructured":"Yuan X, Ji S, Zhang B, Tian H, Hou Y (2014) A new approach for unit commitment problem via binary gravitational search algorithm. Appl Soft Comput 22(Complete):249\u2013260","journal-title":"Appl Soft Comput"},{"key":"4527_CR15","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 Evol Comput 38:251\u2013266","journal-title":"Swarm Evol Comput"},{"key":"4527_CR16","doi-asserted-by":"crossref","first-page":"43535","DOI":"10.1109\/ACCESS.2018.2861319","volume":"6","author":"J Zhao","year":"2018","unstructured":"Zhao J, Liu S, Zhou M, Guo X, Qi L (2018) An improved binary cuckoo search algorithm for solving unit commitment problems: Methodological description. IEEE Access 6:43535\u201343545","journal-title":"IEEE Access"},{"issue":"5","key":"4527_CR17","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0142-0615(01)00048-5","volume":"24","author":"W Xing","year":"2002","unstructured":"Xing W, Wu FF (2002) Genetic algorithm based unit commitment with energy contracts. Int J Electr Power Energy Syst 24(5):329\u2013336","journal-title":"Int J Electr Power Energy Syst"},{"issue":"2","key":"4527_CR18","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Power Syst"},{"issue":"1","key":"4527_CR19","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1109\/TPWRS.2005.860907","volume":"21","author":"TO Ting","year":"2006","unstructured":"Ting TO, Rao MVC, Loo CK (2006) A novel approach for unit commitment problem via an effective hybrid particle swarm optimization. IEEE Trans Power Syst 21(1):411\u2013418","journal-title":"IEEE Trans Power Syst"},{"issue":"1","key":"4527_CR20","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.epsr.2011.09.022","volume":"84","author":"K Chandrasekaran","year":"2012","unstructured":"Chandrasekaran K, Hemamalini S, Simon SP, Padhy NP (2012) Thermal unit commitment using binary\/real coded artificial bee colony algorithm. Electr Power Syst Res 84(1):109\u2013119","journal-title":"Electr Power Syst Res"},{"key":"4527_CR21","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.swevo.2015.04.001","volume":"23","author":"A Trivedi","year":"2015","unstructured":"Trivedi A, Srinivasan D, Biswas S, Reindl T (2015) Hybridizing genetic algorithm with differential evolution for solving the unit commitment scheduling problem. Swarm Evol Comput 23:50\u2013 64","journal-title":"Swarm Evol Comput"},{"key":"4527_CR22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/j.ins.2016.03.023","volume":"354","author":"A Trivedi","year":"2016","unstructured":"Trivedi A, Srinivasan D, Biswas S, Reindl T (2016) A genetic algorithm\u2013differential evolution based hybrid framework: case study on unit commitment scheduling problem. Inf Sci 354:275\u2013300","journal-title":"Inf Sci"},{"issue":"1","key":"4527_CR23","doi-asserted-by":"crossref","first-page":"829","DOI":"10.4314\/ijest.v2i1.59085","volume":"2","author":"M Sudhakaran","year":"2010","unstructured":"Sudhakaran M, Raj P-D-V (2010) Integrating genetic algorithms and tabu search for unit commitment problem. Int J Eng Sci Technol 2(1):829\u2013836","journal-title":"Int J Eng Sci Technol"},{"issue":"9","key":"4527_CR24","doi-asserted-by":"crossref","first-page":"3873","DOI":"10.1016\/j.asoc.2013.05.002","volume":"13","author":"D Datta","year":"2013","unstructured":"Datta D (2013) Unit commitment problem with ramp rate constraint using a binary-real-coded genetic algorithm. Appl Soft Comput 13(9):3873\u20133883","journal-title":"Appl Soft Comput"},{"key":"4527_CR25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.apm.2019.10.026","volume":"79","author":"Z Hu","year":"2020","unstructured":"Hu Z, Xu X, Su Q, Zhu H, Guo J (2020) Grey prediction evolution algorithm for global optimization. Appl Math Model 79:145\u2013 160","journal-title":"Appl Math Model"},{"issue":"3","key":"4527_CR26","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2005.857695","volume":"10","author":"PP Bonissone","year":"2006","unstructured":"Bonissone PP, Subbu R, Eklund N, Kiehl TR (2006) Evolutionary algorithms+ domain knowledge = real-world evolutionary computation. IEEE Trans Evol Comput 10(3):256\u2013280","journal-title":"IEEE Trans Evol Comput"},{"key":"4527_CR27","doi-asserted-by":"crossref","first-page":"30745","DOI":"10.1109\/ACCESS.2020.2973197","volume":"8","author":"CY Dai","year":"2020","unstructured":"Dai CY, Hu ZB, Li Z, Xiong ZG, Su QH (2020) An improved grey prediction evolution algorithm based on topological opposition-based learning. IEEE Access 8:30745\u201330762","journal-title":"IEEE Access"},{"key":"4527_CR28","first-page":"89","volume":"106086","author":"X Xu","year":"2020","unstructured":"Xu X, Hu ZB, Su QH, Li YX, Dai JH (2020) Multivariable grey prediction evolution algorithm: a new metaheuristic. Appl Soft Comput 106086:89","journal-title":"Appl Soft Comput"},{"key":"4527_CR29","doi-asserted-by":"crossref","first-page":"84162","DOI":"10.1109\/ACCESS.2020.2992116","volume":"8","author":"Z Hu","year":"2020","unstructured":"Hu Z, Li Z, Dai C, Xu X, Xiong Z, Su Q (2020) Multiobjective grey prediction evolution algorithm for environmental\/economic dispatch problem. IEEE Access 8:84162\u201384176","journal-title":"IEEE Access"},{"key":"4527_CR30","first-page":"176","volume":"114898","author":"ZB Hu","year":"2021","unstructured":"Hu ZB, Gao C, Su QH (2021) A novel evolutionary algorithm based on even difference grey model. Expert Syst Appl 114898:176","journal-title":"Expert Syst Appl"},{"key":"4527_CR31","first-page":"100","volume":"104173","author":"T Zhou","year":"2021","unstructured":"Zhou T, Hu ZB, Zhou Q, Yuan SX (2021) A novel grey prediction evolution algorithm for multimodal multiobjective optimization. Eng Appl Artif Intell 104173:100","journal-title":"Eng Appl Artif Intell"},{"key":"4527_CR32","doi-asserted-by":"crossref","first-page":"107941","DOI":"10.1109\/ACCESS.2020.3001194","volume":"8","author":"C Gao","year":"2020","unstructured":"Gao C, Hu ZB, Xiong ZG, Su QH (2020) Grey prediction evolution algorithm based on accelerated even grey model. IEEE Access 8:107941\u2013107957","journal-title":"IEEE Access"},{"key":"4527_CR33","doi-asserted-by":"crossref","first-page":"104454","DOI":"10.1016\/j.engappai.2021.104454","volume":"106","author":"G Cai","year":"2021","unstructured":"Cai G, Su Q, Hu Z (2021) Automated test case generation for path coverage by using grey prediction evolution algorithm with improved scatter search strategy. Eng Appl Artif Intell 106:104454","journal-title":"Eng Appl Artif Intell"},{"issue":"2-4","key":"4527_CR34","doi-asserted-by":"crossref","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-4):311\u2013338","journal-title":"Comput Methods Appl Mech Eng"},{"issue":"2","key":"4527_CR35","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1023\/A:1017960507177","volume":"8","author":"J Valenzuela","year":"2002","unstructured":"Valenzuela J, Smith AE (2002) A seeded memetic algorithm for large unit commitment problems. J Heuristics 8(2):173\u2013195","journal-title":"J Heuristics"},{"issue":"4","key":"4527_CR36","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/j.ijepes.2011.01.009","volume":"33","author":"K Abookazemi","year":"2011","unstructured":"Abookazemi K, Ahmad H, Tavakolpour A, Hassan MY (2011) Unit commitment solution using an optimized genetic system. Int J Electr Power Energy Syst 33(4):969\u2013975","journal-title":"Int J Electr Power Energy Syst"},{"issue":"3","key":"4527_CR37","first-page":"135","volume":"1","author":"K Abookazemi","year":"2009","unstructured":"Abookazemi K, Mustafa MW, Ahmad H (2009) Structured genetic algorithm technique for unit commitment problem. Int J Recent Trends Eng 1(3):135","journal-title":"Int J Recent Trends Eng"},{"key":"4527_CR38","first-page":"411","volume":"14","author":"HH Balci","year":"2004","unstructured":"Balci HH, Valenzuela JF (2004) Scheduling electric power generators using particle swarm optimization combined with the lagrangian relaxation method. Int J Appl Math Comput Sci 14:411\u2013421","journal-title":"Int J Appl Math Comput Sci"},{"issue":"2","key":"4527_CR39","doi-asserted-by":"crossref","first-page":"175","DOI":"10.15388\/Informatica.2010.281","volume":"21","author":"C-S Chang","year":"2010","unstructured":"Chang C-S (2010) An improved differential evolution scheme for the solution of large-scale unit commitment problems. Informatica 21(2):175\u2013190","journal-title":"Informatica"},{"issue":"2","key":"4527_CR40","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1109\/59.867163","volume":"15","author":"C-P Cheng","year":"2000","unstructured":"Cheng C-P, Liu C-W, Liu C-C (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":"4527_CR41","doi-asserted-by":"crossref","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","journal-title":"IEEE Trans Power Syst"},{"issue":"12","key":"4527_CR42","doi-asserted-by":"crossref","first-page":"4687","DOI":"10.1016\/j.apenergy.2011.06.009","volume":"88","author":"DK Dimitroulas","year":"2011","unstructured":"Dimitroulas DK, Georgilakis PS (2011) A new memetic algorithm approach for the price based unit commitment problem. Appl Energy 88(12):4687\u20134699","journal-title":"Appl Energy"},{"issue":"1","key":"4527_CR43","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":"4527_CR44","doi-asserted-by":"crossref","unstructured":"Juste AK, Kita H (1999) An evolutionary programming solution to the unit commitment problem. IEEE Trans Power Syst","DOI":"10.1109\/59.801925"},{"issue":"1","key":"4527_CR45","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.ijepes.2012.04.048","volume":"42","author":"D Datta","year":"2012","unstructured":"Datta D, Dutta S (2012) A binary-real-coded differential evolution for unit commitment problem. Int J Electr Power Energy Syst 42(1):517\u2013524","journal-title":"Int J Electr Power Energy Syst"},{"issue":"2","key":"4527_CR46","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 Int Res (IJSIR) 6(2):87\u2013101","journal-title":"Int J Swarm Int Res (IJSIR)"},{"key":"4527_CR47","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ijepes.2013.08.020","volume":"55","author":"B Saravanan","year":"2014","unstructured":"Saravanan B, Vasudevan E, Kothari D (2014) Unit commitment problem solution using invasive weed optimization algorithm. Int J Electr Power Energy Syst 55:21\u201328","journal-title":"Int J Electr Power Energy Syst"},{"issue":"1","key":"4527_CR48","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","volume":"1","author":"J Derrac","year":"2011","unstructured":"Derrac J, Garc\u00eda S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1(1):3\u201318","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"4527_CR49","doi-asserted-by":"crossref","first-page":"8049","DOI":"10.1016\/j.eswa.2008.10.047","volume":"36","author":"XH Yuan","year":"2009","unstructured":"Yuan XH, Nie H, Su AJ, Wang L, Yuan YB (2009) An improved binary particle swarm optimization for unit commitment problem. Expert Syst Appl 36(4):8049\u20138055","journal-title":"Expert Syst Appl"},{"key":"4527_CR50","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: 2002 IEEE power engineering society winter meeting. Conference proceedings (Cat. No. 02CH37309), vol. 1. IEEE, pp 58\u201363","DOI":"10.1109\/PESW.2002.984954"},{"issue":"3","key":"4527_CR51","doi-asserted-by":"crossref","first-page":"1503","DOI":"10.1109\/TPWRS.2009.2021220","volume":"24","author":"T Lau","year":"2009","unstructured":"Lau T, Chung C, Wong K, Chung T, Ho SL (2009) Quantum-inspired evolutionary algorithm approach for unit commitment. IEEE Trans Power Syst 24(3):1503\u20131512","journal-title":"IEEE Trans Power Syst"},{"issue":"7","key":"4527_CR52","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1080\/15325000902762331","volume":"37","author":"Y-W Jeong","year":"2009","unstructured":"Jeong Y-W, Park J-B, Shin J-R, Lee KY (2009) A thermal unit commitment approach using an improved quantum evolutionary algorithm. Electr Power Components Syst 37(7):770\u2013786","journal-title":"Electr Power Components Syst"},{"key":"4527_CR53","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/j.ijepes.2012.10.056","volume":"47","author":"R Jabr","year":"2013","unstructured":"Jabr R (2013) Rank-constrained semidefinite program for unit commitment. Int J Electr Power Energy Syst 47:13\u201320","journal-title":"Int J Electr Power Energy Syst"},{"issue":"7","key":"4527_CR54","doi-asserted-by":"crossref","first-page":"2785","DOI":"10.1007\/s00521-019-04598-8","volume":"32","author":"A Bhadoria","year":"2020","unstructured":"Bhadoria A, Marwaha S, Kamboj VK (2020) An optimum forceful generation scheduling and unit commitment of thermal power system using sine cosine algorithm. Neural Comput Appl 32(7):2785\u20132814","journal-title":"Neural Comput Appl"},{"key":"4527_CR55","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.ijepes.2018.12.043","volume":"108","author":"J Jian","year":"2019","unstructured":"Jian J, Zhang C, Yang L, Meng K (2019) A hierarchical alternating direction method of multipliers for fully distributed unit commitment. Int J Electr Power Energy Syst 108:204\u2013217","journal-title":"Int J Electr Power Energy Syst"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04527-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-04527-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-04527-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T11:31:10Z","timestamp":1694777470000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-04527-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,21]]},"references-count":55,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["4527"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-04527-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,21]]},"assertion":[{"value":"10 February 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Ethics approval and consent to participate"}},{"value":"The authors declare that they have no conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}