Building General Hyper-Heuristics for Multi-Objective Cutting Stock Problems
Abstract: In this article we build multi-objective hyperheuristics (MOHHs) using the multi-objective evolutionary algorithm NSGA-II for solving irregular 2D cutting stock problems under a bi-objective minimization schema, having a trade-off between the number of sheets used to fit a finite number of...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | México |
| Institución: | Instituto Politécnico Nacional |
| Repositorio: | Repositorio Digital del IPN |
| OAI Identifier: | oai:www.repositoriodigital.ipn.mx:123456789/14554 |
| Acceso en línea: | http://www.repositoriodigital.ipn.mx/handle/123456789/14554 |
| Access Level: | acceso abierto |
| Palabra clave: | Keywords: Hyper-heuristics, multi-objective, optimization, evolutionary computation, cutting problems. |
| Sumario: | Abstract: In this article we build multi-objective hyperheuristics (MOHHs) using the multi-objective evolutionary algorithm NSGA-II for solving irregular 2D cutting stock problems under a bi-objective minimization schema, having a trade-off between the number of sheets used to fit a finite number of pieces and the time required to perform the placement of these pieces. We solve this problem using a multiobjective variation of hyper-heuristics called MOHH, whose main idea consists of finding a set of simple heuristics which can be combined to find a general solution, where a single heuristic is applied depending on the current condition of the problem instead of applying a unique single heuristic during the whole placement process. MOHHs are built after going through a learning process using the NSGA-II, which evolves combinations of condition-action rules producing at the end a set of Pareto-optimal MOHHs. We test the approximated MOHHs on several sets of benchmark problems and present the results. |
|---|