IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v8y2017i4p1-17.html
   My bibliography  Save this article

Running-time Analysis of Ant System Algorithms with Upper-bound Comparison

Author

Listed:
  • Han Huang

    (School of Software Engineering, South China University of Technology, Guangzhou, China)

  • Hongyue Wu

    (School of Software Engineering, South China University of Technology, Guangzhou, China)

  • Yushan Zhang

    (School of Statistics and Mathematics, Guangdong University of Finance and Economics, Guangzhou, China)

  • Zhiyong Lin

    (Department of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, China)

  • Zhifeng Hao

    (School of Applied Mathematics, Guangdong University of Technology, Guangzhou, China)

Abstract

Running-time analysis of ant colony optimization (ACO) is crucial for understanding the power of the algorithm in computation. This paper conducts a running-time analysis of ant system algorithms (AS) as a kind of ACO for traveling salesman problems (TSP). The authors model the AS algorithm as an absorbing Markov chain through jointly representing the best-so-far solutions and pheromone matrix as a discrete stochastic status per iteration. The running-time of AS can be evaluated by the expected first-hitting time (FHT), the least number of iterations needed to attain the global optimal solution on average. The authors derive upper bounds of the expected FHT of two classical AS algorithms (i.e., ant quantity system and ant-cycle system) for TSP. They further take regular-polygon TSP (RTSP) as a case study and obtain numerical results by calculating six RTSP instances. The RTSP is a special but real-world TSP where the constraint of triangle inequality is stringently imposed. The numerical results derived from the comparison of the running time of the two AS algorithms verify our theoretical findings.

Suggested Citation

  • Han Huang & Hongyue Wu & Yushan Zhang & Zhiyong Lin & Zhifeng Hao, 2017. "Running-time Analysis of Ant System Algorithms with Upper-bound Comparison," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 8(4), pages 1-17, October.
    • Handle: RePEc:igg:jsir00:v:8:y:2017:i:4:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.2017100101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsir00:v:8:y:2017:i:4:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.