IDEAS home Printed from https://ideas.repec.org/a/igg/jcini0/v12y2018i1p42-59.html
   My bibliography  Save this article

Research and Application of Adaptive Step Mechanism for Glowworm Swarm Optimization Algorithm

Author

Listed:
  • Hong-Bo Wang

    (School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China)

  • Ke-Na Tian

    (School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China)

  • Xue-Na Ren

    (Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China)

  • Xu-Yan Tu

    (School of Computer and Communications Engineering, University of Science and Technology Beijing, Beijing, China)

Abstract

Glowworm Swarm Optimization Algorithm (GSO) is one of new swarm intelligence optimization algorithms in recent years. Its main idea comes from the cooperative behavior source among individuals during the process of courtship and foraging. In this article, in order to improve convergence speed in the late iteration, avoid the algorithm falling into local optimum, and reduce isolated nodes, the Adaptive Step Mechanism Glowworm Swarm Optimization (ASMGSO) is proposed. The main idea of ASMGSO algorithm is as follows: (1) On the basis of SMGSO algorithm, isolated nodes carry out bunching operator firstly, that is to say they are moving to the central position of the group. If the new position is not better than the current position, then isolated nodes perform mutation operation. (2) At the same time, the fixed step mechanism has been improved. The effectiveness of the proposed ASMGSO algorithm is verified through several classic test functions and application in Distance Vector-Hop.

Suggested Citation

  • Hong-Bo Wang & Ke-Na Tian & Xue-Na Ren & Xu-Yan Tu, 2018. "Research and Application of Adaptive Step Mechanism for Glowworm Swarm Optimization Algorithm," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), IGI Global, vol. 12(1), pages 42-59, January.
    • Handle: RePEc:igg:jcini0:v:12:y:2018:i:1:p:42-59
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJCINI.2018010104
    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:jcini0:v:12:y:2018:i:1:p:42-59. 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.