IDEAS home Printed from https://ideas.repec.org/a/spr/metcap/v10y2008i3d10.1007_s11009-007-9047-1.html
   My bibliography  Save this article

Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement

Author

Listed:
  • Walter J. Gutjahr

    (University of Vienna)

  • Giovanni Sebastiani

    (CNR
    “Sapienza” University of Rome)

Abstract

The paper provides some theoretical results on the analysis of the expected time needed by a class of Ant Colony Optimization algorithms to solve combinatorial optimization problems. A part of the study refers to some general results on the expected runtime of the considered class of algorithms. These results are then specialized to the case of pseudo-Boolean functions. In particular, three well known functions and a combination of two of them are considered: the OneMax, the Needle-in-a-Haystack, the LeadingOnes, and the OneMax-Needle-in-a-Haystack. The results obtained for these functions are also compared to those from the well-investigated (1+1)-Evolutionary Algorithm. The results shed light on a suitable parameter choice for the considered class of algorithms. Furthermore, it turns out that for two of the four studied problems, the expected runtime for the considered class, expressed in terms of the problem size, is of the same order as that for (1+1)-Evolutionary Algorithm. For the other two problems, the results are significantly in favour of the considered class of Ant Colony Optimization algorithms.

Suggested Citation

  • Walter J. Gutjahr & Giovanni Sebastiani, 2008. "Runtime Analysis of Ant Colony Optimization with Best-So-Far Reinforcement," Methodology and Computing in Applied Probability, Springer, vol. 10(3), pages 409-433, September.
    • Handle: RePEc:spr:metcap:v:10:y:2008:i:3:d:10.1007_s11009-007-9047-1
    DOI: 10.1007/s11009-007-9047-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11009-007-9047-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11009-007-9047-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Walter J. Gutjahr, 2006. "On the Finite-Time Dynamics of Ant Colony Optimization," Methodology and Computing in Applied Probability, Springer, vol. 8(1), pages 105-133, March.
    2. Giovanni Sebastiani & Giovanni Luca Torrisi, 2005. "An Extended Ant Colony Algorithm and Its Convergence Analysis," Methodology and Computing in Applied Probability, Springer, vol. 7(2), pages 249-263, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karl F. Doerner & Vittorio Maniezzo, 2018. "Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 331-356, June.
    2. Paola Pellegrini & Elena Moretti & Daniela Favaretto, 2008. "Exploration in stochastic algorithms: An application on MAX-MIN Ant System," Working Papers 169, Department of Applied Mathematics, Università Ca' Foscari Venezia.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gutjahr, Walter J. & Katzensteiner, Stefan & Reiter, Peter & Stummer, Christian & Denk, Michaela, 2010. "Multi-objective decision analysis for competence-oriented project portfolio selection," European Journal of Operational Research, Elsevier, vol. 205(3), pages 670-679, September.
    2. Walter Gutjahr & Stefan Katzensteiner & Peter Reiter & Christian Stummer & Michaela Denk, 2008. "Competence-driven project portfolio selection, scheduling and staff assignment," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 16(3), pages 281-306, September.
    3. Karl F. Doerner & Vittorio Maniezzo, 2018. "Metaheuristic search techniques for multi-objective and stochastic problems: a history of the inventions of Walter J. Gutjahr in the past 22 years," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 26(2), pages 331-356, June.

    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:spr:metcap:v:10:y:2008:i:3:d:10.1007_s11009-007-9047-1. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.