Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry
Autor(a) principal: | |
---|---|
Data de Publicação: | 2013 |
Outros Autores: | , |
Tipo de documento: | Artigo de conferência |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UNESP |
Texto Completo: | http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6712989 http://hdl.handle.net/11449/117643 |
Resumo: | The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system. |
id |
UNSP_eea9a757aa7057a6d9337bfebd4eb8a2 |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/117643 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity IndustryTransmission expansion planningConstructive heuristic algorithmOpen accessMultiple generating scenarioshybrid modelThe transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system.Univ Estadual Paulista, Dept Elect & Comp Engn, Ilha Solteira, SP, BrazilUniv Estadual Paulista, Dept Elect & Comp Engn, Ilha Solteira, SP, BrazilIeeeUniversidade Estadual Paulista (Unesp)Khorasani, H. [UNESP]Pourakbari-Kasmaei, M. [UNESP]Romero, R. [UNESP]2015-03-18T15:56:37Z2015-03-18T15:56:37Z2013-01-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject6http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=67129892013 3rd International Conference On Electric Power And Energy Conversion Systems (epecs). New York: Ieee, 6 p., 2013.2325-2677http://hdl.handle.net/11449/117643WOS:000345894400010Web of Sciencereponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPeng2013 3rd International Conference On Electric Power And Energy Conversion Systems (epecs)info:eu-repo/semantics/openAccess2024-07-04T19:11:55Zoai:repositorio.unesp.br:11449/117643Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestrepositoriounesp@unesp.bropendoar:29462024-07-04T19:11:55Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
title |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
spellingShingle |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry Khorasani, H. [UNESP] Transmission expansion planning Constructive heuristic algorithm Open access Multiple generating scenarios hybrid model |
title_short |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
title_full |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
title_fullStr |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
title_full_unstemmed |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
title_sort |
Transmission Expansion Planning Via a Constructive Heuristic Algorithm in Restructured Electricity Industry |
author |
Khorasani, H. [UNESP] |
author_facet |
Khorasani, H. [UNESP] Pourakbari-Kasmaei, M. [UNESP] Romero, R. [UNESP] |
author_role |
author |
author2 |
Pourakbari-Kasmaei, M. [UNESP] Romero, R. [UNESP] |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Universidade Estadual Paulista (Unesp) |
dc.contributor.author.fl_str_mv |
Khorasani, H. [UNESP] Pourakbari-Kasmaei, M. [UNESP] Romero, R. [UNESP] |
dc.subject.por.fl_str_mv |
Transmission expansion planning Constructive heuristic algorithm Open access Multiple generating scenarios hybrid model |
topic |
Transmission expansion planning Constructive heuristic algorithm Open access Multiple generating scenarios hybrid model |
description |
The transmission expansion planning problem in modern power systems is a large-scale, mixed-integer, nonlinear and non-convex problem. this paper presents a new mathematical model and a constructive heuristic algorithm (CHA) for solving transmission expansion planning problem under new environment of electricity restructuring. CHA finds an acceptable solution in an iterative process, where in each step a circuit is chosen using a sensitivity index and added to the system. The proposed model consider multiple generation scenarios therefore the methodology finds high quality solution in which it allows the power system operate adequacy in an environment with multiple generators scenarios. Case studies and simulation results using test systems show possibility of using Constructive heuristic algorithm in an open access system. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-01-01 2015-03-18T15:56:37Z 2015-03-18T15:56:37Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6712989 2013 3rd International Conference On Electric Power And Energy Conversion Systems (epecs). New York: Ieee, 6 p., 2013. 2325-2677 http://hdl.handle.net/11449/117643 WOS:000345894400010 |
url |
http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6712989 http://hdl.handle.net/11449/117643 |
identifier_str_mv |
2013 3rd International Conference On Electric Power And Energy Conversion Systems (epecs). New York: Ieee, 6 p., 2013. 2325-2677 WOS:000345894400010 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
2013 3rd International Conference On Electric Power And Energy Conversion Systems (epecs) |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
6 |
dc.publisher.none.fl_str_mv |
Ieee |
publisher.none.fl_str_mv |
Ieee |
dc.source.none.fl_str_mv |
Web of Science reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
repositoriounesp@unesp.br |
_version_ |
1834484716622839808 |