Exploring the reasons behind the good performance of opposition-based learning
In the face of these diverse forms of opposition existed widely in real-world contexts, as a novel concept in computational intelligence, opposition-based learning (OBL) was originally introduced to accelerate the population-based algorithm. In addition, its superiority has been proved mathematicall...
Saved in:
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/105993 http://hdl.handle.net/10220/48845 http://dx.doi.org/10.1109/ACCESS.2018.2890402 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| Summary: | In the face of these diverse forms of opposition existed widely in real-world contexts, as a novel concept in computational intelligence, opposition-based learning (OBL) was originally introduced to accelerate the population-based algorithm. In addition, its superiority has been proved mathematically and experimentally. Two key elements (function prototype and algorithm design) that influence the algorithm performance, however, has not yet fully discussed in the past decade. In this paper, two OBL strategies are reexamined in respect of function prototype and algorithm design. In the first part of this paper, considering the position relationship between the optimal solution and the center point, some well-known benchmark functions are divided into three categories. Then, quasi-opposition-based differential evolution (QODE) is investigated by two approaches: solving several benchmark functions of various function types and solving the same functions with a different optimal solution. The numerical experiments reveal that “smart” matching between the benchmark functions and the QOBL is an important factor to the good performance of QODE. In the second part of this paper, a novel individual-based embedding method is proposed to coincide with the classical definition of opposition-based optimization. Then, two opposition-based differential evolution algorithms are compared to discuss the differences between the two embedding methods. The experimental results confirm that the convergence differences stem from the embedding method chosen in the OBL scheme rather than the utilization rate of opposite points. Furthermore, the impacts caused by various function types and jumping rate are also discussed. |
|---|