Gompertz PSO variants for Knapsack and Multi-Knapsack Problems

作     者：Pinkey Chauhan Millie Pant Kusum Deep Pinkey Chauhan;Millie Pant;Kusum Deep

作者机构：Department of MathematicsJaypee Institute of Information TechnologyNoida 201304India 

出 版 物：《Applied Mathematics(A Journal of Chinese Universities)》 (高校应用数学学报（英文版）（B辑）)

年 卷 期：2021年第36卷第4期

页      面：611-630页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Binary PSO Knapsack Problems Multi Knapsack Problems Gompertz function chaos 

摘      要：Particle Swarm Optimization,a potential swarm intelligence heuristic,has been recognized as a global optimizer for solving various continuous as well as discrete optimization *** by the performance of Gompertz PSO on a set of continuous problems,this works extends the application of Gompertz PSO for solving binary optimization ***,a new chaotic variant of Gompertz PSO namely Chaotic Gompertz Binary Particle Swarm Optimization(CGBPSO)has also been *** new variant is further analysed for solving binary optimization *** new chaotic variant embeds the notion of chaos into GBPSO in later stages of searching process to avoid stagnation *** 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.