By Topic

The Modified Hybrid Adaptive genetic algorithm for 0–1 knapsack problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yanqin Ma ; Sch. of Inf. & Eng., Huanghe Sci. Technol. Coll., Zhengzhou, China

The paper solves the 0-1 knapsack problem with the modified adaptive genetic transform algorithm which combined with greedy transform algorithm. By means of mixing adaptive crossover and mutation with diversity-guided mutation and modifying adaptive crossover strategies, an adaptive genetic algorithm with diversity-guided mutation was developed and repaired the infeasible solution with greedy transform algorithm. New algorithm will converge to the global optimum and do not lead to premature convergence. Experimental results show that the new algorithm has faster convergent speed, higher robustness and more reliable stability, and it is very effective for 0-1 knapsack problem.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012