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

被引:52
|
作者
Bangyal, Waqas Haider [1 ]
Nisar, Kashif [2 ]
Ibrahim, Ag Asri Bin Ag [2 ]
Haque, Muhammad Reazul [3 ]
Rodrigues, Joel J. P. C. [4 ,5 ]
Rawat, Danda B. [6 ]
机构
[1] Univ Gujrat, Dept Comp Sci, Gujrat 50700, Pakistan
[2] Univ Malaysia Sabah, Fac Comp & Informat, Jalan UMS, Kota Kinabalu 88400, Sabah, Malaysia
[3] Multimedia Univ, Fac Comp & Informat, Cyberjaya 63100, Malaysia
[4] Fed Univ Piaui UFPI, Postgrad Program Elect Engn, BR-64049550 Teresina, PI, Brazil
[5] Inst Telecomunicacoes, P-6201001 Covilha, Portugal
[6] Howard Univ, Dept Elect Engn & Comp Sci, Washington, DC 20059 USA
来源
APPLIED SCIENCES-BASEL | 2021年 / 11卷 / 16期
关键词
premature convergence; quasirandom sequences; PSO; GOP; WELL sequence; Knuth sequence; ANN; PARTICLE SWARM OPTIMIZATION; DIFFERENTIAL EVOLUTION ALGORITHM; NEURAL-NETWORK;
D O I
10.3390/app11167591
中图分类号
O6 [化学];
学科分类号
0703 ;
摘要
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.
引用
收藏
页数:36
相关论文
共 50 条
  • [1] Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences
    Ashraf, Adnan
    Pervaiz, Sobia
    Bangyal, Waqas Haider
    Nisar, Kashif
    Ibrahim, Ag Asri Ag
    Rodrigues, Joel J. P. C.
    Rawat, Danda B.
    [J]. APPLIED SCIENCES-BASEL, 2021, 11 (17):
  • [2] Simple population-based algorithms for solving optimization problems
    Baskar, Amaladosan
    [J]. RAIRO-OPERATIONS RESEARCH, 2024, 58 (01) : 253 - 280
  • [3] Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms
    Mahamed G. H. Omran
    Salah al-Sharhan
    Ayed Salman
    Maurice Clerc
    [J]. Computational Optimization and Applications, 2013, 56 : 457 - 480
  • [4] Studying the effect of using low-discrepancy sequences to initialize population-based optimization algorithms
    Omran, Mahamed G. H.
    al-Sharhan, Salah
    Salman, Ayed
    Clerc, Maurice
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2013, 56 (02) : 457 - 480
  • [5] Efficient Initialization Methods for Population-Based Metaheuristic Algorithms: A Comparative Study
    Agushaka, Jeffrey O. O.
    Ezugwu, Absalom E. E.
    Abualigah, Laith
    Alharbi, Samaher Khalaf
    Khalifa, Hamiden Abd El-Wahed
    [J]. ARCHIVES OF COMPUTATIONAL METHODS IN ENGINEERING, 2023, 30 (03) : 1727 - 1787
  • [6] Efficient Initialization Methods for Population-Based Metaheuristic Algorithms: A Comparative Study
    Jeffrey O. Agushaka
    Absalom E. Ezugwu
    Laith Abualigah
    Samaher Khalaf Alharbi
    Hamiden Abd El-Wahed Khalifa
    [J]. Archives of Computational Methods in Engineering, 2023, 30 : 1727 - 1787
  • [7] Dissimilarity measures for population-based global optimization algorithms
    Cassioli, Andrea
    Locatelli, Marco
    Schoen, Fabio
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2010, 45 (02) : 257 - 281
  • [8] Dissimilarity measures for population-based global optimization algorithms
    Andrea Cassioli
    Marco Locatelli
    Fabio Schoen
    [J]. Computational Optimization and Applications, 2010, 45 : 257 - 281
  • [9] COMPUTATIONAL ALGORITHMS BASED ON RANDOM SEARCH FOR SOLVING GLOBAL OPTIMIZATION PROBLEMS
    MOHAN, C
    SHANKER, K
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1990, 33 (1-2) : 115 - 126
  • [10] Unconstrained Global Optimization: A Benchmark Comparison of Population-based Algorithms
    Sidorov, Maxim
    Semenkin, Eugene
    Minker, Wolfgang
    [J]. ICIMCO 2015 PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON INFORMATICS IN CONTROL, AUTOMATION AND ROBOTICS, VOL. 1, 2015, : 230 - 237