A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS

DOI10.1080/01969720903068435zbMath1302.90260OpenAlexW1773272079MaRDI QIDQ2934524

M. Yasin Özsağlam, Mehmet Çunkaş

Publication date: 15 December 2014

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

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

zbMATH Keywords

genetic algorithmstraveling salesman problemparticle swarm optimization

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
• COMPARATIVE STUDY OF SOME SOLUTION METHODS FOR TRAVELING SALESMAN PROBLEM USING GENETIC ALGORITHMS
• Evolutionary algorithms for single and multicriteria design optimization

This page was built for publication: A COMPARATIVE STUDY ON PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHMS FOR TRAVELING SALESMAN PROBLEMS