Anzeige
Erschienen in:
2019 | OriginalPaper | Buchkapitel
13. A Modified and Enhanced Ant Colony Optimization Algorithm for Traveling Salesman Problem
verfasst von : Leila Eskandari, Ahmad Jafarian, Parastoo Rahimloo, Dumitru Baleanu
Erschienen in: Mathematical Methods in Engineering
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this paper an effective modification has been performed on the Ant Colony Optimization algorithm and used for solving traveling salesman problem (TSP). The traveling salesman problem is one of the famous and important problems and it has been used in the algorithms to analyze its performance in solving the discreet problems. The modified and enhanced ACO has been used for solving this problem and it is called MEACO. In MEACO the modification has been performed by taking effect of mutation on the global best and personal best of each ant. The personal best is stored for each ant same as the PSO algorithm. Original ACO for discrete problems mostly trap in the local solutions, but the proposed method has been designed to cover this deficiency and make it more suitable for optimization of discrete problems. The experiment on the set of benchmark problems for Traveling salesman was performed and obtained results showed that MEACO is an effective method in finding the path for TSP.