Various Island-based parallel genetic algorithms for the 2-page drawing problem

Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, as part of the 24th IASTED International Multi-Conference on APPLIED INFORMATICS

Volumn 2006, Issue , 2006, Pages 316-323

  He, Hongmei ^a   Sýkora, Ondrej ^a   Salagean, Ana ^a  

^a LOUGHBOROUGH UNIVERSITY   (United Kingdom)

Author keywords

2 page book crossing number; Cartesian topologies; Computation to communication ratio; Island based parallel genetic algorithms; Periodical synchronization; Population to chromosome ratio

Indexed keywords

GRAPH THEORY; INTERFACES (COMPUTER); MATHEMATICAL MODELS; MESSAGE PASSING; PARALLEL ALGORITHMS; RANDOM PROCESSES;

2-PAGE BOOK CROSSING NUMBER; CARTESIAN TOPOLOGIES; COMPUTATION TO COMMUNICATION RATIO; ISLAND BASED PARALLEL GENETIC ALGORITHMS; PERIODICAL SYNCHRONIZATION; POPULATION TO CHROMOSOME RATIO;

GENETIC ALGORITHMS;

EID: 34047189822     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Barreto, A.M.S., Barbosa, H.J.C.: Graph layout using a genetic algorithm. Proceedings, VI Brazilian Symposium on Neural Networks (SBRN'00), 2000, pp.179-184.
2. Cantú-Paz, E.: A survey of parallel genetic algorithms. Calculateurs Parallèles, Reseaux et Systems Repartis, 10(2),(1998) pp.141-171.
3. Dorigo, M., Maaniezzo, V.: Parallel Genetic Algorithms: Introduction and Overview of Current Research, J. Stender, Ed. IOS Press, 1993.
4. Digalakis, J., Margaritis, K.: Parallel Evolutionary Algorithms on MPI, Inernational Conference on Computer, Communication and Control Technologies, Orlando, USA, CCCT'2003.
5. Eloranta, T., Mäkinen, E.: TimGA: a genetic algorithm for drawing undirected graphs. Divulg. Mat. 9 (2001), no. 2, pp.155-170.
6. Gordon, V.S., Whitley,D.: Serial and parallel genetic algorithms as function optimizers. Proceedings of the Fifth International Conference on Genetic Algorithms (S. Forrest, ed.), (1993) pp. 177-183.
7. He, H, Newton, M. C., Sýkora, O.: Genetic Algorithms for Bipartite and Outerplanar Graph Drawings are best!, in: Communications. SOFSEM'2005, pp.51-60.
8. He, H., Sykora, O., Erkki Mäkinen: Genetic algorithms for 2-page drawing problem, submitted, Journal of Heuristics.
9. He, H, Sýkora, O: New Circular Drawing Algori-htms, in: Proc. ITAT'2004.
10. He, H., Sykora, O., Vrt'o, I.: Heuristic Crossing Minimisation Algorithms For 2-page Drawings. The Electronic Notes in Discrete Mathematics (ENDM) 22 (2005) pp. 527-534.
11. Masuda, S., Kashiwabara, T., Nakajima, K., Fujisawa, T.: Crossing minimization in linear embeddings of graphs, IEEE Trans. Comput. 39 (1990) pp.124-127.
12. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, Second, Extended Edition, Springer 1994, p.211.
13. Radwan, Ahmed A. A., El-Sayed, Mohamed A.: Using genetic algorithm for drawing triangulated planar graphs. J. Inst. Math. Comput. Sci. Comput. Sci. Ser. 15 (2004), no. 1, pp.137-147.
14. Shonkwiler, R. Parallel Genetic Algorithms. In Forrest S. (ed.): Proceedings of the Fifth International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo, CA (1993) pp. 199-205
15. Shahrokhi, F., Sýkora, O., Székely, L.A., Vrt'o, I.: The book crossing number of a graph, Journal of Graph Theory 21 (1996), pp.413-424.
16. GDToolkit. http://www.dia.uniroma3.it/~ gdt/