Abstract

A widespread survey of numerous traditional meta-heuristic algorithms has been investigated category wise in this paper. Where, particle swarm optimization (PSO) and differential evolution (DE) is found to be an efficient and powerful optimization algorithm. Therefore, an extensive survey of recent-past PSO and DE variants with their hybrids has been inspected again. After this a novel PSO (called, nPSO) and DE (namely, nDE) with their innovative hybrid (termed as, ihPSODE) is proposed in this paper for unconstrained optimization problems. In nPSO introducing a new linearly decreased inertia weight and gradually decreased and/or increased acceleration coefficient as well a different position update equation (by introducing a non-linear decreasing factor. And in nDE a new mutation strategy and crossover rate are introduced. In view of that, convergence characteristic of nPSO and nDE provides different approximation to the solution space. Further, instead of naive way proposed hybrid ihPSODE integrating merits of nPSO and nDE. In ihPSODE after initialization and calculation identify best half member and discard rest of members from the population. In current population apply nPSO to maintain exploration and exploitation. Then to enhance local search ability and improve convergence accuracy applies nDE. Hence, proposed ihPSODE has higher probability of avoiding local optima and it is likely to find global optima more quickly due to relating superior capability of the anticipated nPSO and nDE. Performance of the proposed hybrid ihPSODE as well as its anticipated integrating component nPSO and nDE are verified on 23 basic, 30 CEC 2014 and 30 CEC 2017 unconstrained benchmark functions plus 3 real world problems. The several numerical, statistical and graphical as well as comparative analyses over many state-of-the-art algorithms confirm superiority of the proposed algorithms. Finally, based on overall performance ihPSODE is recommended for unconstrained optimization problems in this present study.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call