A genetic algorithm-based grouping method for a cell formation problem with the efficacy measure Online publication date: Wed, 01-Sep-2010
by Mojtaba Salehi, Reza Tavakkoli-Moghaddam
International Journal of Industrial and Systems Engineering (IJISE), Vol. 6, No. 3, 2010
Abstract: Over the past 25 years, the machine–part cell formation problem (CFP) has been the subject of numerous studies. The CFP consists of constructing a set of machine cells and their corresponding product families with the objective of minimising the inter-cell movement of parts while maximising the machine utilisation. This article presents a grouping genetic algorithm for the CFP that uses the grouping efficacy measure. We solve the CFP without pre-determining the number of cells. We also make some effort to improve the efficiency of our algorithm with respect to initialisation of the population, keeping a crossover operator from cloning. The computational results using the grouping efficacy measure for a set of CFPs from the literature are presented. The proposed algorithm performs well on all the test problems, exceeding or matching the solution quality of the results presented in the previous literature for most problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook