2018•Discrete and Continuous Dynamical Systems - SOpen access

A solution of TSP based on the ant colony algorithm improved by particle swarm optimization

Miao Yu

Abstract

TSP is a classic problem in the field of logistics, and ant colony algorithm is an important way to solve the problem. However, the ant colony algorithm has some shortcomings in practical application. In this paper, the ant colony algorithm is improved by particle swarm optimization algorithm, and the ant colony algorithm is obtained by giving the ant colony a certain ''particle property''. Finally, an example is given to demonstrate the effectiveness of the improved ant colony algorithm.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 23 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: Ant colony optimization algorithms, Parallel metaheuristic, Ant colony, Particle swarm optimization, Mathematical optimization, Metaheuristic, Artificial bee colony algorithm, Swarm intelligence