TY - JOUR
T1 - Hybridization Approach Towards Improving the Performance of Evolutionary Algorithm
AU - Al Ani, Zainab
AU - Gujarathi, Ashish M.
AU - Vakili-Nezhaad, G. Reza
AU - Al-Muhtaseb, Ala’a H.
N1 - Funding Information:
This work was partially supported by Sultan Qaboos University, Sultanate of Oman under Grant IG/ENG/PCED/19/01.
Publisher Copyright:
© 2020, King Fahd University of Petroleum & Minerals.
PY - 2020/12
Y1 - 2020/12
N2 - Multi-objective differential evolution (MODE) algorithm has been widely used in solving multi-objective optimization problems. In this paper, a hybridization technique is proposed to improve the performance of MODE algorithm in terms of speed and convergence. The proposed hybrid MODE-dynamic-random local search (HMODE-DLS) algorithm combines MODE and dynamic-random local search (DLS) algorithm. To evaluate the proposed algorithm and validate its performance, benchmark test problems (both constrained and non-constrained) are considered to be solved using MODE and the proposed HMODE-DLS algorithms. To compare between the two algorithms, five performance metrices are calculated, which are convergence, spread, generational distance, spacing and hypervolume ratio. Mean and standard deviation values for the performance metrics are reported, and the best in each category is highlighted. The Conv metric results of the new hybrid MODE are compared with other reported ones. Additionally, the effect of local search probability is studied for selected problems. In general, HMODE-DLS performance outshines, in terms of convergence and robustness, compared with other tested algorithms. HMODE-DLS is, generally, faster, and its results are of improved quality compared to MODE algorithm.
AB - Multi-objective differential evolution (MODE) algorithm has been widely used in solving multi-objective optimization problems. In this paper, a hybridization technique is proposed to improve the performance of MODE algorithm in terms of speed and convergence. The proposed hybrid MODE-dynamic-random local search (HMODE-DLS) algorithm combines MODE and dynamic-random local search (DLS) algorithm. To evaluate the proposed algorithm and validate its performance, benchmark test problems (both constrained and non-constrained) are considered to be solved using MODE and the proposed HMODE-DLS algorithms. To compare between the two algorithms, five performance metrices are calculated, which are convergence, spread, generational distance, spacing and hypervolume ratio. Mean and standard deviation values for the performance metrics are reported, and the best in each category is highlighted. The Conv metric results of the new hybrid MODE are compared with other reported ones. Additionally, the effect of local search probability is studied for selected problems. In general, HMODE-DLS performance outshines, in terms of convergence and robustness, compared with other tested algorithms. HMODE-DLS is, generally, faster, and its results are of improved quality compared to MODE algorithm.
KW - Differential evolution
KW - Evolutionary algorithms
KW - Hybrid algorithms
KW - Multi-objective optimization
UR - http://www.scopus.com/inward/record.url?scp=85092222386&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85092222386&partnerID=8YFLogxK
U2 - 10.1007/s13369-020-04964-y
DO - 10.1007/s13369-020-04964-y
M3 - Article
AN - SCOPUS:85092222386
SN - 2193-567X
VL - 45
SP - 11065
EP - 11086
JO - Arabian Journal for Science and Engineering
JF - Arabian Journal for Science and Engineering
IS - 12
ER -