Parallelisation of genetic algorithms for the 2-page crossing number problem

DOI10.1016/J.JPDC.2006.08.002MaRDI QIDQ866771zbMATH OpenOpenAlexFDO

Authors Hongmei He, Ondrej Sýkora, Ana Sălăgean, Erkki Mäkinen

Publication date 14 February 2007

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://figshare.com/articles/journal_contribution/Parallelisation_of_genetic_algorithms_for_the_2-page_crossing_number_problem/9401642

zbMATH Keywords

parallel genetic algorithmsevaluation measures2-page crossing number

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• Scalable parallel genetic algorithms
• Parallel Genetic Algorithms Applied to the Traveling Salesman Problem
• Solving facility layout problems with geometric constraints using parallel genetic algorithms: Experimentation and findings
• scientific article; zbMATH DE number 759412
• Efficient parallel genetic algorithms: Theory and practice

Cited in

(7)

• A Dynamic Multi Agent-Based Approach to Parallelizing Genetic Algorithm
• Parallel genetic algorithm for SAT problems based on OpenMP
• Parallel metaheuristics: recent advances and new trends
• 1-page and 2-page drawings with bounded number of crossings per edge
• A parallel solution to the HIP game based on genetic algorithms
• Median based conversion of SGPA into percentage by cognitive methods
• Comparative study of serial and parallel heuristics used to design combinational logic circuits

Describes a project that uses

Uses Software

• TimGA

This page was built for publication: Parallelisation of genetic algorithms for the 2-page crossing number problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866771)