{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:53:05Z","timestamp":1743018785836,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031096761"},{"type":"electronic","value":"9783031096778"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09677-8_16","type":"book-chapter","created":{"date-parts":[[2022,6,25]],"date-time":"2022-06-25T18:33:51Z","timestamp":1656182031000},"page":"176-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Solving the Unit Commitment Problem with Improving Binary Particle Swarm Optimization"],"prefix":"10.1007","author":[{"given":"Jianhua","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abduladheem, I.A., Nasser, H.A.: Solving the unit commitment problem in large systems using hybrid PSO algorithms. IOP Conf. Ser. Mater. Sci. Eng. 1105(1) (2021)","DOI":"10.1088\/1757-899X\/1105\/1\/012007"},{"issue":"2","key":"16_CR2","first-page":"729","volume":"29","author":"P Guido","year":"2021","unstructured":"Guido, P., de Souza Mauricio, C.: Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem. Int. Trans. Oper. Res. 29(2), 729\u2013759 (2021)","journal-title":"Int. Trans. Oper. Res."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Patra, S., Goswami, S.K., Goswami, B.: Fuzzy and simulated annealing based dynamic programming for the unit commitment problem. Expert Syst. Appl. 36(3p1), 5081\u20135086 (2009)","DOI":"10.1016\/j.eswa.2008.06.039"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Amani, A., Alizadeh, H.: Solving hydropower unit commitment problem using a novel sequential mixed integer linear programming approach. Water Resour. Manag. (2021, prepublish)","DOI":"10.1007\/s11269-021-02806-6"},{"issue":"3","key":"16_CR5","first-page":"21","volume":"10","author":"A Aniket","year":"2021","unstructured":"Aniket, A., Kirti, P.: Optimization of unit commitment problem using genetic algorithm. Int. J. Syst. Dyn. Appl. (IJSDA) 10(3), 21\u201337 (2021)","journal-title":"Int. J. Syst. Dyn. Appl. (IJSDA)"},{"issue":"02","key":"16_CR6","first-page":"120","volume":"40","author":"Y Sun","year":"2019","unstructured":"Sun, Y., Wu, Y., Liang, L., et al.: Generation scheduling of thermal power units based on intelligent water droplet algorithm. Power Energy 40(02), 120\u2013125 (2019)","journal-title":"Power Energy"},{"issue":"19\u201320","key":"16_CR7","first-page":"2181","volume":"48","author":"K Vineet","year":"2021","unstructured":"Vineet, K., Ram, N.: Monarch butterfly optimization-based computational methodology for unit commitment problem. Electr. Power Componen. Syst. 48(19\u201320), 2181\u20132194 (2021)","journal-title":"Electr. Power Componen. Syst."},{"issue":"06","key":"16_CR8","first-page":"77","volume":"32","author":"S Xiao","year":"2016","unstructured":"Xiao, S., Ye, L., Jiajun, L., et al.: Multi-system joint scheduling based on the improved particle swarm culture algorithm. Power Syst. Clean Energy 32(06), 77\u201384 (2016)","journal-title":"Power Syst. Clean Energy"},{"issue":"01","key":"16_CR9","first-page":"32","volume":"43","author":"J Zhai","year":"2016","unstructured":"Zhai, J., Ren, J., Li, Z., Zhou, M.: Dual particle swarm optimization base on dimensionality reduction for unit commitment problem. J. North China Electr. Power Univ. (Nat. Sci. Ed.) 43(01), 32\u201338 (2016)","journal-title":"J. North China Electr. Power Univ. (Nat. Sci. Ed.)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ismail, A.A., Hussain, A.N.: Unit commitment problem solution using binary PSO algorithm. In: 2019 2nd International Conference on Engineering Technology and Its Applications (IICETA) (2019)","DOI":"10.1109\/IICETA47481.2019.9012971"},{"issue":"04","key":"16_CR11","first-page":"35","volume":"30","author":"Y Liu","year":"2006","unstructured":"Liu, Y., Hou, Z., Jiang, C.: Unit commitment via an enhanced binary Particle Swarm Optimization algorithm. Autom. Electr. Power Syst. 30(04), 35\u201339 (2006)","journal-title":"Autom. Electr. Power Syst."},{"issue":"05","key":"16_CR12","first-page":"504","volume":"47","author":"J Liu","year":"2011","unstructured":"Liu, J., Yang, R., Sun, S.: The analysis of binary Particle Swarm Optimization. J. Nanjing Univ. (Nat. Sci.) 47(05), 504\u2013514 (2011)","journal-title":"J. Nanjing Univ. (Nat. Sci.)"},{"key":"16_CR13","unstructured":"Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation. IEEE (1997)"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Abdi, H.: Profit-based unit commitment problem: a review of models, methods, challenges, and future directions. Renewable Sustain. Energy Rev. (2020)","DOI":"10.1016\/j.rser.2020.110504"},{"issue":"04","key":"16_CR15","first-page":"263","volume":"38","author":"L Jiang","year":"2021","unstructured":"Jiang, L., Liu, J., Zhang, D., Bu, G.: Application analysis of V-shaped transfer function in binary particle swarm optimization. Comput. Appl. Softw. 38(04), 263\u2013270 (2021)","journal-title":"Comput. Appl. Softw."},{"issue":"03","key":"16_CR16","first-page":"273","volume":"18","author":"L Jiang","year":"2020","unstructured":"Jiang, L., Liu, J., Zhang, D., Bu, G.: An adaptive mutation binary Particle Swarm Optimization algorithm. J. Fujian Univ. Technol. 18(03), 273\u2013279 (2020)","journal-title":"J. Fujian Univ. Technol."},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"123942","DOI":"10.1016\/j.energy.2022.123942","volume":"251","author":"H Qiu","year":"2022","unstructured":"Qiu, H., Gu, W., Liu, P., et al.: Application of two-stage robust optimization theory in power system scheduling under uncertainties: a review and perspective. Energy 251, 123942 (2022)","journal-title":"Energy"},{"issue":"2","key":"16_CR18","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1109\/TPWRS.2003.811000","volume":"18","author":"T Senjyu","year":"2003","unstructured":"Senjyu, T., Shimabukuro, K., Uezato, K., et al.: A fast technique for unit commitment problem by extended priority list. IEEE Trans. Power Syst. 18(2), 882\u2013888 (2003)","journal-title":"IEEE Trans. Power Syst."},{"issue":"25","key":"16_CR19","first-page":"189","volume":"32","author":"Z Li","year":"2012","unstructured":"Li, Z., Tan, W., Qin, J.: An improved dual particle swarm optimization algorithm for unit commitment problem. Proc. CSEE 32(25), 189\u2013195 (2012)","journal-title":"Proc. CSEE"},{"issue":"06","key":"16_CR20","first-page":"11","volume":"18","author":"X Han","year":"1994","unstructured":"Han, X., Liu, Z.: Optimal unit commitment considering unit\u2019s ramp-rate limits. Power Syst. Technol. 18(06), 11\u201316 (1994)","journal-title":"Power Syst. Technol."},{"issue":"4","key":"16_CR21","first-page":"24","volume":"24","author":"J Hu","year":"2004","unstructured":"Hu, J., Guo, C., Guo, C.: A hybrid particle swarm optimization method for unit commitment problem. Proc. CSEE 24(4), 24\u201328 (2004)","journal-title":"Proc. CSEE"},{"key":"16_CR22","unstructured":"Cai, C., Cai, Y.: Optimization of unit commitment by genetic algorithm. Power Syst. Technol. 21(1), 44\u201347, 51 (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09677-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T11:11:10Z","timestamp":1718881870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09677-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031096761","9783031096778"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09677-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"171","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2-5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}