A gene-pool based genetic algorithm for TSP

DOI10.1007/BF02899482zbMath1062.68582OpenAlexW1971767633MaRDI QIDQ4454481

Hui 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

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

Uses Software

• TSPLIB

Cites Work

• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
• New lower bounds for the symmetric travelling salesman problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

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