Discrete African buffalo algorithm to solve the cutting stock problem
The cutting stock problem addressed in this document consists of minimizing the total waste produced by cutting a set of small parts in a given sequence from larger pieces of material. The African buffalo algorithm has successfully solved combinatorial problems. One of the difficulties of this algor...
| Autores: | , , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2023 |
| País: | México |
| Institución: | UNIVERSIDAD AUTÓNOMA DEL ESTADO DE HIDALGO |
| Repositorio: | PÄDI Boletín Científico de Ciencias Básicas e Ingeniería del ICBI |
| Idioma: | español |
| OAI Identifier: | oai:repository.uaeh.edu.mx:article/11489 |
| Acceso en línea: | https://repository.uaeh.edu.mx/revistas/index.php/icbi/article/view/11489 |
| Access Level: | acceso abierto |
| Palabra clave: | Cutting stock problem metaheuristics discretization combinatorial problem problema de corte metaheurística discretización problema combinatorio |
| Sumario: | The cutting stock problem addressed in this document consists of minimizing the total waste produced by cutting a set of small parts in a given sequence from larger pieces of material. The African buffalo algorithm has successfully solved combinatorial problems. One of the difficulties of this algorithm is generating discrete solutions for this class of discrete problems. In this work, a discrete variant of the African buffalo algorithm is used, in which crossover technique and the ranked order value technique are compared to obtain discrete solutions. A set of ten instances of different complexity is used to compare these techniques. The results show that the crossover technique surpasses the others in terms of the quality of the solutions. Then these results are compared against other algorithms to evaluate their performance. |
|---|