2007•Unpublished venueRequires access

An Ant Colony System Hybridized with Randomized Algorithm for TSP

Chengming Qi

Abstract

Ant algorithms are a recently developed, population- based approach which has been successfully applied to several NP-hard combinatorial optimization problems. In this paper, through an analysis of the constructive procedure of the solution in the ant colony system (ACS),we present an ant colony system hybridized with randomized algorithm(RAACS). In RAACS, only partial cities are randomly chosen to compute the state transition probability. Experimental results for solving the traveling salesman problems(TSP) with both ACS and RAACS demonstrate that averagely speaking, the proposed method is better in both the quality of solutions and the speed of convergence compared with the ACS.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Travelling salesman problem, Ant colony optimization algorithms, Ant colony, Convergence (economics), Constructive, Computer science, Mathematical optimization, Population