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

Improved particle swarm optimization algorithm for Rectangular Cutting-Stock 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

3 Author(s)
Qi Ji ; Coll. of Comput. Sci. & Technol., Jilin Univ., Changchun, China ; Huang Lan ; Tan Ying

For the combination optimization problem, it is difficult to describe the updating of the particles by using standard particle swarm optimization algorithm. On account of this problem, an improved particle swarm optimization algorithm is proposed in this paper which combined with genetic algorithm and adopts information-sharing strategy, in addition to this, the lowest horizontal search algorithm is also be utilized for Rectangular Cutting-Stock Problem. Through comparison of experimental results with the reference [7], the proposed algorithm is effective and robust.

Published in:

Digital Content, Multimedia Technology and its Applications (IDC), 2010 6th International Conference on

Date of Conference:

16-18 Aug. 2010

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.