DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kim, Sehun | ko |
dc.contributor.author | RHEE, M | ko |
dc.date.accessioned | 2007-11-12T02:37:22Z | - |
dc.date.available | 2007-11-12T02:37:22Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1993-01 | - |
dc.identifier.citation | COMPUTERS INDUSTRIAL ENGINEERING, v.24, no.1, pp.69 - 79 | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/10203/1863 | - |
dc.description.abstract | The Lagrangean relaxation method is applied to the unit commitment problem of a power generation system with pumped-storage units. The shortest path algorithm is used for the subproblem for each thermal unit and the minimal cost flow algorithm is used for each pumped-storage unit. A method for finding a better feasible solution from a solution of a relaxed problem is presented. A real Korean power generation system with 39 thermal units and one pumped-storage unit is tested. We considered 168 planning hours and we were able to find a near optimal solution (within 0.5% of optimal) consuming a reasonable amount of CPU time. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | - |
dc.title | AN APPLICATION OF THE LAGRANGEAN RELAXATION METHOD TO UNIT COMMITMENT SCHEDULING IN A POWER-GENERATION SYSTEM WITH PUMPED-STORAGE UNITS | - |
dc.type | Article | - |
dc.identifier.wosid | A1993KJ86500007 | - |
dc.type.rims | ART | - |
dc.citation.volume | 24 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 69 | - |
dc.citation.endingpage | 79 | - |
dc.citation.publicationname | COMPUTERS INDUSTRIAL ENGINEERING | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Kim, Sehun | - |
dc.contributor.nonIdAuthor | RHEE, M | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.