A new hybrid algorithm for solving large scale TSP

zbMATH Open1174.90769MaRDI QIDQ5455744FDOQ5455744

Authors: Xu Zhu, Zhi Han 

Publication date: 4 April 2008

Recommendations

• An Efficient Genetic Algorithm for the Traveling Salesman Problem
• A new genetic algorithm applied to the traveling salesman problem
• Hybrid genetic ant colony algorithm for traveling salesman problem
• A hybrid algorithm for TSP
• scientific article; zbMATH DE number 2092224

zbMATH Keywords

genetic algorithmsearching algorithmdivided and conquer methodTabu algorithm TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cited In (12)

• Solving TSP through the integration of OR and CP techniques
• Hybrid evolutionary fuzzy learning scheme in the applications of traveling salesman problems
• The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.
• A new hybrid heuristic approach for solving large traveling salesman problem
• Title not available (Why is that?)
• HYBRID NEWTON-RAPHSON GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM
• Solving large-scale TSP using a fast wedging insertion partitioning approach
• A parametric hybrid method for the traveling salesman problem
• A hybrid exact algorithm for the TSPTW
• A new approach to solve the traveling salesman problem
• A CLUSTERING AND GENETIC SCHEME FOR LARGE TSP OPTIMIZATION PROBLEMS
• Solution to traveling salesman problems with simulated annealing partheno genetic algorithm in MATLAB

This page was built for publication: A new hybrid algorithm for solving large scale TSP

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