Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2010.010407
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 1 Issue 4, 2010.
Abstract: This paper gives a brief about two of the meta-heuristic techniques that are used to find best among the optimal solutions for complex problems like travelling salesman problem, Quadratic problem. Both of these techniques are based on the natural phenomenon of ant. Ant algorithm find good path but due to some short comings of it, this algorithm is not able to give best out of the good or optimal solutions, but modified ant algorithm which is based on probability finds out the best among the optimal paths We will also see that the modified ant algorithm can obtain less number of hops which helps us to get the best solution to typical problems.
Shaveta Malik, “Performance Comparison between Ant Algorithm and Modified Ant Algorithm ” International Journal of Advanced Computer Science and Applications(IJACSA), 1(4), 2010. http://dx.doi.org/10.14569/IJACSA.2010.010407