One-side oscillation strategic approach
Guardado en:
| Autores: | , |
|---|---|
| 格式: | artículo original |
| 状态: | Versión publicada |
| Fecha de Publicación: | 2013 |
| 实物特征: | This paper reports an approach developed to find a good quality solution for a generalized assignment problem with application to the Dimensional Cutting Problem. The objective at the Cutting Problemis to divide different pools of pieces of the same dimension among different items of available material all having two dimensions, the width and length. The solution is found keeping the largest number of pieces in a single material. Some initial numerical experiences found for the algorithm optimal and suboptimal solutions orinstances of more than 500 pieces at a very low computational cost. |
| País: | Portal de Revistas UCR |
| 机构: | Universidad de Costa Rica |
| Repositorio: | Portal de Revistas UCR |
| 语言: | Español |
| OAI Identifier: | oai:archivo.portal.ucr.ac.cr:article/8476 |
| 在线阅读: | https://archivo.revistas.ucr.ac.cr/index.php/matematica/article/view/8476 |
| Palabra clave: | heuristics greedy algorithm backtrack algorithm one-dimensional cutting problem Heurísticas algoritmo goloso algoritmo backtrack problema unidimensional de cortes |