2014•Applied Mechanics and MaterialsOpen access

Solution of Travelling Salesman Problem Using Ant Colony Algorithm

Sevda Dayıoğlu Gülcü, Şaban Gülcü, Humar Kahramanlı

Abstract

Recently some studies have been revealed by inspiring from animals which live as colonies in the nature. Ant Colony System is one of these studies. This system is a meta-heuristic method which has been developed based upon food searching characteristics of the ant colonies. Ant Colony System is applied in a lot of discrete optimization problems such as travelling salesman problem. In this study solving the travelling salesman problem using ant colony system is aimed.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 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, Heuristic, Mathematical optimization, ANT, Extremal optimization, Computer science