Parallel Genetic Algorithms Applied to the Traveling Salesman Problem

DOI10.1137/0801031MaRDI QIDQ4012433zbMATH OpenOpenAlexFDO

Authors Prasanna Jog, Jung Y. Suh, D. 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

adaptive search algorithmsGenetic algorithmstraveling salesman

Mathematics Subject Classification ID

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

Recommendations

• Genetic algorithms for the traveling salesman problem
• Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study
• A new genetic algorithm applied to the traveling salesman problem
• scientific article; zbMATH DE number 4104744
• scientific article; zbMATH DE number 1223406

Cited in

(16)

• Genetically improved presequences for Euclidean traveling salesman problems
• Solving a two-agent single-machine scheduling problem considering learning effect
• Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
• Metaheuristics: A bibliography
• Modifications of real code genetic algorithm for global optimization
• Methodology for the reduction of parameters in the inverse transformation of Schwarz-Christoffel applied to electromagnetic devices with axial geometry
• An evolutionary computing approach for parameter estimation investigation of a model for cholera
• scientific article; zbMATH DE number 5300053 (Why is no real title available?)
• scientific article; zbMATH DE number 1223406 (Why is no real title available?)
• A genetic algorithm approach to curve fitting
• Implementation of a parallel Genetic Algorithm on a cluster of workstations: Traveling Salesman Problem, a case study
• Heuristics for reversal distance between genomes with duplicated genes
• Adaptive pseudo-parallel genetic algorithms for solving double standard solid transportation problem
• Scalable parallel genetic algorithms
• A Monte Carlo simulation-based simulated annealing algorithm for predicting the minimum staffing requirement at a blood donor centre
• Parallelisation of genetic algorithms for the 2-page crossing number problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012433)