• DocumentCode
    2604475
  • Title

    A Path Planning Method of Contingency Logistics Based on Max-Min Ant System

  • Author

    Jin, Baohua ; Zhang, Liang

  • Author_Institution
    Dept. of Comput. & Commun. Eng., Zhengzhou Univ. of Light Ind., Zhengzhou, China
  • fYear
    2010
  • fDate
    17-18 April 2010
  • Firstpage
    311
  • Lastpage
    314
  • Abstract
    It is very important in the contingency logistics system to complete distribution task rapidly, the path planning method is a key factor in contingency logistics. A path planning approach based on Max-Min ant system is proposed in this paper. According to the specific characteristics of logistics in the practical application, the search path of the distribution is optimized and improved by using the Max-Min ant system. Max-Min ant system limits the pheromone in an appropriate range, which overcomes the shortcoming of slow convergence and easily trapping in local optimum of conventional algorithms. The final experiments show that the proposed Max-Min ant system in the contingency logistics quickly can find the shortest path, which not only meets people´s needs, but reduces the cost of logistics.
  • Keywords
    goods distribution; logistics; minimax techniques; path planning; contingency logistics system; distribution search path; max-min ant system; path planning method; Ant colony optimization; Communication industry; Computer industry; Convergence; Costs; Evolutionary computation; Logistics; Path planning; Traveling salesman problems; Wearable computers; Contingency Logistics; Keywords-Ant Colony Optimization; Max-Min Ant System; Traveling Salesman Problem (TSP);
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wearable Computing Systems (APWCS), 2010 Asia-Pacific Conference on
  • Conference_Location
    Shenzhen
  • Print_ISBN
    978-1-4244-6467-8
  • Electronic_ISBN
    978-1-4244-6468-5
  • Type

    conf

  • DOI
    10.1109/APWCS.2010.85
  • Filename
    5481150