Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Dynamic Segregative Genetic Algorithm for Assembly Lines Balancing

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

2 Author(s)
Brudaru, O. ; Inst. of Comput. Sci., Gh. Asachi Tech. Univ. of Iasi, Iasi, Romania ; Rotaru, C.

This paper presents a segregative genetic algorithm for "I"/U"-shaped assembly line balancing problem. It uses a basic genetic algorithm and a feature function that associates a time profile of the workstations to each chromosome. The similarity based clustering in the feature space induces subpopulations of chromosomes. The segregative genetic algorithm acts both on representation and feature space. A similarity based communication preserves the clustering structure. Each subpopulation completely exploited sends its centroid to an associative tabu search mechanism. Some selected new individuals are used to create clusters that represent unexplored parts of search space. The exhausted subpopulations are replaced by new ones during the evolution. The resulted dynamic segregative genetic algorithm leads to a better trade-off between exploration, made by many clusters, and exploitation, done by the focusing on each subpopulation. Experimental investigations show that the segregative approach is more stable and systematically produces better results than the basic genetic algorithm. A distributed implementation of the segregative approach is presented and its performance is reported.

Published in:

Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), 2010 12th International Symposium on

Date of Conference:

23-26 Sept. 2010