Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. For an optimization problem, population initialization plays a significant role in metaheuristic algorithms. These algorithms can influence the convergence to find an efficient optimal solution. Mainly, for recognizing the importance of diversity, several researchers have worked on the performance for the improvement of metaheuristic algorithms. Population initialization is a vital factor in metaheuristic algorithms such as PSO and DE. Instead of applying the random distribution for the initialization of the population, quasirandom sequences are more useful for the improvement the diversity and convergence factors. This study presents three new low-discrepancy sequences named WELL sequence, Knuth sequence, and Torus sequence to initialize the population in the search space. This paper also gives a comprehensive survey of the various PSO and DE initialization approaches based on the family of quasirandom sequences such as Sobol sequence, Halton sequence, and uniform random distribution. The proposed methods for PSO (TO-PSO, KN-PSO, and WE-PSO) and DE (DE-TO, DE-WE, and DE-KN) have been examined for well-known benchmark test problems and training of the artificial neural network. The finding of our techniques shows promising performance using the family of low-discrepancy sequences over uniform random numbers. For a fair comparison, the approaches using low-discrepancy sequences for PSO and DE are compared with the other family of low-discrepancy sequences and uniform random number and depict the superior results. The experimental results show that the low-discrepancy sequences-based initialization performed exceptionally better than a uniform random number. Moreover, the outcome of our work presents a foresight on how the proposed technique profoundly impacts convergence and diversity. It is anticipated that this low-discrepancy sequence comparative simulation survey would be helpful for studying the metaheuristic algorithm in detail for the researcher.

[1]  I. Sobol.  On the distribution of points in a cube and the approximate evaluation of integrals , 1967 .

[2]  Pierre L'Ecuyer,et al.  Improved long-period generators based on linear recurrences modulo 2 , 2004, TOMS.

[3]  Mark Richards,et al.  Choosing a starting configuration for particle swarm optimization , 2004, 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541).

[4]  Lixin Tang,et al.  An Improved Differential Evolution Algorithm for Practical Dynamic Scheduling in Steelmaking-Continuous Casting Production , 2014, IEEE Transactions on Evolutionary Computation.

[5]  Xiong Xiong,et al.  An Improved Self-Adaptive PSO Algorithm with Detection Function for Multimodal Function Optimization Problems , 2013 .

[6]  Konstantinos E. Parsopoulos,et al.  Initializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method , 2002 .

[7]  Kusum Deep,et al.  Initializing PSO with probability distributions and low-discrepancy sequences: The comparative results , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[8]  Michael R. Lyu,et al.  A hybrid particle swarm optimization-back-propagation algorithm for feedforward neural network training , 2007, Appl. Math. Comput..

[9]  Yanbin Liu,et al.  A hybrid quantum-based PIO algorithm for global numerical optimization , 2018, Science China Information Sciences.

[10]  Mahamad Nabab Alam,et al.  A comparative study of metaheuristic optimization approaches for directional overcurrent relays coordination , 2015 .

[11]  Takuji Nishimura,et al.  Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator , 1998, TOMC.

[12]  Heinrich W. Guggenheimer,et al.  Geometries and Groups , 1989 .

[13]  A. Abraham,et al.  Simplex Differential Evolution , 2009 .

[14]  Hsueh-Wei Chang,et al.  Conserved PCR Primer Set Designing for Closely-Related Species to Complete Mitochondrial Genome Sequencing Using a Sliding Window-Based PSO Algorithm , 2011, PloS one.

[15]  V. Chandra Prakash,et al.  Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems , 2017, Algorithms.

[16]  P. Murugan,et al.  Modified particle swarm optimisation with a novel initialisation for finding optimal solution to the transmission expansion planning problem , 2012 .

[17]  Sibarama Panigrahi,et al.  A Modified Differential Evolution Algorithm trained Pi-Sigma Neural Network for Pattern Classification , 2013 .

[18]  Á. Nemcsics,et al.  Investigation of electrochemically etched GaAs (001) surface with the help of image processing , 2009 .

[19]  Huaiwei Lu,et al.  Fuzzy neural network optimization and network traffic forecasting based on improved differential evolution , 2018, Future Gener. Comput. Syst..

[20]  Shahnorbanun Sahran,et al.  A new initialization technique in polar coordinates for Particle Swarm Optimization and Polar PSO , 2017 .

[21]  Naz E. Islam,et al.  Hybrid Algorithm for the Optimization of Training Convolutional Neural Network , 2015 .

[22]  Mohamed E. El-Hawary,et al.  A Survey of Particle Swarm Optimization Applications in Electric Power Systems , 2009, IEEE Transactions on Evolutionary Computation.

[23]  Islamic Azad,et al.  Comparison of Particle Swarm Optimization and Backpropagation Algorithms for Training Feedforward Neural Network , 2014 .

[24]  Xin-She Yang,et al.  A New Metaheuristic Bat-Inspired Algorithm , 2010, NICSO.

[25]  D. Pham,et al.  THE BEES ALGORITHM, A NOVEL TOOL FOR COMPLEX OPTIMISATION PROBLEMS , 2006 .

[26]  Tao Chen,et al.  Back propagation neural network with adaptive differential evolution algorithm for time series forecasting , 2015, Expert Syst. Appl..

[27]  Halife Kodaz,et al.  A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem , 2015, Appl. Soft Comput..

[28]  N. Bouhmala,et al.  A Novel Tangent based Framework for Optimizing Continuous Functions , 2013 .

[29]  Qinghai Bai,et al.  Analysis of Particle Swarm Optimization Algorithm , 2010, Comput. Inf. Sci..

[30]  Wu Yong-ping,et al.  A PSO algorithm with high speed convergence , 2010 .

[31]  U. Ulusoy,et al.  Application of ANOVA to image analysis results of talc particles produced by different milling , 2008 .