DocumentCode
2229603
Title
Applying genetic algorithm and simulated annealing to a combinatorial optimization problem
Author
Chakraborty, Mandira ; Chakraborty, Uday K.
Author_Institution
Dept. of Comput. Sci. & Eng., Jadavpur Univ., Calcutta, India
fYear
1997
fDate
9-12 Sep 1997
Firstpage
929
Abstract
This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimization problem in the topological expansion of computer communication networks. Experimental results show that simulated annealing outperforms the genetic algorithm on this problem
Keywords
combinatorial mathematics; computer networks; genetic algorithms; network topology; simulated annealing; NP-complete problem; combinatorial optimization problem; computer communication networks; genetic algorithm; optimal link enhancement; simulated annealing; topological expansion; Biological information theory; Biology; Communication networks; Computational modeling; Computer networks; Computer simulation; Costs; Encoding; Genetic algorithms; Simulated annealing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on
Print_ISBN
0-7803-3676-3
Type
conf
DOI
10.1109/ICICS.1997.652115
Filename
652115
Link To Document