A Binary Black Widow Optimization Algorithm for Addressing the Cell Formation Problem Involving Alternative Routes and Machine Reliability

Abstract

The Cell Formation Problem (CFP) involves the clustering of machines to enhance productivity and capitalize on various benefits. This study addresses a variant of the problem where alternative routes and machine reliability are included, which we call a Generalized Cell Formation Problem with Machine Reliability (GCFP-MR). This problem is known to be NP-Hard, and finding efficient solutions is of utmost importance. Metaheuristics have been recognized as effective optimization techniques due to their adaptability and ability to generate high-quality solutions in a short time. Since BWO was originally designed for continuous optimization problems, its adaptation involves binarization. Accordingly, our proposal focuses on adapting the Black Widow Optimization (BWO) metaheuristic to tackle GCFP-MR, leading to a new approach named Binary Black Widow Optimization (B-BWO). We compare our proposal in two ways. Firstly, it is benchmarked against a previous Clonal Selection Algorithm approach. Secondly, we evaluate B-BWO with various parameter configurations. The experimental results indicate that the best configuration of parameters includes a population size (Pop) set to 100, and the number of iterations (Maxiter) defined as 75. Procreating Rate (PR) is set at 0.8, Cannibalism Rate (CR) is set at 0.4, and the Mutation Rate (PM) is also set at 0.4. Significantly, the proposed B-BWO outperforms the state-of-the-art literature’s best result, achieving a noteworthy improvement of 1.40%. This finding reveals the efficacy of B-BWO in solving GCFP-MR and its potential to produce superior solutions compared to alternative methods.