Dynamically dimensioned search embedded with piecewise opposition-based learning for global optimization
MetadataShow full item record
Dynamically dimensioned search (DDS) is a well-known optimization algorithm in the field of single solution-based heuristic global search algorithms. Its successful application in the calibration of watershed environmental parameters has attracted researcher’s extensive attention. The dynamically dimensioned search algorithm is a kind of algorithm that converges to the global optimum under the best condition or the good local optimum in the worst case. In other words, the performance of DDS is easily affected by the optimization conditions. Therefore, this algorithm has also suffered from low robustness and limited scalability. In this work, an improved version of DDS called DDS-POBL is proposed. In the DDS-POBL, two effective methods are applied to improve the performance of the DDS algorithm. Piecewise opposition-based learning is introduced to guide DDS search in the right direction, and the golden section method is used to search for more promising areas. Numerical experiments are performed on a set of 23 classic test functions, and the results represent significant improvements in the optimization performance of DDS-POBL compared to DDS. Several experimental results using different parameter values demonstrate the high solution quality, strong robustness, and scalability of the proposed DDS-POBL algorithm. A comparative performance analysis between the DDS-POBL and other powerful algorithms has been carried out by statistical methods by using the significance of the results. The results show that DDS-POBL works better than PSO, CoDA, MHDA, NaFA, and CMA-ES and gives very competitive results when compared to INMDA and EEGWO. Moreover, the parameter calibration application of the Xinanjiang model shows the effectiveness of the DDS-POBL in the real optimization problem.