IDEAS home Printed from
   My bibliography  Save this article

A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior


  • Bin, Wei
  • Qinke, Peng
  • Jing, Zhao
  • Xiao, Chen


Recently, nature-inspired algorithms have increasingly attracted the attention of researchers. Due to the fact that in BPSO the position vectors consisting of ‘0’ and ‘1’ can be seen as a decision behavior (support or oppose), in this paper, we propose a BPSO with hierarchical structure (BPSO_HS for short), on the basis of multi-level organizational learning behavior. At each iteration of BPSO_HS, particles are divided into two classes, named ‘leaders’ and ‘followers’, and different evolutionary strategies are used in each class. In addition, the mutation strategy is adopted to overcome the premature convergence and slow convergent speed during the later stages of optimization. The algorithm was tested on two discrete optimization problems (Traveling Salesman and Bin Packing) as well as seven real-parameter functions. The experimental results showed that the performance of BPSO_HS was significantly better than several existing algorithms.

Suggested Citation

  • Bin, Wei & Qinke, Peng & Jing, Zhao & Xiao, Chen, 2012. "A binary particle swarm optimization algorithm inspired by multi-level organizational learning behavior," European Journal of Operational Research, Elsevier, vol. 219(2), pages 224-233.
  • Handle: RePEc:eee:ejores:v:219:y:2012:i:2:p:224-233
    DOI: 10.1016/j.ejor.2012.01.007

    Download full text from publisher

    File URL:
    Download Restriction: Full text for ScienceDirect subscribers only

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

    References listed on IDEAS

    1. Liu, D.S. & Tan, K.C. & Huang, S.Y. & Goh, C.K. & Ho, W.K., 2008. "On solving multiobjective bin packing problems using evolutionary particle swarm optimization," European Journal of Operational Research, Elsevier, vol. 190(2), pages 357-382, October.
    2. Unler, Alper & Murat, Alper, 2010. "A discrete particle swarm optimization method for feature selection in binary classification problems," European Journal of Operational Research, Elsevier, vol. 206(3), pages 528-539, November.
    3. Yin, Peng-Yeng & Glover, Fred & Laguna, Manuel & Zhu, Jia-Xian, 2010. "Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies," European Journal of Operational Research, Elsevier, vol. 201(2), pages 377-389, March.
    Full references (including those not matched with items on IDEAS)


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

    Cited by:

    1. repec:eee:ejores:v:264:y:2018:i:1:p:74-88 is not listed on IDEAS


    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:eee:ejores:v:219:y:2012:i:2:p:224-233. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.