Survey of Ant Colony Optimization

Publish Year: 1402
نوع سند: مقاله کنفرانسی
زبان: Persian
View: 28

This Paper With 8 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

CENAF02_113

تاریخ نمایه سازی: 20 فروردین 1403

Abstract:

Ant Colony Optimization (ACO) uses behavior observed in real-life ant colonies in order to solve shortest path problems. Short paths are found with the use of pheromones, which allow ants to communicate indirectly. Ant Colony Optimization (ACO) is a metaheuristic proposed by Marco Dorigo in ۱۹۹۱ based on behavior of biological ants. Pheromone laying and selection of shortest route with the help of pheromone inspired development of first ACO algorithm. Since, presentation of first such algorithm, many researchers have worked and published their research in this field. Though initial results were not so promising but recent developments have made this metaheuristic a significant algorithm in Swarm Intelligence. This research presents a brief overview of recent developments carried out in ACO algorithms in terms of both applications and algorithmic developments.

Keywords:

Multiple traveling salesman problem , Ant Colony Optimization , TSP

Authors

MITRA ZAREH

Master's student in artificial intelligence ,APADANA university ,Shiraz ,Iran