journal article·2026-06-01Open access

Hybrid Nature-Inspired Optimization for the Cell Formation Problem with Machine Reliability and Alternative Routings

Paulo Figueroa-Torrez, Broderick Crawford, Orlando Durán, Martín Jurado-Camacho, Dayana Roxana Andrade Roque, Adrian Vargas-Gutierrez, Felipe Cisternas-Caneo

Biomimetics· Volume 11· Issue 6

Abstract

The Cell Formation Problem plays a fundamental role in cellular manufacturing due to its impact on efficiency, flexibility, and reliability. Its complexity increases under real-world conditions involving alternative process routes and machine reliability constraints, leading to the Generalized Cell Formation Problem with machine reliability. Researchers have classified the Cell Formation Problem as an NP-Hard problem. To address this computational complexity, this study presents a comparative and hybrid evaluation of the Black Widow Optimizer and the Golden Eagle Optimizer for the Generalized Cell Formation Problem with machine reliability, examining whether mechanisms derived from the Black Widow Optimizer can enhance the search behavior of the Golden Eagle Optimizer. The Black Widow Optimizer provides strong intensification through procreation, cannibalism, and mutation mechanisms, whereas the Golden Eagle Optimizer provides a balanced search process through its cruise and attack strategies. Experimental results show that the Black Widow Optimizer achieved better individual performance than the Golden Eagle Optimizer, with average RPD values of 0.855% and 1.068%, respectively. However, the hybrid strategy based on incorporating the mutation mechanism into the Golden Eagle Optimizer produced the best result, reaching an RPD of 0.592%. The study also employed the Wilcoxon–Mann–Whitney statistical test to validate the performance differences among algorithms, and the respective Big-O computational complexity was calculated. These findings highlight the potential of hybrid metaheuristics for designing robust and efficient manufacturing systems.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Advanced Manufacturing and Logistics Optimization · Optimization and Packing Problems · Scheduling and Optimization Algorithms

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

Departamento de Ciencias Industriales, Medio Ambiente y Energía, Universidad Católica Boliviana “San Pablo”, Colón 734, Tarija, Bolivia

Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, Avenida Brasil 2241, Valparaíso 2362807, Chile

Escuela de Ingeniería Mecánica, Pontificia Universidad Católica de Valparaíso, Valparaíso 2340025, Chile

Funding

National Agency for Research and Development

References (61)

Show source-provided references
1. Renna, P., Materi, S., and Ambrico, M. (2023). Review of responsiveness and sustainable concepts in cellular manufacturing systems. Appl. Sci., 13.10.3390/app13021125 ↗
2. On calculation and assessment of machine reliability10.1088/1742-6596/1679/4/042029 ↗
3. Duer, S., Woźniak, M., Paś, J., Zajkowski, K., Bernatowicz, D., Ostrowski, A., and Budniak, Z. (2023). Reliability testing of wind farm devices based on the mean time between failures (MTBF). Energies, 16.10.3390/en16041659 ↗
4. Overview of metaheuristic algorithms10.58429/pgjsrt.v2n2a144 ↗
5. Solving various NP-hard problems using exponentially fewer qubits on a quantum computer10.1103/PhysRevA.109.052441 ↗
6. Black widow optimization algorithm: A novel meta-heuristic approach for solving engineering optimization problems10.1016/j.engappai.2019.103249 ↗
7. Golden eagle optimizer: A nature-inspired metaheuristic algorithm10.1016/j.cie.2020.107050 ↗
8. A memetic chaotic gravitational search algorithm for unconstrained global optimization problems10.1016/j.asoc.2019.03.011 ↗
9. Raidl, G.R., Puchinger, J., and Blum, C. (2010). Metaheuristic hybrids. Handbook of Metaheuristics, Springer.10.1007/978-1-4419-1665-5_16 ↗
10. A hybrid genetic-variable neighborhood search algorithm for the cell formation problem based on grouping efficacy10.1016/j.cor.2012.10.016 ↗
11. Solving a cubic cell formation problem with quality index using a hybrid meta-heuristic approach10.35378/gujs.1003331 ↗
12. Metaheuristics: A comprehensive overview and classification along with bibliometric analysis10.1007/s10462-020-09952-0 ↗
13. The first step in planning group technology10.1016/0925-5273(96)00027-8 ↗
14. Routes selection for the cell formation problem with alternative part process plans10.1016/0360-8352(96)00011-3 ↗
15. Manufacturing cells design with alternative process plans and/or replicate machines10.1080/002075499191742 ↗
16. An exact model for cell formation in group technology10.1007/s10287-012-0146-2 ↗
17. Machine grouping for efficient production10.1049/tpe.1972.0006 ↗
18. The generalized group technology concept10.1080/00207548708919861 ↗
19. A multi-objective imperialist competitive algorithm for integrating intra-cell layout and processing route reliability in a cellular manufacturing system10.1080/0951192X.2016.1224388 ↗
20. A within-cell utilization based heuristic for designing cellular manufacturing systems10.1080/00207548708919868 ↗
21. NP-completeness of cell formation problem with grouping efficacy objective10.1080/00207543.2019.1668072 ↗
22. Developing a cellular manufacturing model considering the alternative routes, tool assignment, and machine reliability10.1007/s40092-017-0239-1 ↗
23. Discrete cuckoo search algorithm for solving the cell formation problem10.1504/IJMR.2019.100991 ↗
24. Optimization of the material handling costs and the machine reliability in cellular manufacturing system using cuckoo search algorithm10.1007/s00521-017-3302-3 ↗
25. Figueroa-Torrez, P., Durán, O., Crawford, B., and Cisternas-Caneo, F. (2023). A binary black widow optimization algorithm for addressing the cell formation problem involving alternative routes and machine reliability. Mathematics, 11.10.3390/math11163475 ↗
26. Hybrid metaheuristics in combinatorial optimization: A survey10.1016/j.asoc.2011.02.032 ↗
27. An exhaustive review of the metaheuristic algorithms for search and optimization: Taxonomy, applications, and open challenges10.1007/s10462-023-10470-y ↗
28. Putting continuous metaheuristics to work in binary search spaces10.1155/2017/8404231 ↗
29. Genetic algorithms10.1145/234313.234350 ↗
30. Optimization by simulated annealing10.1126/science.220.4598.671 ↗
31. Principles of tabu search
32. Applying metaheuristics in the generalized cell formation problem considering machine reliability
33. Applying simulated annealing to a generalized cell formation problem considering alternative routings and machine reliability10.1142/S0217595914500213 ↗
34. A clonal selection algorithm for the generalized cell formation problem considering machine reliability and alternative routings10.1007/s11740-017-0751-6 ↗
35. Crawford, B., Paz, A., Soto, R., Pena Fritz, A., Astorga, G., Cisternas-Caneo, F., Toledo Mac-lean, C.P., Solis-Pinones, F., Arce, J.L., and Giachetti, G. (2025). Binary Pufferfish Optimization Algorithm for Combinatorial Problems. Biomimetics, 11.10.3390/biomimetics11010010 ↗
36. Intensification, learning and diversification in a hybrid metaheuristic: An efficient unification10.1007/s10732-018-9373-1 ↗
37. A literature review and critical analysis of metaheuristics recently developed10.1007/s11831-023-09975-0 ↗
38. A novel cell layout problem with reliability and stochastic failures
39. A new mathematical model for integration of cell formation with machine layout and cell layout by considering alternative process routing reliability; A novel hybrid metaheuristic
40. Manufacturing cells’ design in consideration of various production factors10.1080/00207540110101639 ↗
41. Cell formation with alternative process routings and machine reliability consideration10.1007/s00170-006-0753-6 ↗
42. Encoding trade-offs and design toolkits in quantum algorithms for discrete optimization: Coloring, routing, scheduling, and other problems10.22331/q-2023-09-14-1111 ↗
43. Performance comparison of typical binary-integer encodings in an Ising machine10.1109/ACCESS.2021.3081685 ↗
44. Harris-Birtill, D., and Harris-Birtill, R. (2021). Understanding computation time: A critical discussion of time as a computational performance metric. Time in Variance, Brill.10.1163/9789004470170_014 ↗
45. A destroy and repair algorithm for the bike sharing rebalancing problem10.1016/j.cor.2016.01.011 ↗
46. An optimization model for scheduling patients in destination medical centers10.1016/j.orhc.2017.09.004 ↗
47. Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization10.1016/j.eswa.2016.10.054 ↗
48. Cell formation using multiple process plans10.1007/s10845-005-4824-6 ↗
49. Cellular manufacturing system design considering machines reliability and parts alternative process routings10.1080/00207543.2015.1083626 ↗
50. Stochastic ranking for constrained evolutionary optimization10.1109/4235.873238 ↗
51. Self-adapting control parameters in differential evolution: A comparative study on numerical benchmark problems10.1109/TEVC.2006.872133 ↗
52. Improved multi-objective structural optimization with adaptive repair-based constraint handling10.1080/0305215X.2022.2147518 ↗
53. Jelovica, J., and Cai, Y. (2022). Adaptive Repair-Based Constraint Handling in Moea/D for Complex Structural Optimization. D Complex Struct. Optim.10.2139/ssrn.4040688 ↗
54. Crawford, B., Caballero, H., Astorga, G., Cisternas-Caneo, F., Becerra-Rozas, M., Baeza, A., Bernales, G., Puga, P., Giachetti, G., and Soto, R. (2026). A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. Biomimetics, 11.10.3390/biomimetics11030197 ↗
55. On a test of whether one of two random variables is stochastically larger than the other10.1214/aoms/1177730491 ↗
56. A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: A case study on the CEC’2005 special session on real parameter optimization10.1007/s10732-008-9080-4 ↗
57. Ye, X. (2024). Unveiling the intricacies of the normal distribution: From theory to applications. Proceedings of the 2nd International Conference on Mathematical Physics and Computational Simulation, IEEE. EWA Direct/TNS Proceedings.10.54254/2753-8818/36/20240617 ↗
58. The box plots alternative for visualizing quantitative data10.1016/j.pmrj.2016.02.001 ↗
59. Bimurat, Z., Kim, Y., Ismailova, R., and Sagindykov, B. (2023). Methods of navigating algorithmic complexity: Big-oh and small-oh notations. Sci. J. Astana IT Univ., 160–181.10.37943/15DNLB5877 ↗
60. Phalke, S., Vaidya, Y., and Metkar, S. (2022). Big-O time complexity analysis of algorithm. Proceedings of the 2022 International Conference on Signal and Information Processing (IConSIP), IEEE.10.1109/ICoNSIP49665.2022.10007469 ↗
61. Eberl, M. (2026, May 03). Lower Bound on Comparison-Based Sorting Algorithms. Available online: https://isa-afp.org/entries/Comparison_Sort_Lower_Bound.html.