2009•Journal of Harbin University of CommerceRequires access

Study on solving traveling salesman problem by using ant colony algorithm

Gao Chun-tao

Abstract

Introduces a solution to the complex optimization problems for the new heuristic algorithm ant colony algorithm.The algorithm describes the basic principles of the model and algorithm in the traveling salesman problem in the specific application process.The results show that the parallel algorithm,robustness,such as the nature of the fine.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

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, Mathematical optimization, Robustness (evolution), 2-opt, Extremal optimization, Heuristic, Computer science