DocumentCode
1997685
Title
Completeness and Quality of Genetic Algorithm in Network Planning
Author
Tsenov, Aleksandar K.
Author_Institution
Tech. Univ. of Sofia, Sofia
fYear
2007
fDate
26-28 Sept. 2007
Firstpage
385
Lastpage
388
Abstract
In this paper an attempt for finding appropriate criteria for the completeness and the quality of the function of the genetic algorithm is made. Because of the heuristic nature of the algorithm there are not any known criteria for such parameters. The study includes a dedicated method and great amount of algorithm executions in order to define right conclusion about the posed problem.
Keywords
genetic algorithms; telecommunication network planning; genetic algorithm; location allocation; network planning; Cost function; Fires; Genetic algorithms; Genetic mutations; Hamming distance; Heuristic algorithms; Piecewise linear techniques; Strategic planning; Telecommunications; Termination of employment; Genetic Algorithm; completeness; correctness; network planning; quality;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications in Modern Satellite, Cable and Broadcasting Services, 2007. TELSIKS 2007. 8th International Conference on
Conference_Location
Serbia
Print_ISBN
978-1-4244-1467-3
Electronic_ISBN
978-1-4244-1468-0
Type
conf
DOI
10.1109/TELSKS.2007.4376018
Filename
4376018
Link To Document