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

A Parallel Genetic Algorithm Based on TBB for Resolving the Bin-Packing 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

4 Author(s)
Zhang Liyan ; Sch. of Transp. Eng., Tongji Univ., Shanghai, China ; Sun Yan ; Ma Jian ; Sun Jian

The paper presents a novel Three-tier Parallel Genetic Algorithm (TPGA) based on multi-core computer with Threading Building Blocks (TBB). The purpose of a new parallel function is to improve the running efficiency. TPGA is decomposed into three-tier: data coding parallelism, task processing parallelism and data decoding parallelism and it can improve the convergence rate. TBB offers a rich and complete approach to express parallelism in a C++ program. Sequential Genetic Algorithm (SGA) and TPGA are implemented based on TBB with C++ for bin-packing problem. Experiments show that the optimal solutions of TPGA and SGA are Consistent and the running efficiency of TPGA is also sooner than one of SGA.

Published in:

Management and Service Science (MASS), 2011 International Conference on

Date of Conference:

12-14 Aug. 2011

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.