Ant Colony Optimization Algorithm

Our Group organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Ant Colony Optimization Algorithm

ACO has been widely applied to solving various combinatorial optimization problems such as traveling salesman problem (TSP), job-shop scheduling problem (JSP), vehicle routing problem (VRP), quadratic assignment problem (QAP), etc.. Although ACO has a powerful capacity to find out solutions to combinatorial optimization problems, it has the problems of stagnation, premature convergence and the convergence speed of ACO is always slow. These problems will be more obvious when the problem size increases.

  • Share this page
  • Facebook
  • Twitter
  • LinkedIn
  • Google+
  • Pinterest
  • Blogger