2006 First International Multi-Symposiums on Computer and Computational Sciences A Genetic Algorithm with Dual-Structure Code and Adaptive Strategy for Link Enhancement Problem Hangzhou, Zhejiang, China June 20-June 24 ISBN: 0-7695-2581-4
Link enhancement problem is a combinatorial optimization problem, and genetic algorithm is suitable to solve the combinatorial optimization problem. Commonly, the genetic algorithms are adopt one dimension code, this paper adopt the dual-structure code and Adaptive probabilities of crossover and mutation to solve the link enhancement problem. In the Simulation experiment, we compare the performance of dual-structure code genetic algorithm and one dimension code genetic algorithm.
Citation:
Yuhua Liu, Wei Teng, Kaihua Xu, Haiyan Zhu, "A Genetic Algorithm with Dual-Structure Code and Adaptive Strategy for Link Enhancement Problem," imsccs, vol. 2, pp.699-705, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||