论文信息 - Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem

Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem

Genetic algorithms have been applied to solve the 2-page drawing problem successfully, but they work with one global population, so the search time and space are limited. Parallelization provides an attractive prospect in improving the efficiency and solution quality of genetic algorithms. One of the most popular tools for parallel computing is Message Passing Interface (MPI). In this paper, we present four island models of Parallel Genetic Algorithms with MPI: island models with linear, grid, random graph topologies, and island model with periodical synchronisation. We compare their efficiency and quality of solutions for the 2-page drawing problem on a variety of graphs.

[1] Zbigniew Michalewicz,et al. Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[2] Hongmei He,et al. Genetic algorithms for bipartite and outerplanar graph drawings are best , 2005 .

[3] Sumio Masuda,et al. Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.

[4] Hongmei He,et al. New circular drawing algorithms , 2004 .

[5] L. Darrell Whitley,et al. Serial and Parallel Genetic Algorithms as Function Optimizers , 1993, ICGA.

[6] Farhad Shahrokhi,et al. The book crossing number of a graph , 1996, J. Graph Theory.

[7] Joachim Stender,et al. Parallel Genetic Algorithms: Introduction and Overview of Current Research , 1993 .

[8] Ron Shonkwiler,et al. Parallel Genetic Algorithms , 1993, ICGA.

[9] Erkki Mäkinen,et al. TimGA - A Genetic Algorithm for Drawing Undirected Graphs , 1996 .

[10] André da Motta Salles Barreto,et al. Graph layout using a genetic algorithm , 2000, Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks.

[11] Erick Cantú-Paz,et al. A Survey of Parallel Genetic Algorithms , 2000 .