Hybrid Particle Swarm Optimization for High-Dimensional Latin Hypercube Design Problem

Abstract

Latin Hypercube Design (LHD) is widely used in computer simulation to solve large-scale, complex, nonlinear problems. The high-dimensional LHD (HLHD) problem is one of the crucial issues and has been a large concern in the long run. This paper proposes an improved Hybrid Particle Swarm Optimization (IHPSO) algorithm to find the near-optimal HLHD by increasing the particle evolution speed and strengthening the local search. In the proposed algorithm, firstly, the diversity of the population is ensured through comprehensive learning. Secondly, the Minimum Point Distance (MPD) method is adopted to solve the oscillation problem of the PSO algorithm. Thirdly, the Ranked Ordered Value (ROV) rule is used to realize the discretization of the PSO algorithm. Finally, local and global searches are executed to find the near-optimal HLHD. The comparisons show the superiority of the proposed method compared with the existing algorithms in obtaining the near-optimal HLHD.

Keywords

• adaptive particle swarm optimization
• high-dimensional Latin hypercube design
• space-filling quality
• design points