Solution to security constrained unit commitment problem using genetic algorithm
In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without...
Gespeichert in:
| Veröffentlicht in: | International journal of electrical power & energy systems 2010-02, Vol.32 (2), p.117-125 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 125 |
|---|---|
| container_issue | 2 |
| container_start_page | 117 |
| container_title | International journal of electrical power & energy systems |
| container_volume | 32 |
| creator | Senthil Kumar, V. Mohan, M.R. |
| description | In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without line flow constraint by genetic algorithm. In the second phase the violations in the lines are minimized for a committed schedule using GA based OPF. The resulting solution minimizes line flow violations in the critical lines under unit’s decommitted hours by adjusting the unit generations. In this paper, a 66-bus Indian utility system with 12 generating units and 93 transmission lines is considered to exhibit the effectiveness of the proposed approach. |
| doi_str_mv | 10.1016/j.ijepes.2009.06.019 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_36349028</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0142061509001082</els_id><sourcerecordid>21307683</sourcerecordid><originalsourceid>FETCH-LOGICAL-c398t-d400001a089c68eab5385256af0142191f3a00b4b434e2be72b367dc5449360a3</originalsourceid><addsrcrecordid>eNqFkE1r3DAQhkVpodu0_6AHX9qbndGHZelSCCFtA4EG0p6FLI-3WmxpI8mB_Ptq2dBjexoYnnfm5SHkI4WOApWXh84f8Ii5YwC6A9kB1a_IjqpBt7ynw2uyAypYC5L2b8m7nA8AMGjBduT-IS5b8TE0JTYZ3ZZ8eW5cDLkk6wNOzRZ8qYt19WXFUJpjiuOCa7NlH_bNHgMW7xq77GON_l7fkzezXTJ-eJkX5NfXm5_X39u7H99ur6_uWse1Ku0kagWgFpR2UqEde6561ks7n5pSTWduAUYxCi6QjTiwkcthcr0Qmkuw_IJ8Pt-tfR43zMWsPjtcFhswbtlwyYUGpv4LMsphkIpXUJxBl2LOCWdzTH616dlQMCfP5mDOns3JswFpquca-_Ry32ZnlznZ4Hz-m2WMKcXpULkvZw6rlSePyWTnMTicfEJXzBT9vx_9AciulYQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>21307683</pqid></control><display><type>article</type><title>Solution to security constrained unit commitment problem using genetic algorithm</title><source>Elsevier ScienceDirect Journals</source><creator>Senthil Kumar, V. ; Mohan, M.R.</creator><creatorcontrib>Senthil Kumar, V. ; Mohan, M.R.</creatorcontrib><description>In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without line flow constraint by genetic algorithm. In the second phase the violations in the lines are minimized for a committed schedule using GA based OPF. The resulting solution minimizes line flow violations in the critical lines under unit’s decommitted hours by adjusting the unit generations. In this paper, a 66-bus Indian utility system with 12 generating units and 93 transmission lines is considered to exhibit the effectiveness of the proposed approach.</description><identifier>ISSN: 0142-0615</identifier><identifier>EISSN: 1879-3517</identifier><identifier>DOI: 10.1016/j.ijepes.2009.06.019</identifier><identifier>CODEN: IEPSDC</identifier><language>eng</language><publisher>Oxford: Elsevier Ltd</publisher><subject>Applied sciences ; Economic dispatch ; Electrical engineering. Electrical power engineering ; Electrical power engineering ; Exact sciences and technology ; Genetic algorithm ; Lambda iteration technique ; Miscellaneous ; Operation. Load control. Reliability ; Optimal power flow ; Power networks and lines ; Unit Commitment</subject><ispartof>International journal of electrical power & energy systems, 2010-02, Vol.32 (2), p.117-125</ispartof><rights>2009 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c398t-d400001a089c68eab5385256af0142191f3a00b4b434e2be72b367dc5449360a3</citedby><cites>FETCH-LOGICAL-c398t-d400001a089c68eab5385256af0142191f3a00b4b434e2be72b367dc5449360a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ijepes.2009.06.019$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,778,782,3539,27907,27908,45978</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22288317$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Senthil Kumar, V.</creatorcontrib><creatorcontrib>Mohan, M.R.</creatorcontrib><title>Solution to security constrained unit commitment problem using genetic algorithm</title><title>International journal of electrical power & energy systems</title><description>In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without line flow constraint by genetic algorithm. In the second phase the violations in the lines are minimized for a committed schedule using GA based OPF. The resulting solution minimizes line flow violations in the critical lines under unit’s decommitted hours by adjusting the unit generations. In this paper, a 66-bus Indian utility system with 12 generating units and 93 transmission lines is considered to exhibit the effectiveness of the proposed approach.</description><subject>Applied sciences</subject><subject>Economic dispatch</subject><subject>Electrical engineering. Electrical power engineering</subject><subject>Electrical power engineering</subject><subject>Exact sciences and technology</subject><subject>Genetic algorithm</subject><subject>Lambda iteration technique</subject><subject>Miscellaneous</subject><subject>Operation. Load control. Reliability</subject><subject>Optimal power flow</subject><subject>Power networks and lines</subject><subject>Unit Commitment</subject><issn>0142-0615</issn><issn>1879-3517</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><recordid>eNqFkE1r3DAQhkVpodu0_6AHX9qbndGHZelSCCFtA4EG0p6FLI-3WmxpI8mB_Ptq2dBjexoYnnfm5SHkI4WOApWXh84f8Ii5YwC6A9kB1a_IjqpBt7ynw2uyAypYC5L2b8m7nA8AMGjBduT-IS5b8TE0JTYZ3ZZ8eW5cDLkk6wNOzRZ8qYt19WXFUJpjiuOCa7NlH_bNHgMW7xq77GON_l7fkzezXTJ-eJkX5NfXm5_X39u7H99ur6_uWse1Ku0kagWgFpR2UqEde6561ks7n5pSTWduAUYxCi6QjTiwkcthcr0Qmkuw_IJ8Pt-tfR43zMWsPjtcFhswbtlwyYUGpv4LMsphkIpXUJxBl2LOCWdzTH616dlQMCfP5mDOns3JswFpquca-_Ry32ZnlznZ4Hz-m2WMKcXpULkvZw6rlSePyWTnMTicfEJXzBT9vx_9AciulYQ</recordid><startdate>20100201</startdate><enddate>20100201</enddate><creator>Senthil Kumar, V.</creator><creator>Mohan, M.R.</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7ST</scope><scope>C1K</scope><scope>SOI</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20100201</creationdate><title>Solution to security constrained unit commitment problem using genetic algorithm</title><author>Senthil Kumar, V. ; Mohan, M.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c398t-d400001a089c68eab5385256af0142191f3a00b4b434e2be72b367dc5449360a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Applied sciences</topic><topic>Economic dispatch</topic><topic>Electrical engineering. Electrical power engineering</topic><topic>Electrical power engineering</topic><topic>Exact sciences and technology</topic><topic>Genetic algorithm</topic><topic>Lambda iteration technique</topic><topic>Miscellaneous</topic><topic>Operation. Load control. Reliability</topic><topic>Optimal power flow</topic><topic>Power networks and lines</topic><topic>Unit Commitment</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Senthil Kumar, V.</creatorcontrib><creatorcontrib>Mohan, M.R.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Environment Abstracts</collection><collection>Environmental Sciences and Pollution Management</collection><collection>Environment Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>International journal of electrical power & energy systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Senthil Kumar, V.</au><au>Mohan, M.R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Solution to security constrained unit commitment problem using genetic algorithm</atitle><jtitle>International journal of electrical power & energy systems</jtitle><date>2010-02-01</date><risdate>2010</risdate><volume>32</volume><issue>2</issue><spage>117</spage><epage>125</epage><pages>117-125</pages><issn>0142-0615</issn><eissn>1879-3517</eissn><coden>IEPSDC</coden><abstract>In this paper Optimal Power Flow (OPF) with line flow constraint is incorporated in solving the Unit Commitment (UC) problem using Genetic Algorithm (GA). In this proposed approach the problem is solved in two phases. In the first phase unit commitment is solved with prevailing constraints, without line flow constraint by genetic algorithm. In the second phase the violations in the lines are minimized for a committed schedule using GA based OPF. The resulting solution minimizes line flow violations in the critical lines under unit’s decommitted hours by adjusting the unit generations. In this paper, a 66-bus Indian utility system with 12 generating units and 93 transmission lines is considered to exhibit the effectiveness of the proposed approach.</abstract><cop>Oxford</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.ijepes.2009.06.019</doi><tpages>9</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0142-0615 |
| ispartof | International journal of electrical power & energy systems, 2010-02, Vol.32 (2), p.117-125 |
| issn | 0142-0615 1879-3517 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_36349028 |
| source | Elsevier ScienceDirect Journals |
| subjects | Applied sciences Economic dispatch Electrical engineering. Electrical power engineering Electrical power engineering Exact sciences and technology Genetic algorithm Lambda iteration technique Miscellaneous Operation. Load control. Reliability Optimal power flow Power networks and lines Unit Commitment |
| title | Solution to security constrained unit commitment problem using genetic algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T17%3A57%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Solution%20to%20security%20constrained%20unit%20commitment%20problem%20using%20genetic%20algorithm&rft.jtitle=International%20journal%20of%20electrical%20power%20&%20energy%20systems&rft.au=Senthil%20Kumar,%20V.&rft.date=2010-02-01&rft.volume=32&rft.issue=2&rft.spage=117&rft.epage=125&rft.pages=117-125&rft.issn=0142-0615&rft.eissn=1879-3517&rft.coden=IEPSDC&rft_id=info:doi/10.1016/j.ijepes.2009.06.019&rft_dat=%3Cproquest_cross%3E21307683%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=21307683&rft_id=info:pmid/&rft_els_id=S0142061509001082&rfr_iscdi=true |