Omicron ACO. A New Ant Colony Optimization Algorithm

@article{Barn2005OmicronAA,
  title={Omicron ACO. A New Ant Colony Optimization Algorithm},
  author={Benjam{\'i}n Bar{\'a}n and Osvaldo G{\'o}mez},
  journal={CLEI Electron. J.},
  year={2005},
  volume={8}
}
Ant Colony Optimization (ACO) is a metaheuristic inspired by the foraging behavior of ant colonies that has been successful in the resolution of hard combinatorial optimization problems like the Traveling Salesman Problem (TSP). This paper proposes the Omicron ACO (OA), a novel population-based ACO alternative originally designed as an analytical tool. To experimentally prove OA advantages, this work compares the behavior between the OA and the MMAS as a function of time in two well-known TSP… CONTINUE READING
9 Extracted Citations
16 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 16 references

Gutjahr . ACO Algorithms with Guaranteed Convergence to the Optimal Solution

  • J. Walter
  • Information Processing Letters
  • 2002

For a Formal Foundation of the Ant Programming Approach to Combinatorial Optimization

  • G. Di Caro
  • 2000

Similar Papers

Loading similar papers…