Solving the Graph Planarization Problem Using an Improved Genetic Algorithm
Rong‐Long Wang · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
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.