摘要
In this paper, we present a parallel chaotic local search enhanced harmony search algorithm (MHS–PCLS) for solving engineering design optimization problems. The concept of chaos has been previously successfully applied in metaheuristics. However, chaos sequences are sensitive to their initial conditions and cause unstable performance in algorithms. The proposed parallel chaotic local search method searches from several different initial points and diminishes the sensitivity of the initial condition, thereby increasing the robustness of the harmony search method. Numerical benchmark problems are tested to validate the effectiveness of MHS–PCLS. The simulation results confirm that MHS–PCLS obtains superior results for mathematical examples compared to other harmony search variants. Several well-known constrained engineering design problems are also tested using the new approach. The computational results demonstrate that the proposed MHS–PCLS algorithm requires a smaller number of function evaluations and in the majority of cases delivers improved and more robust results compare to other algorithms.