A Comparative Study of Five Parallel Genetic Algorithms using the Traveling Salesman Problem

Authors:
Affiliations:
Venue:
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Year:
1998

Citing 4
Cited 6

SP2 system architecture

IBM Systems Journal
The Effects of Population SizeHeuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem

Proceedings of the 3rd International Conference on Genetic Algorithms
Distributed Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Optimization Using Distributed Genetic Algorithms

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature

Search space extension and PGAs: a comparative study of parallelization schemes to genetic algorithms using the TSP

AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
CompuP2P: An Architecture for Internet Computing Using Peer-to-Peer Networks

IEEE Transactions on Parallel and Distributed Systems
Exploring selection mechanisms for an agent-based distributed evolutionary algorithm

Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Investigating generalization in parallel evolutionary artificial neural networks

AIAP'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: artificial intelligence and applications
Grisland: a parallel genetic algorithm for finding near optimal solutions to the traveling salesman problem

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Combinatorial Optimization Using Electro-Optical Vector by Matrix Multiplication Architecture

OSC '09 Proceedings of the 2nd International Workshop on Optical SuperComputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to solve larger problems and to find better solutions. In this paper, a comparative analysis of five different coarse-grained PGAs is conducted using the traveling salesman problem as the basis of this case study. To make fair comparisons, all of these PGAs are based on the same baseline SGA, implemented on the same parallel machine (IBM SP2), tested on the same set of traveling salesman problem instances, and started from the same set of initial populations. As a result of the experiments conducted in this study, a particular PGA that combines a new subtour technique with a known migration approach is identified to be the best for the traveling salesman problem among the five PGAs being compared.