• DocumentCode
    3773491
  • Title

    Convergence Analysis for Ant Colony Algorithm

  • Author

    Baojiang Zhao

  • Author_Institution
    Coll. of Sci., Mudanjing Normal Univ., Mudanjing, China
  • Volume
    1
  • fYear
    2015
  • Firstpage
    362
  • Lastpage
    365
  • Abstract
    A general method for combinatorial optimization problems heuristically by the Ant System approach is proposed. According to the two different conditions, some convergence analysis for Ant Colony System (ACS) are obtained. The global searching and convergence ability are improved by adaptively changing the lower pheromone bound. It is proved that ACS finds an optimal solution with probability 1.
  • Keywords
    "Convergence","Heuristic algorithms","Algorithm design and analysis","Ant colony optimization","Simulated annealing","Minimization"
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Design (ISCID), 2015 8th International Symposium on
  • Print_ISBN
    978-1-4673-9586-1
  • Type

    conf

  • DOI
    10.1109/ISCID.2015.99
  • Filename
    7468969
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3773491