Loading…
A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs
This paper addresses the problem of a multiyear security constrained hybrid generation-transmission expansion planning. It is assumed that the overall generation requirements of a network are known along the planning horizon, but their allocations are unknown. Moreover the fuel cost throughout the n...
Saved in:
Published in: | IEEE transactions on power systems 2009-08, Vol.24 (3), p.1609-1618 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83 |
---|---|
cites | cdi_FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83 |
container_end_page | 1618 |
container_issue | 3 |
container_start_page | 1609 |
container_title | IEEE transactions on power systems |
container_volume | 24 |
creator | Sepasian, M.S. Seifi, H. Foroud, A.A. Hatami, A.R. |
description | This paper addresses the problem of a multiyear security constrained hybrid generation-transmission expansion planning. It is assumed that the overall generation requirements of a network are known along the planning horizon, but their allocations are unknown. Moreover the fuel cost throughout the network is not uniform. By allocating the overall generation capacity among the grid nodes, and determining the new transmission element additions along the planning horizon, the overall cost of the system is minimized. The problem is formulated as a mixed integer nonlinear programming problem, which for a large-scale system is very difficult to solve. In this paper a new constructive heuristic approach is proposed, so that the problem can be readily solved. To assess the capabilities of the proposed approach, two networks are studied: the Garver test grid as a small grid and the Iranian power grid as a large-scale grid. |
doi_str_mv | 10.1109/TPWRS.2009.2021218 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_875030425</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4914759</ieee_id><sourcerecordid>36324882</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83</originalsourceid><addsrcrecordid>eNp9kUtPAyEUhYnRxFr9A7ohLnQ1lccwA8umqY9Eo7E1LgkyVGmmzAhD4vx7Gdu4cOEG7oXvnNybA8ApRhOMkbhaPr0-LyYEIZEOggnme2CEGeMZKkqxD0aIc5ZxwdAhOAphjRAq0scIfE3hQ6w72xvl4cLo6G3Xw1njQueVdaaCt_2btxW8Mc541dnGZUuvXNjYEFID519t6obqqVbOWfcOp_V7k2w-NvDO6TpWw9t1NDVcxLatB_fQhWNwsFJ1MCe7ewxerufL2W12_3hzN5veZ5qysstyikWpMMZE4LQd1zkpRVWtCsMMJUSrinKiCo21fssFU6TAmuFUVhVhSnE6Bpdb39Y3n9GETqbJtanTsKaJQfKSIYpywhJ58S9JC0pyzkkCz_-A6yZ6l7aQnPFCMJ6jBJEtpH0Tgjcr2Xq7Ub6XGMkhM_mTmRwyk7vMkuhsK7LGmF9BLnBeMkG_AeVBlC4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>858695840</pqid></control><display><type>article</type><title>A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs</title><source>IEEE Xplore (Online service)</source><creator>Sepasian, M.S. ; Seifi, H. ; Foroud, A.A. ; Hatami, A.R.</creator><creatorcontrib>Sepasian, M.S. ; Seifi, H. ; Foroud, A.A. ; Hatami, A.R.</creatorcontrib><description>This paper addresses the problem of a multiyear security constrained hybrid generation-transmission expansion planning. It is assumed that the overall generation requirements of a network are known along the planning horizon, but their allocations are unknown. Moreover the fuel cost throughout the network is not uniform. By allocating the overall generation capacity among the grid nodes, and determining the new transmission element additions along the planning horizon, the overall cost of the system is minimized. The problem is formulated as a mixed integer nonlinear programming problem, which for a large-scale system is very difficult to solve. In this paper a new constructive heuristic approach is proposed, so that the problem can be readily solved. To assess the capabilities of the proposed approach, two networks are studied: the Garver test grid as a small grid and the Iranian power grid as a large-scale grid.</description><identifier>ISSN: 0885-8950</identifier><identifier>EISSN: 1558-0679</identifier><identifier>DOI: 10.1109/TPWRS.2009.2021218</identifier><identifier>CODEN: ITPSEG</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Allocations ; Capacity planning ; Constraints ; Costs ; Fuel supply cost ; Fuels ; generation-transmission expansion planning ; Horizon ; Hybrid power systems ; Large-scale systems ; Mesh generation ; mixed integer nonlinear programming ; Networks ; Nonlinear programming ; Power generation ; Power system planning ; Security ; Testing</subject><ispartof>IEEE transactions on power systems, 2009-08, Vol.24 (3), p.1609-1618</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83</citedby><cites>FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4914759$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Sepasian, M.S.</creatorcontrib><creatorcontrib>Seifi, H.</creatorcontrib><creatorcontrib>Foroud, A.A.</creatorcontrib><creatorcontrib>Hatami, A.R.</creatorcontrib><title>A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs</title><title>IEEE transactions on power systems</title><addtitle>TPWRS</addtitle><description>This paper addresses the problem of a multiyear security constrained hybrid generation-transmission expansion planning. It is assumed that the overall generation requirements of a network are known along the planning horizon, but their allocations are unknown. Moreover the fuel cost throughout the network is not uniform. By allocating the overall generation capacity among the grid nodes, and determining the new transmission element additions along the planning horizon, the overall cost of the system is minimized. The problem is formulated as a mixed integer nonlinear programming problem, which for a large-scale system is very difficult to solve. In this paper a new constructive heuristic approach is proposed, so that the problem can be readily solved. To assess the capabilities of the proposed approach, two networks are studied: the Garver test grid as a small grid and the Iranian power grid as a large-scale grid.</description><subject>Allocations</subject><subject>Capacity planning</subject><subject>Constraints</subject><subject>Costs</subject><subject>Fuel supply cost</subject><subject>Fuels</subject><subject>generation-transmission expansion planning</subject><subject>Horizon</subject><subject>Hybrid power systems</subject><subject>Large-scale systems</subject><subject>Mesh generation</subject><subject>mixed integer nonlinear programming</subject><subject>Networks</subject><subject>Nonlinear programming</subject><subject>Power generation</subject><subject>Power system planning</subject><subject>Security</subject><subject>Testing</subject><issn>0885-8950</issn><issn>1558-0679</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNp9kUtPAyEUhYnRxFr9A7ohLnQ1lccwA8umqY9Eo7E1LgkyVGmmzAhD4vx7Gdu4cOEG7oXvnNybA8ApRhOMkbhaPr0-LyYEIZEOggnme2CEGeMZKkqxD0aIc5ZxwdAhOAphjRAq0scIfE3hQ6w72xvl4cLo6G3Xw1njQueVdaaCt_2btxW8Mc541dnGZUuvXNjYEFID519t6obqqVbOWfcOp_V7k2w-NvDO6TpWw9t1NDVcxLatB_fQhWNwsFJ1MCe7ewxerufL2W12_3hzN5veZ5qysstyikWpMMZE4LQd1zkpRVWtCsMMJUSrinKiCo21fssFU6TAmuFUVhVhSnE6Bpdb39Y3n9GETqbJtanTsKaJQfKSIYpywhJ58S9JC0pyzkkCz_-A6yZ6l7aQnPFCMJ6jBJEtpH0Tgjcr2Xq7Ub6XGMkhM_mTmRwyk7vMkuhsK7LGmF9BLnBeMkG_AeVBlC4</recordid><startdate>20090801</startdate><enddate>20090801</enddate><creator>Sepasian, M.S.</creator><creator>Seifi, H.</creator><creator>Foroud, A.A.</creator><creator>Hatami, A.R.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope><scope>L7M</scope><scope>F28</scope></search><sort><creationdate>20090801</creationdate><title>A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs</title><author>Sepasian, M.S. ; Seifi, H. ; Foroud, A.A. ; Hatami, A.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Allocations</topic><topic>Capacity planning</topic><topic>Constraints</topic><topic>Costs</topic><topic>Fuel supply cost</topic><topic>Fuels</topic><topic>generation-transmission expansion planning</topic><topic>Horizon</topic><topic>Hybrid power systems</topic><topic>Large-scale systems</topic><topic>Mesh generation</topic><topic>mixed integer nonlinear programming</topic><topic>Networks</topic><topic>Nonlinear programming</topic><topic>Power generation</topic><topic>Power system planning</topic><topic>Security</topic><topic>Testing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sepasian, M.S.</creatorcontrib><creatorcontrib>Seifi, H.</creatorcontrib><creatorcontrib>Foroud, A.A.</creatorcontrib><creatorcontrib>Hatami, A.R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><jtitle>IEEE transactions on power systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sepasian, M.S.</au><au>Seifi, H.</au><au>Foroud, A.A.</au><au>Hatami, A.R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs</atitle><jtitle>IEEE transactions on power systems</jtitle><stitle>TPWRS</stitle><date>2009-08-01</date><risdate>2009</risdate><volume>24</volume><issue>3</issue><spage>1609</spage><epage>1618</epage><pages>1609-1618</pages><issn>0885-8950</issn><eissn>1558-0679</eissn><coden>ITPSEG</coden><abstract>This paper addresses the problem of a multiyear security constrained hybrid generation-transmission expansion planning. It is assumed that the overall generation requirements of a network are known along the planning horizon, but their allocations are unknown. Moreover the fuel cost throughout the network is not uniform. By allocating the overall generation capacity among the grid nodes, and determining the new transmission element additions along the planning horizon, the overall cost of the system is minimized. The problem is formulated as a mixed integer nonlinear programming problem, which for a large-scale system is very difficult to solve. In this paper a new constructive heuristic approach is proposed, so that the problem can be readily solved. To assess the capabilities of the proposed approach, two networks are studied: the Garver test grid as a small grid and the Iranian power grid as a large-scale grid.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TPWRS.2009.2021218</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0885-8950 |
ispartof | IEEE transactions on power systems, 2009-08, Vol.24 (3), p.1609-1618 |
issn | 0885-8950 1558-0679 |
language | eng |
recordid | cdi_proquest_miscellaneous_875030425 |
source | IEEE Xplore (Online service) |
subjects | Allocations Capacity planning Constraints Costs Fuel supply cost Fuels generation-transmission expansion planning Horizon Hybrid power systems Large-scale systems Mesh generation mixed integer nonlinear programming Networks Nonlinear programming Power generation Power system planning Security Testing |
title | A Multiyear Security Constrained Hybrid Generation-Transmission Expansion Planning Algorithm Including Fuel Supply Costs |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T23%3A16%3A12IST&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=A%20Multiyear%20Security%20Constrained%20Hybrid%20Generation-Transmission%20Expansion%20Planning%20Algorithm%20Including%20Fuel%20Supply%20Costs&rft.jtitle=IEEE%20transactions%20on%20power%20systems&rft.au=Sepasian,%20M.S.&rft.date=2009-08-01&rft.volume=24&rft.issue=3&rft.spage=1609&rft.epage=1618&rft.pages=1609-1618&rft.issn=0885-8950&rft.eissn=1558-0679&rft.coden=ITPSEG&rft_id=info:doi/10.1109/TPWRS.2009.2021218&rft_dat=%3Cproquest_cross%3E36324882%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c357t-43197a1112910098c4279ddf6e5e322cad382a6c1ccb495a261c51b49dd25aa83%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=858695840&rft_id=info:pmid/&rft_ieee_id=4914759&rfr_iscdi=true |