By Topic

A novel method for solving knapsack problem base on Hybrid Genetic Algorithm

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

3 Author(s)
Wng Jianliang ; Dept. of Manage. & Inf., Shandong Jiaotong Vocational Coll., Weifang, China ; Sun Qiuyun ; Jia Haipeng

Knapsack problem is a typical computer algorithm of NP complete (Nondeterministic Polynomial Completeness) problem. The research of solving this problem has great significance not only in theory, but also in application, for example, resource management, investment decisions and so on. For solving this problem, scholars have developed a number of algorithms, however, they are all have some drawbacks. This paper represents a greedy Genetic Algorithm based on Hybrid Algorithm through the study of Genetic Algorithm and Hybrid Algorithm to solve the knapsack problem, and also demonstrate its feasibility and effectiveness throng an example.

Published in:

Industrial and Information Systems (IIS), 2010 2nd International Conference on  (Volume:1 )

Date of Conference:

10-11 July 2010