A study of five parallel approaches to a genetic algorithm for the traveling salesman problem

Academic Article

Abstract

  • This paper presents a comparative study of five different coarse-grained parallel genetic algorithms (PGAs) using the traveling salesman problem as the case application. All of these PGAs are based on the same baseline serial genetic algorithm, implemented on the same parallel machine (IBM SP2), tested on the same problem instances, and started from the same set of initial populations. Based on these experiments, a 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. © 2005 TSI Press.
  • Authors

    Digital Object Identifier (doi)

    Author List

  • Wang L; Maciejewski AA; Siegel HJ; Roychowdhury VP; Eldridge BD
  • Start Page

  • 217
  • End Page

  • 234
  • Volume

  • 11
  • Issue

  • 4