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

An Improved Immune Genetic Algorithm for Solving the Packing Problem in the Hull Construction Automatic Packing System

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)
Mei Ying ; Coll. of Traffic & Commun., SCUT, Guangzhou, China ; Zhu Liangsheng ; Ye Jiawei

The paper discusses the irregular parts packing problem based on an improved immune genetic algorithm, and a NIGA based on crowing mechanism is proposed. GA, an improved immune genetic algorithm, and NIGA are applied to practical experiments respectively to solve and optimize the packing problem, and we compare the results. In solving the large-scale packing problem, the application of immunity operator and niche genetic algorithm based on crowing mechanism improves the global optimization performance and velocity of convergence. The improved algorithms are effective and feasibility for solving the hull construction automatic packing problem.

Published in:

Intelligent Information Technology Application Workshops, 2009. IITAW '09. Third International Symposium on

Date of Conference:

21-22 Nov. 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.