• DocumentCode
    2880972
  • Title

    Ant colony optimization for best path planning

  • Author

    Hsiao, Ying-Tung ; Cheng-Long Chuang ; Chien, Cheng-Chih

  • Author_Institution
    Dept. of Electr. Eng., Tamkang Univ., Taipei, Taiwan
  • Volume
    1
  • fYear
    2004
  • fDate
    26-29 Oct. 2004
  • Firstpage
    109
  • Abstract
    The paper presents an optimal approach to search the best path of a map considering the traffic loading conditions. The main objective of this work is to minimize the path length to get the best path planning for a given map. This study proposes a solution algorithm based on the ant colony optimization technique to search the shortest path from a desired origin to a desired destination of the map. The proposed algorithm is implemented in C++. Furthermore, the simulation program can randomly generate maps for evaluating its flexibility and performance. Simulation results demonstrate that the proposed algorithm can obtain the shortest path of a map with fast speed.
  • Keywords
    combinatorial mathematics; optimisation; path planning; telecommunication network routing; topology; traffic; C++; ant colony optimization; best path planning; best path searching algorithms; combinatorial optimization problems; driving guidance; network routing; path length minimization; shortest path; topology; traffic loading conditions; Ant colony optimization; Bandwidth; Electronic mail; Hydroelectric power generation; Packaging; Path planning; Routing; Scheduling algorithm; Telecommunication traffic; Traveling salesman problems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications and Information Technology, 2004. ISCIT 2004. IEEE International Symposium on
  • Print_ISBN
    0-7803-8593-4
  • Type

    conf

  • DOI
    10.1109/ISCIT.2004.1412460
  • Filename
    1412460