Some issues of designing genetic algorithms for traveling salesman problems

DOI10.1007/S00500-003-0317-8zbMATH Open1073.90057OpenAlexW2069817790MaRDI QIDQ1764595FDOQ1764595

Authors: 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

Recommendations

• A genetic algorithm for traveling salesman problems
• Genetic algorithms for the traveling salesman problem
• scientific article; zbMATH DE number 4104744
• Genetic algorithms and traveling salesman problems
• Solving traveling salesman problems by genetic algorithms
• A new genetic algorithm applied to the traveling salesman problem
• Solving constrained traveling salesman problems by genetic algorithms
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• The Generalized Traveling Salesman Problem: A New Genetic Algorithm Approach

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)

Cited In (12)

• Evolutionary Computation in Combinatorial Optimization
• Different initial solution generators in genetic algorithms for solving the probabilistic traveling salesman problem
• Title not available (Why is that?)
• A new genetic algorithm applied to the traveling salesman problem
• A memetic algorithm for the generalized traveling salesman problem
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
• Title not available (Why is that?)
• COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
• Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
• Path planning on a cuboid using genetic algorithms
• A comparative study of four genetic algorithm-based crossover operators for solving travelling salesman problem
• Genetic algorithms for the traveling salesman problem

Uses Software

• TSPLIB

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

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