Ant Colony Algorithm |
Input: weighted graph, neighborhood info While termination not met do Compute-initial pheromone, node dist potential Schedule activities Ant based solution construction Pheromone update Node distance potential update End activities Best <-best solution in population of solution |
Output: Best, candidate to optimal solution |