An Improved GAPSO Hybrid Programming Algorithm
Xiao‐Jun Wu, Ying Wang, Tiantian Zhang · 2009
GAPSO hybrid programming algorithm, which is a concise, effective and stable algorithm to solve the hierarchical problem based on GP algorithm. In terms of the specific characteristics of discrete magnitude and continuous magnitude, as well as the superiority of PSO in continuous quantity optimization, in this paper we propose an improved algorithm, which optimizes continuous magnitude by PSO while using GP for discrete magnitude optimization. Then through mass contrast experiments with GAPSO hybrid programming algorithm, we could see that Improved GAPSO hybrid programming algorithm is more stable and effective in function modeling.