An improved genetic algorithm for solving travel salesman problem

MaRDI QIDQ5398605zbMATH OpenFDO

Authors Hehua Liu, Chao Cui, Jing Chen

Publication date 28 February 2014

zbMATH Keywords

crossover operatorend algebragenetic algorithmtravelling salesman problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• Seeker genetic algorithm solving traveling salesman problem
• Solving traveling salesman problems by genetic algorithms
• A genetic algorithm for traveling salesman problems
• A new genetic algorithm applied to the traveling salesman problem

Cited in

(12)

• The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
• Improvement analysis and application of real-coded genetic algorithm for solving constrained optimization problems
• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• Solving the traveling salesman problem using a genetic algorithm based on Latin hypercube sampling
• An improved immune genetic algorithm for optimal path of travelling salesman problems
• Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem
• Solving TSP with improved multi-Agent genetic algorithm
• scientific article; zbMATH DE number 1738699 (Why is no real title available?)
• scientific article; zbMATH DE number 1839653 (Why is no real title available?)
• Seeker genetic algorithm solving traveling salesman problem
• Traveling route selection problem based on improved genetic algorithms
• A reinforced hybrid genetic algorithm for the traveling salesman problem

This page was built for publication: An improved genetic algorithm for solving travel salesman problem

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