Metaheuristic algorithms for the generalised cell formation problem considering machine reliability Online publication date: Wed, 06-Nov-2019
by Mohammad Mahdi Nasiri; Foruzan Naseri
International Journal of Process Management and Benchmarking (IJPMB), Vol. 9, No. 4, 2019
Abstract: In this paper, we use two metaheuristic algorithms, i.e., artificial bee colony (ABC) and covariance matrix adaptation revolution strategies (CMA-ES), for solving the generalised cell formation problem considering machine reliability. The purpose is to choose the best process routing for each part and to allocate the machines to the manufacturing cells in order to minimise the total cost, which is composed of intracellular movement cost, intercellular movement cost and machines breakdown cost. To evaluate the metaheuristic algorithms, eight numerical examples in three different sizes are solved. The results of the two algorithms are compared with each other and with the results of solving the MIP model. Both the MIP solver and metaheuristics find the optimal solutions for the small size problem instances while by increasing the problem size, metaheuristics show higher performance. The results illustrate that the CMA-ES algorithm outperforms the ABC algorithm in both solution quality and CPU time.
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 Process Management and Benchmarking (IJPMB):
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