SciELO - Scientific Electronic Library Online

 
vol.31 número1OneWeb: web content adaptation platform based on W3C Mobile Web Initiative guidelinesGaAs/AlGaAs nanoheterostruc- nanoheterostructures índice de autoresíndice de assuntospesquisa de artigos
Home Pagelista alfabética de periódicos  

Serviços Personalizados

Journal

Artigo

Indicadores

Links relacionados

  • Em processo de indexaçãoCitado por Google
  • Não possue artigos similaresSimilares em SciELO
  • Em processo de indexaçãoSimilares em Google

Compartilhar


Ingeniería e Investigación

versão impressa ISSN 0120-5609

Resumo

ESCOBAR Z, Antonio H; GALLEGO R, Ramón A  e  ROMERO L, Rubén A. Using traditional heuristic algo- algorithms on an initial genetic algo- rithms algorithm population applied to the rithm transmission expansion planning problem. Ing. Investig. [online]. 2011, vol.31, n.1, pp.127-423. ISSN 0120-5609.

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Palavras-chave : electricity distribution network expansion planning; genetic algorithm; constructive heuristic algorithm; met heuristics; initial population.

        · resumo em Espanhol     · texto em Espanhol | Inglês     · Espanhol ( pdf )

 

Creative Commons License Todo o conteúdo deste periódico, exceto onde está identificado, está licenciado sob uma Licença Creative Commons