Solving Knapsack Problem with Improved Pseudo-parallel Genetic Algorithm
Guangjun Li · Huadong jingji guanli · 2009
An improved pseudo-parallel genetic algorithm which comprehensively adopts different greedy algorithms is proposed to solve the 0/1 knapsack problem.The initial population is divided into three subgroups,which respectively pretreated by three greedy algorithms.Information exchange between subgroups adopts 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.