A gene-pool based genetic algorithm for TSP

DOI10.1007/BF02899482MaRDI QIDQ4454481zbMATH OpenOpenAlexFDO

Authors H. Yang, Lishan Kang, Yuping Chen

Publication date 8 March 2004

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02899482

zbMATH Keywords

minimal spanning tree

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 2219759
• scientific article; zbMATH DE number 2079469
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• A genetic algorithm for traveling salesman problems
• A CLUSTERING AND GENETIC SCHEME FOR LARGE TSP OPTIMIZATION PROBLEMS
• Genetic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 4104744
• A new genetic algorithm applied to the traveling salesman problem

Cites work

• scientific article; zbMATH DE number 177832 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• scientific article; zbMATH DE number 5582828 (Why is no real title available?)
• New lower bounds for the symmetric travelling salesman problem
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees

Cited in

(1)

• An Effective PSO-Based Memetic Algorithm for TSP

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication: A gene-pool based genetic algorithm for TSP

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