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

Authors:
Kengo Katayama;Hisayuki Hirabayashi;Hiroyuki Narihisa
Affiliations:
Department of Information and Computer Engineering Okayama University of Science 1-1 Ridai-cho, Okayama, 700-0005 Japan;Matsushita System and Technology Co., Ltd., 1 Yakimachi, Kotari, Nagaokakyo, Kyoto, 617-8520 Japan;Department of Information and Computer Engineering Okayama University of Science 1-1 Ridai-cho, Okayama, 700-0005 Japan
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2003

Citing 8
Cited 3

Punctuated equilibria: a parallel genetic algorithm

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy

Proceedings of the 3rd International Conference on Genetic Algorithms
Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

Proceedings of the 3rd International Conference on Genetic Algorithms
Parallel Genetic Algorithms Population Genetics and Combinatorial Optimization

Proceedings of the 3rd International Conference on Genetic Algorithms
Structure and Performance of Fine-Grain Parallelism in Genetic Search

Proceedings of the 5th International Conference on Genetic Algorithms
Serial and Parallel Genetic Algorithms as Function Optimizers

Proceedings of the 5th International Conference on Genetic Algorithms
New Genetic Local Search Operators for the Traveling Salesman Problem

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature

A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences

Journal of Biomedical Informatics
On directed edge recombination crossover for ATSP

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part I
High-Performance Computing for Data Analytics

DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications

Quantified Score

Hi-index	0.98

Visualization

Abstract

The parallel genetic algorithms (PGA) have been developed for combinatorial optimization problems, and its parallel efficiencies have been investigated on a specific problem. These investigations were concerned with how to design a topology and the determination of the optimum setting for parameters (for example, size of subpopulations, migration interval, and so on) rather than the effectiveness of genetic operators. This paper investigates a relation between the parallel efficiency of the coarse-grained PGA and genetic (crossover and selection) operators for the traveling salesman problem on an MIMD parallel computer. The following genetic operators are considered: improved edge recombination (IERX), distance preserving (DPX), and complete subtour exchange (CSEX) crossovers, and two selection operators, which have relatively high selection pressures. Computational results indicate that the parallel efficiency is significantly affected by the difference of crossovers rather than the selections, and the PGA with CSEX gives better properties.