• DocumentCode
    3281853
  • Title

    Improving ant systems using a local updating rule

  • Author

    Pintea, Camelia-Mihaela ; Dumitrescu, D.

  • Author_Institution
    Dept. of Comput.-Sci., ´´George Cosbuc´´ Coll., Cluj-Napoca, Romania
  • fYear
    2005
  • fDate
    25-29 Sept. 2005
  • Abstract
    An algorithm based on ant colony system for solving traveling salesman problem is proposed. The new algorithm, introduces in ant colony system an inner loop aiming to update the pheromone trails. The update increases the pheromone in the trail followed by the ants and therefore generates improved tours.
  • Keywords
    artificial life; travelling salesman problems; ant colony system; ant systems; local updating rule; pheromone trails; traveling salesman problem; Ant colony optimization; Chemicals; Educational institutions; Feedback; NP-hard problem; Partitioning algorithms; Routing; Scheduling algorithm; Traveling salesman problems; Vehicles;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Symbolic and Numeric Algorithms for Scientific Computing, 2005. SYNASC 2005. Seventh International Symposium on
  • Print_ISBN
    0-7695-2453-2
  • Type

    conf

  • DOI
    10.1109/SYNASC.2005.38
  • Filename
    1595863
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3281853