Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm

DOI10.1016/S0895-7177(03)90129-4MaRDI QIDQ596885zbMATH OpenFDO

Authors Kengo Katayama, Hisayuki Hirabayashi, Hiroyuki Narihisa

Publication date 6 August 2004

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0895-7177(03)90129-4

zbMATH Keywords

Genetic operatorsParallel computerParallel genetic algorithmParameter determinationTraveling salesman problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Genetic algorithms and parallel processing
• Experience with fine-grained parallel genetic algorithms
• Efficient parallel genetic algorithms: Theory and practice
• scientific article; zbMATH DE number 1223406
• The parallel genetic algorithm as function optimizer

Cites work

• scientific article; zbMATH DE number 4191453 (Why is no real title available?)
• scientific article; zbMATH DE number 1082106 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• The parallel genetic algorithm as function optimizer

Cited in

(5)

• An analysis of an embedded crossover scheme on a GA-hard problem
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• scientific article; zbMATH DE number 5316003 (Why is no real title available?)
• The analysis of the interaction of the migration, diversity and permeability in parallel genetic algorithms
• The effects of a new selection operator on the performance of a genetic algorithm

This page was built for publication: Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm

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