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

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.

[1]  Shutao Li,et al.  Gene selection using hybrid particle swarm optimization and genetic algorithm , 2008, Soft Comput..

[2]  Fred W. Glover,et al.  Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies , 2010, Eur. J. Oper. Res..

[3]  Emanuel Falkenauer,et al.  A hybrid grouping genetic algorithm for bin packing , 1996, J. Heuristics.

[4]  Benjamin M. Galvin,et al.  Leadership and organizational learning: A multiple levels perspective , 2006 .

[5]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[6]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[7]  Eduardo Salas,et al.  Group Decision Making Under Stress , 1991 .

[8]  Q. Henry Wu,et al.  Group Search Optimizer: An Optimization Algorithm Inspired by Animal Searching Behavior , 2009, IEEE Transactions on Evolutionary Computation.

[9]  James T. Lin,et al.  A modified particle swarm optimization for production planningproblems in the TFT Array process , 2009, Expert Syst. Appl..

[10]  Shelley D. Dionne,et al.  Levels-based leadership and hierarchical group decision optimization: A simulation , 2008 .

[11]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[12]  G. Graen,et al.  Relationship-based approach to leadership: Development of leader-member exchange (LMX) theory of leadership over 25 years: Applying a multi-level multi-domain perspective , 1995 .

[13]  Yanbin Yuan,et al.  An improved binary particle swarm optimization for unit commitment problem , 2009, Expert Syst. Appl..

[14]  Byung-In Kim,et al.  Last two fit augmentation to the well-known construction heuristics for one-dimensional bin-packing problem: an empirical study , 2010 .

[15]  Alper Ekrem Murat,et al.  A discrete particle swarm optimization method for feature selection in binary classification problems , 2010, Eur. J. Oper. Res..

[16]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[17]  Novruz Allahverdi,et al.  Development a new mutation operator to solve the Traveling Salesman Problem by aid of Genetic Algorithms , 2011, Expert Syst. Appl..

[18]  Jun Zhang,et al.  A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.

[19]  Alberto García-Villoria,et al.  Introducing dynamic diversity into a discrete particle swarm optimization , 2009, Comput. Oper. Res..

[20]  Jun Zhang,et al.  A novel discrete particle swarm optimization to solve traveling salesman problem , 2007, 2007 IEEE Congress on Evolutionary Computation.

[21]  Salman Mohagheghi,et al.  Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems , 2008, IEEE Transactions on Evolutionary Computation.

[22]  Nagham Azmi AL-Madi,et al.  A genetic algorithm that simulates social behaviour , 2009 .

[23]  María Cristina Riff,et al.  Towards an immune system that solves CSP , 2007, 2007 IEEE Congress on Evolutionary Computation.

[24]  Petros Koumoutsakos,et al.  Optimization based on bacterial chemotaxis , 2002, IEEE Trans. Evol. Comput..

[25]  Shiu Yin Yuen,et al.  A Genetic Algorithm That Adaptively Mutates and Never Revisits , 2009, IEEE Trans. Evol. Comput..

[26]  B. Bass.  Bass & Stogdill's handbook of leadership: Theory, research, and managerial applications, 3rd ed. , 1990 .

[27]  Magdalene Marinaki,et al.  Honey Bees Mating Optimization algorithm for financial classification problems , 2010, Appl. Soft Comput..

[28]  Kay Chen Tan,et al.  On solving multiobjective bin packing problems using evolutionary particle swarm optimization , 2008, Eur. J. Oper. Res..

[29]  Daniel R. Ilgen,et al.  Multilevel theory of team decision making: Decision performance in teams incorporating distributed expertise. , 1995 .

[30]  Kwang Ryel Ryu,et al.  A Dual-Population Genetic Algorithm for Adaptive Diversity Control , 2010, IEEE Transactions on Evolutionary Computation.

[31]  Huifu Xu,et al.  A Stochastic Multiple-Leader Stackelberg Model: Analysis, Computation, and Application , 2009, Oper. Res..

[32]  S. Y. Yuen,et al.  A Genetic Algorithm That Adaptively Mutates and Never Revisits , 2009, IEEE Transactions on Evolutionary Computation.

[33]  Saman K. Halgamuge,et al.  Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients , 2004, IEEE Transactions on Evolutionary Computation.

[34]  Paul M. Weaver,et al.  Analysis and benchmarking of meta-heuristic techniques for lay-up optimization , 2010 .