{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:53:32Z","timestamp":1725486812319},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540715894"},{"type":"electronic","value":"9783540716181"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71618-1_37","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T02:05:53Z","timestamp":1183428353000},"page":"332-340","source":"Crossref","is-referenced-by-count":2,"title":["Mixed Ant Colony Optimization for the Unit Commitment Problem"],"prefix":"10.1007","author":[{"given":"Ana-Talida","family":"Serban","sequence":"first","affiliation":[]},{"given":"Guillaume","family":"Sandou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1196","DOI":"10.1109\/TPWRS.2003.821611","volume":"9","author":"N.P. Padhy","year":"2004","unstructured":"Padhy, N.P.: Unit commitment \u2013 a bibliographical survey. IEEE Transactions on Power Systems\u00a09, 1196\u20131205 (2004)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"37_CR2","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/60.222703","volume":"8","author":"C.-L. Chen","year":"1993","unstructured":"Chen, C.-L., Wang, S.-C.: Branch and Bound scheduling for thermal generating units. IEEE Transactions on Energy Conversion\u00a08(2), 184\u2013189 (1993)","journal-title":"IEEE Transactions on Energy Conversion"},{"issue":"3","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/59.119267","volume":"6","author":"Z. Ouyang","year":"1991","unstructured":"Ouyang, Z., Shahidehpour, S.M.: An intelligent dynamic programming for unit commitment application. IEEE Transactions on Power Systems\u00a06(3), 1203\u20131209 (1991)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"4","key":"37_CR4","doi-asserted-by":"publisher","first-page":"2119","DOI":"10.1109\/TPWRS.2004.826690","volume":"19","author":"T. Senjyu","year":"2004","unstructured":"Senjyu, T., Shimabukuro, K., Uezato, K., Funabashi, T.: A fast technique for Unit Commitment problem by extended priority list. IEEE Transactions on Power Systems\u00a019(4), 2119\u20132120 (2004)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1109\/TPWRS.2002.805003","volume":"17","author":"Q. Zhai","year":"2002","unstructured":"Zhai, Q., Guan, X.: Unit Commitment with identical units: successive subproblems solving method based on Lagrangian relaxation. IEEE Transactions on Power Systems\u00a017(4), 1250\u20131257 (2002)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","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.: Unit Commitment by Lagrangian Relaxation and Genetic Algorithms. IEEE Transactions on Power Systems\u00a015(2), 707\u2013714 (2000)","journal-title":"IEEE Transactions on Power Systems"},{"key":"37_CR7","unstructured":"Dotzauer, E., Holmstr\u00f6m, K., Ravn, H.F.: Optimal Unit Commitment and Economic Dispatch of Cogeneration Systems with a Storage. In: 13th Power Systems Computation Conference, Trondheim, Norway, pp. 738\u2013744 (1999)"},{"issue":"5","key":"37_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0142-0615(97)00062-8","volume":"20","author":"S.Y.W. Wong","year":"1998","unstructured":"Wong, S.Y.W.: An Enhanced Simulated Annealing Approach to Unit Commitment. Electrical Power & Energy Systems\u00a020(5), 359\u2013368 (1998)","journal-title":"Electrical Power & Energy Systems"},{"issue":"1","key":"37_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TPWRS.2003.821472","volume":"19","author":"C.C.A. Rajan","year":"2004","unstructured":"Rajan, C.C.A., Mohan, M.R.: An evolutionary programming-based tabu search method for solving the unit commitment problem. IEEE Transactions on Power Systems\u00a019(1), 577\u2013585 (2004)","journal-title":"IEEE Transactions on Power Systems"},{"issue":"1","key":"37_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/59.982197","volume":"17","author":"K.S. Swarup","year":"2002","unstructured":"Swarup, K.S., Yamashiro, S.: Unit commitment solution methodology using genetic algorithm. IEEE Transactions on Power Systems\u00a017(1), 87\u201391 (2002)","journal-title":"IEEE Transactions on Power Systems"},{"key":"37_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0142-0615(01)00024-2","volume":"24","author":"C.-P. Cheng","year":"2002","unstructured":"Cheng, C.-P., Liu, C.-W., Liu, C.-C.: Unit Commitment by annealing-genetic algorithm. Electrical Power and Energy Systems\u00a024, 149\u2013158 (2002)","journal-title":"Electrical Power and Energy Systems"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0378-7796(99)00011-5","volume":"52","author":"Y.H. Song","year":"1999","unstructured":"Song, Y.H., Chou, C.S., Stonham, T.J.: Combined heat and power economic dispatch by improved ant colony search algorithm. Electric Power System Research\u00a052, 115\u2013121 (1999)","journal-title":"Electric Power System Research"},{"issue":"5","key":"37_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ijepes.2005.12.004","volume":"28","author":"S.P. Simon","year":"2006","unstructured":"Simon, S.P., Padhy, N.P., Anand, R.S.: An ant colony system approach for unit commitment problem. Electrical Power & Energy Systems\u00a028(5), 315\u2013323 (2006)","journal-title":"Electrical Power & Energy Systems"},{"key":"37_CR14","unstructured":"Sisworarhardjo, N.S., El-Keib, A.A.: Unit commitment using the ant colony search algorithm. In: Large Engineering Systems Conference on Power Engineering, Halifax, Canada (2002)"},{"key":"37_CR15","unstructured":"Sum-Im, T., Ongsakul, W.: Ant colony search algorithm for unit commitment. In: IEEE International Conference on Industrial Technology, Maribor, Slovenia (2003)"},{"key":"37_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-60469-3_22","volume-title":"Evolutionary Computing","author":"G. Bilchev","year":"1995","unstructured":"Bilchev, G., Parmee, I.: The ant colony metaphor for searching continuous spaces. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol.\u00a0993, pp. 25\u201339. Springer, Heidelberg (1995)"},{"issue":"1","key":"37_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernetics-Part B\u00a026(1), 1\u201313 (1996)","journal-title":"IEEE Transactions on Systems, Man and Cybernetics-Part B"},{"key":"37_CR18","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant Colony System: a Cooperative Learning Approach to the Traveling Salesman Problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"9\/10","key":"37_CR19","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.3166\/jesa.38.1097-1119","volume":"38","author":"G. Sandou","year":"2004","unstructured":"Sandou, G., Font, S., Tebbani, S., Hiret, A., Mondon, C.: Optimisation par colonies de fourmis d\u2019un site de g\u00e9n\u00e9ration d\u2019\u00e9nergie. Journal Europ\u00e9en des Syst\u00e8mes Automatis\u00e9s (Num\u00e9ro sp\u00e9cial M\u00e9taheuristiques pour l\u2019optimisation difficile)\u00a038(9\/10), 1097\u20131119 (2004)","journal-title":"Journal Europ\u00e9en des Syst\u00e8mes Automatis\u00e9s"},{"key":"37_CR20","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: MAX-MIN Ant System. Future Generation Computer Systems\u00a016, 889\u2013914 (2000)","journal-title":"Future Generation Computer Systems"},{"key":"37_CR21","unstructured":"Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Accepted to special issue of EJOR on adapting metaheuristics to continuous optimization (2006)"},{"key":"37_CR22","unstructured":"Sandou, G.: Mod\u00e9lisation, optimisation et commande de parcs de production multi \u00e9nergies complexes. PhD. Thesis, University Paris XI (2005)"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71618-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:07:39Z","timestamp":1558274859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71618-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540715894","9783540716181"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71618-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}