Solving the 0/1 knapsack problem with improved pseudo-parallel genetic algorithm

摘要：

An improved pseudo-parallel genetic algorithm which comprehensively adopts three different greedy algorithms is proposed to solve the 0/1 Knapsack problem.The initial population is divided into three subgroups,which is respectively pretreated by three greedy algorithms.Information exchange between subgroups adopts the island model to maintain the diversity of population.Simulation study demonstrates that the improved pseudo-parallel genetic algorithm has stronger global search capability and higher immunity against premature convergence than the traditional hybrid genetic algorithm.

关键词： Pseudo-parallel Genetic Algorithm Greedy Algorithm Knapsack Problem

作者: Yiming CHEN Guangjun LI Xiaoqing ZENG

作者单位: College of Economics and Management,Changsha University of Science and Technology,Changsha,Hunan,China,410076

会议类型: 国际会议

会议名称: The 2008 International Conference on Business Intelligence and Financial Engineering(BIFE 2008)(商业智能和金融工程国际会议)

会议地点: 长沙

会议语种:英文

页码: 329-333

在线出版日期: 2008-10-28（万方平台首次上网日期，不代表论文的发表时间）