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

DOI10.1080/00207160.2015.1071359MaRDI QIDQ2957749zbMATH OpenOpenAlexFDO

Authors Xue Peng, Yuren Zhou, 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

\(\mathrm{TSP}(1,2)\)ant colony optimizationapproximation performanceNP-completeruntime analysis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1390344
• Solving the probabilistic TSP with ant colony optimization
• scientific article; zbMATH DE number 2159380
• Ant colony optimization: An overview
• Ant colony optimization and the minimum spanning tree problem

Cites work

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

Cited in

(4)

• Solving the probabilistic TSP with ant colony optimization
• A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
• scientific article; zbMATH DE number 2156295 (Why is no real title available?)
• Ant colony optimization and the minimum spanning tree problem

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

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