Using Simulated Annealing with a Neighborhood Heuristic for Roll Cutting Optimization
This article presents the use of the Simulated Annealing algorithm with a heuristic to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied. Several tests were perfor...
| Autores: | , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | México |
| Recursos: | Instituto Tecnológico y de Estudios Superiores de Monterrey |
| Repositorio: | Redalyc-ITESM |
| OAI Identifier: | oai:redalyc.org:61513250008 |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=61513250008 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computación cutting heuristics paper rolls optimization Simulated Annealing |
| Resumo: | This article presents the use of the Simulated Annealing algorithm with a heuristic to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied. Several tests were performed with real data from a paper company in which an average of 30% waste reduction and 100% reduction in production to inventory are obtained compare to the previous procedure. |
|---|