Solving the Graph Planarization Problem Using an Improved Genetic Algorithm

Authors:
Rong-Long Wang;Kozo Okazaki
Affiliations:
The authors are with the Faculty of Engineering, University of Fukui, Fukui-shi, 910-8507 Japan. E-mail: wang@fuee.fukui-u.ac.jp;The authors are with the Faculty of Engineering, University of Fukui, Fukui-shi, 910-8507 Japan. E-mail: wang@fuee.fukui-u.ac.jp
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2006

Citing 0
Cited 1

An effective ant colony algorithm for graph planarization problem

ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An improved genetic algorithm for solving the graph planarization problem is presented. The improved genetic algorithm which is designed to embed a graph on a plane, performs crossover and mutation conditionally instead of probability. The improved genetic algorithm is verified by a large number of simulation runs and compared with other algorithms. The experimental results show that the improved genetic algorithm performs remarkably well and outperforms its competitors.