ACO & AIS For Solving Combinatorial Optimization Problems: CSE 462 Algorithm Engineering Cse, Buet
ACO & AIS For Solving Combinatorial Optimization Problems: CSE 462 Algorithm Engineering Cse, Buet
FB
FB
Since the route B is shorter, the ants on this path will complete the travel more times and thereby lay more pheromone over it.
FB
FB
Ant reaches next node, selects next path Continues until reaches starting node Finished tour is a solution
FB
New cycle is performed Repeated until most ants select the same tour on every cycle (convergence to solution)
FB
FB
ACO
Can be used for both Static and Dynamic Combinatorial optimization problems Convergence is guaranteed, although the speed is unknown
Value Solution
FB
ACO Parameters
The parameters considered here are those that affect directly or indirectly the computation of the probability for path transition:
: the relative importance of the trail, >0 : the relative importance of the visibility, >0 : trail persistence, Q : a constant related to the quantity of trail laid by ants as trail evaporation
FB
Visibility in ACO
A local heuristic function related to the problem domain
A function based on d in case of TSP
Typically local heuristic functions are similar to objective functions in greedy algorithms.
FB
FB
FB
Objects are arranged in groups Exactly one object from each group
FB
Heuristic functions depending on the ratio of profit and resource consumption rate of an object
FB
FB
FB
FB
FB
FB
FB
FB
FB
Thank you !
FB