{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:42:58Z","timestamp":1742960578869,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319422930"},{"type":"electronic","value":"9783319422947"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42294-7_67","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T11:00:47Z","timestamp":1468234847000},"page":"757-769","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Discrete Chaotic Gravitational Search Algorithm for Unit Commitment Problem"],"prefix":"10.1007","author":[{"given":"Sheng","family":"Li","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Huiqin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Dongmei","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Yuki","family":"Todo","sequence":"additional","affiliation":[]},{"given":"Shangce","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"issue":"1","key":"67_CR1","doi-asserted-by":"publisher","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.: Unit commitment problem using enhanced particle swarm optimization algorithm. Soft. Comput. 15(1), 139\u2013148 (2011)","journal-title":"Soft. Comput."},{"issue":"6","key":"67_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1023\/B:HEUR.0000012449.84567.1a","volume":"9","author":"T Ting","year":"2003","unstructured":"Ting, T., Rao, M., Loo, C., Ngu, S.: Solving unit commitment problem using hybrid particle swarm optimization. J. Heuristics 9(6), 507\u2013520 (2003)","journal-title":"J. Heuristics"},{"issue":"3","key":"67_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/j.epsr.2004.04.014","volume":"72","author":"G Dudek","year":"2004","unstructured":"Dudek, G.: Unit commitment by genetic algorithm with specialized search operators. Electr. Power Syst. Res. 72(3), 299\u2013308 (2004)","journal-title":"Electr. Power Syst. Res."},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Pappala, V., Erlich. I.: A new approach for solving the unit commitment problem by adaptive particle swarm optimization. In: IEEE Power and Energy Society General Meeting-Conversion and Delivery of Electrical Energy in the 21st Century, pp. 1\u20136 (2008)","DOI":"10.1109\/PES.2008.4596390"},{"issue":"9","key":"67_CR5","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1016\/j.epsr.2005.10.005","volume":"76","author":"L Sun","year":"2006","unstructured":"Sun, L., Zhang, Y., Jiang, C.: A matrix real-coded genetic algorithm to the unit commitment problem. Electr. Power Syst. Res. 76(9), 716\u2013728 (2006)","journal-title":"Electr. Power Syst. Res."},{"key":"67_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ijepes.2013.04.001","volume":"53","author":"P Roy","year":"2013","unstructured":"Roy, P.: Solution of unit commitment problem using gravitational search algorithm. Int. J. Electr. Power Energy Syst. 53, 85\u201394 (2013)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Shen, D., Jiang, T., Chen, W., Qian, S., Gao, S.: Improved chaotic gravitational search algorithms for global optimization. In: IEEE Congress on Evolutionary Computation (CEC), pp. 1220\u20131226 (2015)","DOI":"10.1109\/CEC.2015.7257028"},{"issue":"3","key":"67_CR8","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1016\/j.ejor.2005.10.071","volume":"181","author":"C Dang","year":"2007","unstructured":"Dang, C., Li, M.: A floating-point genetic algorithm for solving the unit commitment problem. Eur. J. Oper. Res. 181(3), 1370\u20131395 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"67_CR9","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/TPWRS.2003.821611","volume":"19","author":"N Padhy","year":"2004","unstructured":"Padhy, N.: Unit commitment-a bibliographical survey. IEEE Trans. Power Syst. 19(2), 1196\u20131205 (2004)","journal-title":"IEEE Trans. Power Syst."},{"issue":"5560","key":"67_CR10","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1038\/261459a0","volume":"261","author":"R May","year":"1976","unstructured":"May, R.: Simple mathematical models with very complicated dynamics. Nature 261(5560), 459\u2013467 (1976)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42294-7_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:00:07Z","timestamp":1558314007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42294-7_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422930","9783319422947"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42294-7_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"12 July 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lanzhou","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icic2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}