Cart (Loading....) | Create Account
Close category search window

A new method for solving 0/1 knapsack problem based on evolutionary algorithm with schema replaced

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

4 Author(s)
Kangshun Li ; Sch. of Inf. Eng., Jiangxi Univ. of Sci. & Technol., Ganzhou ; Yuzhen Jia ; Wensheng Zhang ; Yang Xie

Knapsack problem is a typical NP complete problem. Knapsack problem correspondent mathematical model is proposed in this paper, and the evolutionary algorithm with schema replaced is raised. In this algorithm, it leads the search direction of the population by collecting the best several individuals to a schema. Because of that, the searching efficiency is improved. At last, the simulation experiment is given and the answer of the knapsack problem which is solved by simple evolutionary algorithm and the evolutionary algorithm with schema replaced two is compared. By this comparison, the advantage which use schema replaced to solve knapsack problem is proved.

Published in:

Automation and Logistics, 2008. ICAL 2008. IEEE International Conference on

Date of Conference:

1-3 Sept. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.