TY - JOUR
T1 - Applying Genetic Algorithm and Simulated Annealing to a Combinatorial Optimization Problem
AU - Chakraborty, Mandira
AU - Chakraborty, Uday K.
N1 - This paper applies the genetic algorithm and simulated annealing to the problem of optimal link enhancement, which is an NP-complete combinatorial optimiza
PY - 1997/1/1
Y1 - 1997/1/1
N2 - 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.
AB - 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.
UR - http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=652115
U2 - 10.1109/ICICS.1997.652115
DO - 10.1109/ICICS.1997.652115
M3 - Article
VL - 2
JO - International Conference on Information and Communication Security
JF - International Conference on Information and Communication Security
ER -