COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS

DOI10.1080/01969720802492967zbMath1167.90620OpenAlexW1986007359MaRDI QIDQ3393512

Malay Bhattacharyya, Anup Kumar Bandyopadhyay

Publication date: 26 August 2009

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969720802492967

zbMATH Keywords

networkgenetic algorithmstraveling salesman problem

Mathematics Subject Classification ID

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

Related Items

A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS ⋮ To improve the performance of genetic algorithms by using a novel selection operator ⋮ A new selection operator for genetic algorithms that balances between premature convergence and population diversity ⋮ INTERPRETATION OF THE GENERALIZED ZIPF-MANDELBROT LAW PARAMETERS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer Programming Formulation of Traveling Salesman Problems
• The Traveling Salesman Problem: A Survey
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem