 Metaheuristic algorithms for the generalised cell formation problem considering machine reliabilityMohammad Mahdi Nasiri and Foruzan Naseri International Journal of Process Management and Benchmarking, 2019, vol. 9, issue 4, 469-484 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. Keywords: group technology; generalised cell formation problem; reliability; artificial bee colony; ABC; covariance matrix adaptation revolution strategies; CMA-ES. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijpmbe:v:9:y:2019:i:4:p:469-484 Access Statistics for this article More articles in International Journal of Process Management and Benchmarking from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.