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

Modified Dynamic Differential Evolution for 0-1 Knapsack Problems

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)
Changshou Deng ; Sch. of Inf. Sci. & Technol., Jiujiang Univ., Jiujiang, China ; Bingyan Zhao ; Yanling Yang ; Anyuan Deng

A modified dynamic differential evolution was proposed for discrete optimization. Based on the new framework of dynamic differential evolution, two additional operators were used to extend the dynamic differential evolution to the field of discrete optimization. The first operator was the mapping operator, which could map the continuous value into zero or one. The other new operator was the boundary constraints handling operator, which ensured the results gotten by the mutation operation fall in some range. The results of the simulation on four different sizes of the knapsack problems show it is efficient and effective way for solving 0-1 knapsack problems.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009

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.