Some issues of designing genetic algorithms for traveling salesman problems
From MaRDI portal
Publication:1764595
DOI10.1007/s00500-003-0317-8zbMath1073.90057MaRDI QIDQ1764595
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
Genetic algorithm; Traveling salesman problem; Edge assembly crossover; Heterogeneous pairing selection; Neighbor-join mutation
90C35: Programming involving graphs or networks
90C59: Approximation methods and heuristics in mathematical programming
Uses Software