Eldridge, B. D., authorRoychowdhury, V. P., authorSiegel, H. J., authorMaciejewski, Anthony A., authorWang, L., authorTSI® Press, publisher2007-01-032007-01-032005Wang, L., et al., A Study of Five Parallel Approaches to a Genetic Algorithm for the Traveling Salesman Problems, Intelligent Automation and Soft Computing 11, no. 4 (2005): 217-234.http://hdl.handle.net/10217/67367This 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.born digitalarticleseng©2005 TSI® Press.Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.parallel genetic algorithmstraveling salesman problemmemetic algorithmsText