IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/6469721.html
   My bibliography  Save this article

Parameter Selection for Ant Colony Algorithm Based on Bacterial Foraging Algorithm

Author

Listed:
  • Peng Li
  • Hua Zhu

Abstract

The optimal performance of the ant colony algorithm (ACA) mainly depends on suitable parameters; therefore, parameter selection for ACA is important. We propose a parameter selection method for ACA based on the bacterial foraging algorithm (BFA), considering the effects of coupling between different parameters. Firstly, parameters for ACA are mapped into a multidimensional space, using a chemotactic operator to ensure that each parameter group approaches the optimal value, speeding up the convergence for each parameter set. Secondly, the operation speed for optimizing the entire parameter set is accelerated using a reproduction operator. Finally, the elimination-dispersal operator is used to strengthen the global optimization of the parameters, which avoids falling into a local optimal solution. In order to validate the effectiveness of this method, the results were compared with those using a genetic algorithm (GA) and a particle swarm optimization (PSO), and simulations were conducted using different grid maps for robot path planning. The results indicated that parameter selection for ACA based on BFA was the superior method, able to determine the best parameter combination rapidly, accurately, and effectively.

Suggested Citation

  • Peng Li & Hua Zhu, 2016. "Parameter Selection for Ant Colony Algorithm Based on Bacterial Foraging Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-12, December.
  • Handle: RePEc:hin:jnlmpe:6469721
    DOI: 10.1155/2016/6469721
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/6469721.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2016/6469721.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2016/6469721?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
    ---><---

    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:hin:jnlmpe:6469721. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.