Some issues of designing genetic algorithms for traveling salesman problems

DOI10.1007/S00500-003-0317-8zbMath1073.90057OpenAlexW2069817790MaRDI QIDQ1764595

Xianqiang Yang

Publication date: 25 February 2005

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-003-0317-8

zbMATH Keywords

Genetic algorithmTraveling salesman problemEdge assembly crossoverHeterogeneous pairing selectionNeighbor-join mutation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times ⋮ A memetic algorithm for the generalized traveling salesman problem ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem

Uses Software

• TSPLIB

This page was built for publication: Some issues of designing genetic algorithms for traveling salesman problems