An Improved Ant Colony Optimization Supervised by PSO

Abstract:

Article Preview

Combined with the idea of the particle swarm optimization (PSO) algorithm, the ant colony optimization (ACO) algorithm is presented to solve the well known traveling salesman problem (TSP). The core of this algorithm is using PSO to optimize the control parameters of ACO which consist of heuristic factor, pheromone evaporation coefficient and the threshold of stochastic selection, and applying ant colony system to routing. The new algorithm effectively overcomes the influence of control parameters of ACO and decreases the numbers of useless experiments, aiming to find the balance between exploiting the optimal solution and enlarging the search space.

Info:

Periodical:

Advanced Materials Research (Volumes 108-111)

Edited by:

Yanwen Wu

Pages:

1354-1359

DOI:

10.4028/www.scientific.net/AMR.108-111.1354

Citation:

Z. G. Zhou "An Improved Ant Colony Optimization Supervised by PSO", Advanced Materials Research, Vols. 108-111, pp. 1354-1359, 2010

Online since:

May 2010

Authors:

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.