Using Simulated Annealing with a Neighborhood Heuristic for Roll Cutting Optimization
Abstract 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 we...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2009 |
| País: | México |
| Institución: | Instituto Politécnico Nacional |
| Repositorio: | Repositorio Digital del IPN |
| OAI Identifier: | oai:www.repositoriodigital.ipn.mx:123456789/15455 |
| Acceso en línea: | http://www.repositoriodigital.ipn.mx/handle/123456789/15455 |
| Access Level: | acceso abierto |
| Palabra clave: | Keywords. Simulated Annealing, optimization, heuristics, cutting, paper rolls. |
| Sumario: | Abstract 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. |
|---|