Approximation performance of ant colony optimization for the TSP(1,2) problem

DOI10.1080/00207160.2015.1071359zbMath1400.68197OpenAlexW2295128024MaRDI QIDQ2957749

Yuren Zhou, Xue Peng, Gang Xu

Publication date: 27 January 2017

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

NP-completeant colony optimizationruntime analysis\(\mathrm{TSP}(1,2)\)approximation performance

Mathematics Subject Classification ID

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

Cites Work

• Runtime analysis of ant colony optimization with best-so-far reinforcement
• First steps to the runtime complexity analysis of ant colony optimization
• P-Complete Approximation Problems
• The Traveling Salesman Problem with Distances One and Two
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Approximation performance of ant colony optimization for the TSP(1,2) problem