A Novel U-Shaped Transfer Function for Binary Particle Swarm Optimisation

Particle swarm optimisation (PSO), one of the most elegant algorithms in the field of nature-inspired optimisation, has many variants for solving different types of problems. One of these variants is binary particle swarm optimisation (BPSO), which is suitable for solving combinatorial optimisation problems. A main component of BPSO is the transfer function that maps continuous velocity values to probability values which in turn are used to update particle positions. Transfer function has a significant impact on the performance of BPSO algorithm. This paper proposes a novel transfer function with tunable parameters that allows different U-shaped transfer functions. For evaluating the proposed transfer functions, a set of benchmark functions and 0/1 knapsack problems are employed. The results show that the U-shaped transfer functions can significantly improve the performance of BPSO. It is also shown that the BPSO algorithms equipped with U-shaped transfer functions provide superior results compared to the existing transfer functions in the literature.

[1]  David Corne,et al.  The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[2]  Dervis Karaboga,et al.  A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..

[3]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[4]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[5]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[6]  Dan Simon,et al.  Biogeography-Based Optimization , 2022 .

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

[8]  Kusum Deep,et al.  A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..

[9]  Kenneth V. Price,et al.  An introduction to differential evolution , 1999 .

[10]  Andrew Lewis,et al.  How important is a transfer function in discrete heuristic algorithms , 2015, Neural Computing and Applications.

[11]  Peter L. Bartlett,et al.  Boosting Algorithms as Gradient Descent , 1999, NIPS.

[12]  M. A. Khanesar,et al.  A novel binary particle swarm optimization , 2007, 2007 Mediterranean Conference on Control & Automation.

[13]  Thomas Stützle,et al.  Ant colony optimization: artificial ants as a computational intelligence technique , 2006 .

[14]  Andrew Lewis,et al.  S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization , 2013, Swarm Evol. Comput..

[15]  Dervis Karaboga,et al.  A comprehensive survey: artificial bee colony (ABC) algorithm and applications , 2012, Artificial Intelligence Review.

[16]  Hossein Nezamabadi-pour,et al.  BGSA: binary gravitational search algorithm , 2010, Natural Computing.

[17]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[18]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[19]  Patrick Siarry,et al.  A survey on optimization metaheuristics , 2013, Inf. Sci..

[20]  S. Salcedo-Sanz.  Modern meta-heuristics based on nonlinear physics processes: A review of models and design procedures , 2016 .

[21]  Xin-She Yang,et al.  A literature survey of benchmark functions for global optimisation problems , 2013, Int. J. Math. Model. Numer. Optimisation.

[22]  Chao Wang,et al.  A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows , 2015, Comput. Ind. Eng..

[23]  Rainer Storn,et al.  Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..