Algoritmo discreto del búfalo africano para resolver el problema de corte de material

Irving Barragan-Vite; Leonardo Javier Montiel-Arrieta; Juan Carlos Seck-Tuoh-Mora; Norberto Hernández-Romero; Joselito Medina-Marin

doi:10.29057/icbi.v11iEspecial3.11489

Irving Barragan-Vite Universidad Autónoma del Estado de Hidalgo https://orcid.org/0000-0002-3625-6943
Leonardo Javier Montiel-Arrieta Universidad Autónoma del Estado de Hidalgo https://orcid.org/0000-0002-9259-535X
Juan Carlos Seck-Tuoh-Mora Universidad Autónoma del Estado de Hidalgo https://orcid.org/0000-0003-3678-1120
Norberto Hernández-Romero Universidad Autónoma del Estado de Hidalgo https://orcid.org/0000-0001-9942-306X
Joselito Medina-Marin Universidad Autónoma del Estado de Hidalgo https://orcid.org/0000-0003-0937-8707

DOI: https://doi.org/10.29057/icbi.v11iEspecial3.11489

Palabras clave: problema de corte, metaheurística, discretización, problema combinatorio

Resumen

El problema de corte abordado en este documento consiste en minimizar el desperdicio total producido al cortar un conjunto de piezas pequeñas en una secuencia determinada a partir de piezas de material más grandes. El algoritmo del búfalo Africano ha sido empleado exitosamente para resolver problemas de tipo combinatorio. Una de las dificultades de este algoritmo es generar soluciones discretas para esta clase de problemas discretos. En este trabajo se emplea una variante discreta del algoritmo del búfalo Africano en la que se compara una técnica de cruza así como la técnica del valor del orden clasificado para obtener soluciones discretas. Se usa un conjunto de diez instancias de diferente complejidad para realizar la comparación de estas técnicas. Los resultados muestran que la técnica de cruza supera a las otras en cuanto a la calidad de las soluciones. Luego estos resultados se comparan contra otros algoritmos para evaluar su desempeño.

Descargas

La descarga de datos todavía no está disponible.

Citas

Alfares, H. K. y Alsawafy, O. G. (2019). A least-loss algorithm for a biobjective one-dimensional cutting-stock problem. International Journal of Applied Industrial Engineering (IJAIE), 6(2):1–19.

Araujo, S. A. d., Poldi, K. C., y Smith, J. (2014). A genetic algorithm for the one-dimensional cutting stock problem with setups. Pesquisa Operacional, 34(2):165–187.

Asvany, T., Amudhavel, J., y Sujatha, P. (2017). One-dimensional cutting stock problem with single and multiple stock lengths using dpso. Advnaces and Applications in Mahtematical Sciences, 17(4):147–163.

Ben Lagha, G., Dahmani, N., y Krichen, S. (2014). Particle swarm optimization approach for resolving the cutting stock problem. En 2014 International Conference on Advanced Logistics and Transport (ICALT), pp. 259–263.

Berberler, M. y Nuriyev, U. (2010). A new heuristic algorithm for the onedimensional cutting stock problem. Applied and Computational Mathematics, 9(1):19–30.

Chen, W.-N. y Tan, D.-Z. (2018). Set-based discrete particle swarm optimization and its applications: a survey. Frontiers of Computer Science: Selected Publications from Chinese Universities, 12(2).

Chen, Y.-H., Huang, H.-C., Cai, H.-Y., y Chen, P.-F. (2019). A genetic algorithm approach for the multiple length cutting stock problem. En 2019 IEEE 1st Global Conference on Life Sciences and Technologies (LifeTech),

pp. 162–165.

Chiong, R. y Beng, O. K. (2007). A comparison between genetic algorithms and evolutionary programming based on cutting stock problem. Engineering Letters, 14(1):72–77.

Delorme, M., Iori, M., y Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1):1–20.

Evtimov, G. y Fidanova, S. (2018). Ant colony optimization algorithm for 1d cutting stock problem. En Georgiev, K., Todorov, M., y Georgiev, I., editores, Advanced Computing in Industrial Mathematics: 11th Annual Meeting

of the Bulgarian Section of SIAM December 20-22, 2016, Sofia, Bulgaria. Revised Selected Papers, pp. 25–31. Springer International Publishing.

Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5–30.

Fang, J., Rao, Y., Luo, Q., y Xu, J. (2023). Solving one-dimensional cutting stock problems with the deep reinforcement learning. Mathematics, 11(4):1028.

Foerster, H. yWascher, G. (2000). Pattern reduction in one-dimensional cutting stock problems. International Journal of Production Research, 38(7):1657–1676.

Gherboudj, A. (2019). African buffalo optimization for one dimensional bin packing problem. International Journal of Swarm Intelligence Research (IJSIR), 10(4):38–52.

Gilmore, P. C. y Gomory, R. E. (1961). A linear programming approach to the cutting-stock problem. Operations Research, 9(6):849–859.

Gilmore, P. C. y Gomory, R. E. (1963). A linear programming approach to the cutting stock problem—part ii. Operations Research, 11(6):863–888.

Gradišar, M., Kljaji´c, M., Resinoviˇc, G., y Jesenko, J. (1999). A sequential heuristic procedure for one-dimensional cutting. European Journal of Operational Research, 114(3):557–568.

Haessler, R. W. (1992). One-dimensional cutting stock problem problems and solution procedures. Mathl. Comput. Modelling, 16(1):1–8.

Hinterding, R. y Khan, L. (1995). Genetic algorithms for cutting stock problems: With and without contiguity. En Yao, X., editor, Progress in Evolutionary Computation, pp. 166–186, Berlin, Heidelberg. Springer Berlin

Heidelberg.

Jahromi, M. H., Tavakkoli-Moghaddam, R., Makui, A., y Shamsi, A. (2012). Solving an one-dimensional cutting stock problem by simulated annealing and tabu search. Journal of Industrial Engineering International, 8(24).

Jiang, T., Zhang, C., y Sun, Q.-M. (2019). Green job shop scheduling problem with discrete whale optimization algorithm. IEEE Access, 7:43153–43166.

Jiang, T., Zhu, H., y Deng, G. (2020). Improved african buffalo optimization algorithm for the green flexible job shop scheduling problem considering energy consumption. Journal of Intelligent & Fuzzy Systems, 38(4):4573–

Kantorovich, L. V. (1960). Mathematical methods of organizing and planning production. Management science, 6(4):366–422.

Krisnawati, M., Sibarani, A. A., Mustikasari, A., y Aulia, D. (2020). African buffalo optimization for solving flow shop scheduling problem to minimize makespan. IOP Conference Series: Materials Science and Engineering,

(1):012061.

Lee, D., Son, S., Kim, D., y Kim, S. (2020). Special-length-priority algorithm to minimize reinforcing bar-cutting waste for sustainable construction. Sustainability, 12(15).

Levine, J. y Ducatelle, F. (2004). Ant colony optimization and local search for bin packing and cutting stock problems. Journal of the Operational Research Society, 55(7):705–716.

Li, Y., Zheng, B., y Dai, Z. (2007). General particle swarm optimization based on simulated annealing for multi-specification one-dimensional cutting stock problem. En Wang, Y., Cheung, Y.-m., y Liu, H., editores, Computational Intelligence and Security, pp. 67–76, Berlin, Heidelberg. Springer Berlin Heidelberg.

Liang, K.-H., Yao, X., Newton, C., y Hoffman, D. (1998). Solving cutting stock problems by evolutionary programming. En 7th Annual Conference on Evolutionary Programming, EP 1998, volumen 1447, pp. 755–764.

Liang, K.-H., Yao, X., Newton, C., y Hoffman, D. (2002). A new evolutionary approach to cutting stock problems with and without contiguity. Computers & Operations Research, 29(12):1641–1659.

Lu, Y. y Jiang, T. (2019). Bi-population based discrete bat algorithm for the low-carbon job shop scheduling problem. IEEE Access, 7:14513–14522.

Man, H., Odili, J. B., y Mohmad Kahar, M. N. (2016). Solving the traveling salesman’s problem using the african buffalo optimization. Computational Intelligence and Neuroscience, 2016:1510256.

Martinovic, J., Scheithauer, G., y Valério de Carvalho, J. (2018). A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. European Journal of Operational Research,

(2):458–471.

Montiel-Arrieta, L. J., Barragán-Vite, I., Hernández-Romero, N., y González-Hernández, M. (2022). Algoritmo del búfalo africano para resolver el problema de corte unidimensional. Pädi Boletín Científico de Ciencias Básicas

e Ingenierías del ICBI, 10(Especial2):1–8.

Odili, J. B. y Kahar, M. N. M. (2015a). African buffalo optimization (abo): A new meta-heuristic algorithm. En National Conference for Postgraduate Research Universiti Malaysia PAHANG, Kuantan, pp. 1–8, Kuantan, Malaysia. NCON-PGR.

Odili, J. B. y Kahar, M. N. M. (2015b). African buffalo optimization (abo): A new metaheuristic algorithm. Journal of Advanced & Applied Sciences (JAAS), 03(03):101–106.

Odili, J. B., Kahar, M. N. M., y Anwar, S. (2015). African buffalo optimization: A swarm-intelligence technique. Procedia Computer Science, 76:443–448. 2015 IEEE International Symposium on Robotics and Intelligent Sensors

(IEEE IRIS2015).

Ogunranti, G. A. y Oluleye, A. E. (2016). Minimizing waste (off-cuts) using cutting stock model: The case of one dimensional cutting stock problem in wood working industry. Journal of Industrial Engineering and Management, 9(3):834–859.

Panella, M., Odili, J. B., Noraziah, A., y Zarina, M. (2021). A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem. Computational Intelligence and

Neuroscience, 2021:6625438.

Parmar, K. B., Prajapati, H. B., y Dabhi, V. K. (2015). Cutting stock problem: A solution based on novel pattern based chromosome representation using modified ga. En 2015 International Conference on Circuits, Power

and Computing Technologies [ICCPCT-2015], pp. 1–7.

Peng, J. y Chu, Z. S. (2010a). A hybrid ant colony algorithm for the cutting stock problem. En 2010 International Conference on Future Information Technology and Management Engineering, volumen 2, pp. 32–35.

Peng, J. y Chu, Z. S. (2010b). A hybrid multi-chromosome genetic algorithm for the cutting stock problem. En 2010 3rd International Conference on Information Management, Innovation Management and Industrial Engineering, volumen 1, pp. 508–511.

Reeves, C. (1996). Hybrid genetic algorithms for bin-packing and related problems. Annals of Operations Research, 63:371–396.

Renildo, G., Cerqueira, L., y Yanasse, H. (2009). A pattern reduction procedure in a one-dimensional cutting stock problem by grouping items according to their demands. Journal of Computational Interdisciplinary Sciences, 1:159–164.

Scheithauer, G. (2018). One-dimensional cutting stock. En Price, C. C., editor, Introduction to Cutting and Packing Optimization: Problems, Modeling Approaches, Solution Methods, volumen 263, capítulo 4, pp. 73–122. Springer

International Publishing AG, Cham, Switzerland.

Shen, X., Li, Y., Yang, J., y Yu, L. (2007). A heuristic particle swarm optimization for cutting stock problem based on cutting pattern. En Shi, Y., van Albada, G. D., Dongarra, J., y Sloot, P. M. A., editores, Computational Science – ICCS 2007, pp. 1175–1178, Berlin, Heidelberg. Springer Berlin Heidelberg.

Str ˛ ak, Ł., Skinderowicz, R., Boryczka, U., y Nowakowski, A. (2019). A selfadaptive discrete pso algorithm with heterogeneous parameter values for dynamic tsp. Entropy, 21(8).

Strasser, S., Goodman, R., Sheppard, J., y Butcher, S. (1995). A new discrete particle swarm optimization algorithm. En Friedrich, T., editor, GECCO ’16: Genetic and Evolutionary Computation Conference, pp. 53–60, New York, United States. Association for Computing Machinery.

Umetani, S., Yagiura, M., e Ibaraki, T. (2003). One-dimensional cutting stock problem to minimize the number of different patterns. European Journal of Operational Research, 146(2):388–402.

Umetani, S., Yagiura, M., e Ibaraki, T. (2006). One-dimensional cutting stock problem with a given number of setups: A hybrid approach of metaheuristics and linear programming. Journal of Mathematical Modelling and

Algorithms, 5:43–64.

Valério de Carvalho, J. (2002). Lp models for bin packing and cutting stock problems. European Journal of Operational Research, 141(2):253–273.

van Zyl, J.-P. y Engelbrecht, A. P. (2023). Set-based particle swarm optimisation: A review. Mathematics, 11(13).

Vishwakarma, R. y Powar, P. L. (2021). An efficient mathematical model for solving one-dimensional cutting stock problem using sustainable trim. Advances in Industrial and Manufacturing Engineering, 3:100046.

Wäscher, G., Hausner, H., y Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183:1109–1130.

Yanasse, H. H. y Limeira, M. S. (2006). A hybrid heuristic to reduce the number of different patterns in cutting stock problems. Computers & Operations Research, 33(9):2744–2756. Part Special Issue: Anniversary Focused Issue of Computers & Operations Research on Tabu Search.