Cell formation using a simulated annealing algorithm with variable neighbourhood
by Kuo-Ching Ying, Shih-Wei Lin, Chung-Cheng Lu
European J. of Industrial Engineering (EJIE), Vol. 5, No. 1, 2011

Abstract: The broad applications of cellular manufacturing make the cell formation problem (CFP) a core subject in the field of manufacturing. Due to the combinatorial nature of the CFP, a simulated annealing-based meta-heuristic with variable neighbourhood was developed to form part-machine cells. To validate and verify the proposed approach, computational experiments were conducted on a set of CFPs from the literature. Using the grouping efficacy as a performance criterion, the proposed approach is shown to outperform existing state-of-the-art algorithms by exceeding or matching the best known solutions in the majority of the test problems. The evaluation results clearly show that this study successfully develops an effective approach for CFPs. [Submitted 25 July 2009; Revised 22 October 2009, 11 November 2009; Accepted 12 November 2009]

Online publication date: Wed, 22-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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