Description: Ant Colony Optimization Algorithm (ACO) and TSP
ACO algorithm mimics the behavior of real life ants and on how they interact with each other. The basic philosophy of the algorithm involves the movement of a colony of ants through the different states of the problem influenced by two local decision policies, viz., trails and attractiveness and two mechanisms, viz., trail evaporation and daemon actions. The algorithm aims to search for an optimal path based on the behavior of ants seeking a path between their colony and a source of food. Thereby, each such ant incrementally constructs a solution to the problem.
To Search:
File list (Check if you may need any files):
ACO-TSP\ACO.m
.......\ACO_Elitist.m
.......\ACO_rank.m
.......\ACS.m
.......\calculated_distance.m
.......\data.xlsx
.......\fitness.m
.......\MMAS.m
.......\RouletteWheel.m
.......\~$data.xlsx
ACO-TSP
Download