Parallel Genetic Algorithms Applied to the Traveling Salesman Problem

DOI10.1137/0801031zbMath0754.90061OpenAlexW1972654269MaRDI QIDQ4012433

Jung Y. Suh, Prasanna Jog, Dirk Van Gucht

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801031

zbMATH Keywords

traveling salesmanGenetic algorithmsadaptive search algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Learning and adaptive systems in artificial intelligence (68T05) Parallel numerical computation (65Y05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (9)

Methodology for the reduction of parameters in the inverse transformation of Schwarz-Christoffel applied to electromagnetic devices with axial geometry ⋮ Heuristics for Reversal Distance Between Genomes with Duplicated Genes ⋮ Genetically improved presequences for Euclidean traveling salesman problems ⋮ Modifications of real code genetic algorithm for global optimization ⋮ Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison ⋮ Metaheuristics: A bibliography ⋮ An evolutionary computing approach for parameter estimation investigation of a model for cholera ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ A genetic algorithm approach to curve fitting

This page was built for publication: Parallel Genetic Algorithms Applied to the Traveling Salesman Problem