Gompertz PSO variants for Knapsack and Multi-Knapsack Problems

Particle Swarm Optimization, a potential swarm intelligence heuristic, has been recognized as a global optimizer for solving various continuous as well as discrete optimization problems. Encourged by the performance of Gompertz PSO on a set of continuous problems, this works extends the application of Gompertz PSO for solving binary optimization problems. Moreover, a new chaotic variant of Gompertz PSO namely Chaotic Gompertz Binary Particle Swarm Optimization (CGBPSO) has also been proposed. The new variant is further analysed for solving binary optimization problems. The new chaotic variant embeds the notion of chaos into GBPSO in later stages of searching process to avoid stagnation phenomena. The efficiency of both the Binary PSO variants has been tested on different sets of Knapsack Problems (KPs): 0–1 Knapsack Problem (0-1 KP) and Multidimensional Knapsack Problems (MKP). The concluding remarks have made on the basis of detailed analysis of results, which comprises the comparison of results for Knapsack and Multidimensional Knapsack problems obtained using BPSO, GBPSO and CGBPSO.