IDEAS home Printed from https://ideas.repec.org/a/aio/aucsse/v2y2010i10p352-361.html
   My bibliography  Save this article

A Distributed Approach To Ant Colony Optimization

Author

Listed:
  • Eng. Sorin Ilie Ph. D Student

    (University of Craiova Software Engineering Department)

  • Prof. Costin Bădică Ph. D

    (University of Craiova Software Engineering Department)

Abstract

Swarm Intelligence(SI) is the emergent collective intelligence of groups of simple agents. Economy is an example of SI. Simulating an economy using Ant Colony algorithms would allow prediction and control of fluctuations in the complex emergent behavior of the simulated system. Such a simulation is far beyond SI's capabilities, which is still in its infancy. This paper presents a distributed approach implementing Ant Colony Optimization(ACO). We present our agent based architecture of ACO and initial experimental results on the Travelling Salesman Problem. The innovation of our work consists of: i)representing network nodes as software agents, ii) representing software agents as software objects that are passed as messages between the nodes according to ACO rules.

Suggested Citation

  • Eng. Sorin Ilie Ph. D Student & Prof. Costin Bădică Ph. D, 2010. "A Distributed Approach To Ant Colony Optimization," Annals of University of Craiova - Economic Sciences Series, University of Craiova, Faculty of Economics and Business Administration, vol. 2(38), pages 1-10, May.
    • Handle: RePEc:aio:aucsse:v:2:y:2010:i:10:p:352-361
    as

    Download full text from publisher

    File URL: http://feaa.ucv.ro/AUCSSE/0038v2-042.pdf
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Swarm Intelligence; Ant Colony Optimization; Multi-Agent; Distributed; Heuristis;
    All these keywords.

    JEL classification:

    • Y90 - Miscellaneous Categories - - Other - - - Other
    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    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:aio:aucsse:v:2:y:2010:i:10:p:352-361. 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: Anca Bandoi (email available below). General contact details of provider: https://edirc.repec.org/data/fecraro.html .

    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.