Autor(es):
Meymand, Majid Zeinaddini ; Rashidinejad, Masoud ; Khorasani, Hamid [UNESP] ; Rahmani, Mohsen [UNESP] ; Mahmoudabadi, Amin
Data: 2014
Identificador Persistente: http://hdl.handle.net/11449/42670
Origem: Oasisbr
Assunto(s): Transmission network expansion planning; scatter search algorithm; VGS algorithm; metaheuristic algorithm; Transmission network expansion planning; Transmission network expansion planning; scatter search algorithm; scatter search algorithm; VGS algorithm; VGS algorithm; metaheuristic algorithm; metaheuristic algorithm
Descrição
Made available in DSpace on 2013-09-27T14:54:08Z (GMT). No. of bitstreams: 1 WOS000312424100013.pdf: 400885 bytes, checksum: 182abf67f05dc71f268f2ebf30b5040d (MD5) Previous issue date: 2012-01-01
Made available in DSpace on 2013-09-30T19:24:53Z (GMT). No. of bitstreams: 1 WOS000312424100013.pdf: 400885 bytes, checksum: 182abf67f05dc71f268f2ebf30b5040d (MD5) Previous issue date: 2012-01-01
Submitted by Vitor Silverio Rodrigues (vitorsrodrigues@reitoria.unesp.br) on 2014-05-20T15:34:51Z No. of bitstreams: 1 WOS000312424100013.pdf: 400885 bytes, checksum: 182abf67f05dc71f268f2ebf30b5040d (MD5)
Made available in DSpace on 2014-05-20T15:34:51Z (GMT). No. of bitstreams: 1 WOS000312424100013.pdf: 400885 bytes, checksum: 182abf67f05dc71f268f2ebf30b5040d (MD5) Previous issue date: 2012-01-01
Shahid Bahonar University of Kerman
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Transmission network expansion planning (TNEP) is one of the most important tasks in the field of power systems, especially in deregulated power system environments. TNEP is a nonlinear mixed integer programming problem that can be solved via hybrid heuristic algorithms. This paper presents a modified scatter search algorithm (MSSA) to reinforce the ordinary scatter search algorithm (SSA) to be equipped for handling large scale transmission expansion planning (TEP) problems. The proposed methodology is based on the SSA, incorporating some improved strategies so as to decrease the number of linear programming problems required to be solved iteratively. In this study, it is shown that the MSSA can handle TEP problems faster than the ordinary SSA, as well as other implemented algorithms. Case studies and simulation results show the significant performance of the proposed method in comparison with some studies addressed in common literature.
Sahid Bahonar Univ Kerman, Dept Elect Engn, Kerman, Iran
Univ Estadual Paulista, Fac Engn Ilha Solteira, São Paulo, Brazil
Univ Estadual Paulista, Fac Engn Ilha Solteira, São Paulo, Brazil
FAPESP: 09/14816-7
FAPESP: 10/19032-1
