Genetic algorithm of chu and beasley for static and multistage transmission expansion planning
| Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
|---|---|
| Data(s) |
27/05/2014
27/05/2014
01/12/2006
|
| Resumo |
In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, to efficiently solve the problem described above are also presented. Results using some known systems show that the GACB is very efficient. To validate the GACB, we compare the results achieved using it with the results using other meta-heuristics like tabu-search, simulated annealing, extended genetic algorithm and hibrid algorithms. © 2006 IEEE. |
| Identificador |
http://dx.doi.org/10.1109/PES.2006.1709172 2006 IEEE Power Engineering Society General Meeting, PES. http://hdl.handle.net/11449/69250 10.1109/PES.2006.1709172 2-s2.0-35348899544 |
| Idioma(s) |
eng |
| Relação |
2006 IEEE Power Engineering Society General Meeting, PES |
| Direitos |
closedAccess |
| Palavras-Chave | #Combinatorial optimization #Genetic algorithm of Chu and Beasley #Meta-heuristics #Transmission expansion planning #Genetic algorithms #Problem solving #Simulated annealing #Strategic planning #Electric power transmission |
| Tipo |
info:eu-repo/semantics/conferencePaper |
