New deterministic initialization method for soft computing global optimization algorithms

The initialization stage of a Soft Computing (SC) algorithm is vital as it affects the success rate of algorithms in solving multi-peak global optimization problems. The individuals in an initial population, which are known as search agents, are often generated randomly using pseudo-random number ge...

Full description

Bibliographic Details
Published in:Indonesian Journal of Electrical Engineering and Computer Science
Main Author: Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
Format: Article
Language:English
Published: Institute of Advanced Engineering and Science 2020
Online Access:https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079131267&doi=10.11591%2fijeecs.v18.i3.pp1607-1615&partnerID=40&md5=71f13bceea3760e077815842fb860470
id 2-s2.0-85079131267
spelling 2-s2.0-85079131267
Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
New deterministic initialization method for soft computing global optimization algorithms
2020
Indonesian Journal of Electrical Engineering and Computer Science
18
3
10.11591/ijeecs.v18.i3.pp1607-1615
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079131267&doi=10.11591%2fijeecs.v18.i3.pp1607-1615&partnerID=40&md5=71f13bceea3760e077815842fb860470
The initialization stage of a Soft Computing (SC) algorithm is vital as it affects the success rate of algorithms in solving multi-peak global optimization problems. The individuals in an initial population, which are known as search agents, are often generated randomly using pseudo-random number generator (PRNG) due to unavailability of prior information on the location of global peak (GP). The random nature of the generated search agents causes uneven distribution of the initial population over the search space (SS), which may lead the search towards unpromising regions from the very beginning. This paper proposes a new deterministic initialization method (DIM) for SC algorithms where search agents are evenly fixed in the SS by using a simple deterministic formulation. The performance of the proposed DIM is then compared to the conventional PRNG and more recent quasi-random number generator (QRNG). An optimization case study is carried out using two popular SC algorithms which are the Particle Swarm Algorithm (PSO) and the Evolutionary Programming (EP), and three relatively new SC algorithms which are the Whale Optimization Algorithm (WOA), the Elephant Herding Optimization (EHO), and the Butterfly Optimization Algorithm (BOA). The optimization is done on various one-dimensional (1D) benchmark functions, as well as practical problems such as partial shading condition (PSC). Simulation results show that the proposed DIM successfully improved the performance of each SC algorithm under study in solving almost all tested functions with 99% success rate compared to 88.7% and 80.2% for the QRNG and PRNG approaches respectively. Furthermore, the WOA is the most reliable and robust among the five SC techniques under study with a success rate of 93.8% when all initialization methods are employed. Copyright © 2020 Institute of Advanced Engineering and Science. All rights reserved.
Institute of Advanced Engineering and Science
25024752
English
Article
All Open Access; Gold Open Access
author Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
spellingShingle Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
New deterministic initialization method for soft computing global optimization algorithms
author_facet Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
author_sort Hashim N.; Salam Z.; Ismail N.F.N.; Johari D.
title New deterministic initialization method for soft computing global optimization algorithms
title_short New deterministic initialization method for soft computing global optimization algorithms
title_full New deterministic initialization method for soft computing global optimization algorithms
title_fullStr New deterministic initialization method for soft computing global optimization algorithms
title_full_unstemmed New deterministic initialization method for soft computing global optimization algorithms
title_sort New deterministic initialization method for soft computing global optimization algorithms
publishDate 2020
container_title Indonesian Journal of Electrical Engineering and Computer Science
container_volume 18
container_issue 3
doi_str_mv 10.11591/ijeecs.v18.i3.pp1607-1615
url https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079131267&doi=10.11591%2fijeecs.v18.i3.pp1607-1615&partnerID=40&md5=71f13bceea3760e077815842fb860470
description The initialization stage of a Soft Computing (SC) algorithm is vital as it affects the success rate of algorithms in solving multi-peak global optimization problems. The individuals in an initial population, which are known as search agents, are often generated randomly using pseudo-random number generator (PRNG) due to unavailability of prior information on the location of global peak (GP). The random nature of the generated search agents causes uneven distribution of the initial population over the search space (SS), which may lead the search towards unpromising regions from the very beginning. This paper proposes a new deterministic initialization method (DIM) for SC algorithms where search agents are evenly fixed in the SS by using a simple deterministic formulation. The performance of the proposed DIM is then compared to the conventional PRNG and more recent quasi-random number generator (QRNG). An optimization case study is carried out using two popular SC algorithms which are the Particle Swarm Algorithm (PSO) and the Evolutionary Programming (EP), and three relatively new SC algorithms which are the Whale Optimization Algorithm (WOA), the Elephant Herding Optimization (EHO), and the Butterfly Optimization Algorithm (BOA). The optimization is done on various one-dimensional (1D) benchmark functions, as well as practical problems such as partial shading condition (PSC). Simulation results show that the proposed DIM successfully improved the performance of each SC algorithm under study in solving almost all tested functions with 99% success rate compared to 88.7% and 80.2% for the QRNG and PRNG approaches respectively. Furthermore, the WOA is the most reliable and robust among the five SC techniques under study with a success rate of 93.8% when all initialization methods are employed. Copyright © 2020 Institute of Advanced Engineering and Science. All rights reserved.
publisher Institute of Advanced Engineering and Science
issn 25024752
language English
format Article
accesstype All Open Access; Gold Open Access
record_format scopus
collection Scopus
_version_ 1809677783934173184