An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem

zbMATH Open1313.90262MaRDI QIDQ5499321FDOQ5499321

Authors: Lingyi Kong 

Publication date: 11 February 2015

Recommendations

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

zbMATH Keywords

simulated annealinggenetic algorithmtraveling salesman problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (5)

• Solving constrained traveling salesman problems by genetic algorithms
• An efficient genetic algorithm for the traveling salesman problem with precedence constraints
• A hybrid genetic algorithm, list-based simulated annealing algorithm, and different heuristic algorithms for the travelling salesman problem
• Application of improved genetic simulated annealing algorithm in TSP optimization
• Solution to traveling salesman problems with simulated annealing partheno genetic algorithm in MATLAB

This page was built for publication: An applied research on a genetic algorithm based on simulated annealing of constrained traveling salesman problem

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