Solving the Graph Planarization Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)
スポンサーリンク
概要
- 論文の詳細を見る
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.
- 社団法人電子情報通信学会の論文
- 2006-05-01
著者
-
WANG Rong-Long
Faculty of Engineering, Fukui University
-
OKAZAKI Kozo
Faculty of Engineering, University of Fukui
-
Wang Rong‐long
Univ. Fukui Fukui‐shi Jpn
-
Okazaki Kozo
Univ. Fukui Fukui‐shi Jpn
-
Okazaki Kozo
Faculty Of Engineering University Of Fukui
-
Wang Rong-long
Faculty Of Engineering Fukui University
関連論文
- Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
- A Local Search Based Learning Method for Multiple-Valued Logic Networks(Neural Networks and Bioengineering)
- A Multi-Layered Immune System for Graph Planarization Problem
- An Artificial Immune System with Feedback Mechanisms for Effective Handling of Population Size
- A Near-Optimum Parallel Algorithm for a Graph Layout Problem(Neural Networks and Bioengineering)
- Ant Colony Optimization with Genetic Operation and Its Application to Traveling Salesman Problem
- A Genetic Algorithm with Conditional Crossover and Mutation Operators and Its Application to Combinatorial Optimization Problems(Neural Networks and Bioengineering)
- Solving Maximum Cut Problem Using Improved Hop field Neural Network
- A Near-Optimum Parallel Algorithm for Bipartite Subgraph Problem Using the Hopfield Neural Network Learning
- Solving the Graph Planarization Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)
- A Hill-Shift Learning Algorithm of Hopfield Network for Bipartite Subgraph Problem(Neural Networks and Bioengineering)
- Solving the Bipartite Subgraph Problem Using Genetic Algorithm with Conditional Genetic Operators
- Solving Facility Layout Problem Using an Improved Genetic Algorithm(Numerical Analysis and Optimization)
- Solving the m-Way Graph Partitioning Problem Using a Genetic Algorithm