One-side oscillation strategic approach

 

Guardado en:
Bibliografiske detaljer
Autores: Beausoleil, Ricardo, Valcárcel Miró, Yasser
Format: artículo original
Status:Versión publicada
Fecha de Publicación:2013
Beskrivelse: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
Institution:Universidad de Costa Rica
Repositorio:Portal de Revistas UCR
Sprog:Español
OAI Identifier:oai:portal.ucr.ac.cr:article/8476
Online adgang:https://revistas.ucr.ac.cr/index.php/matematica/article/view/8476
Access Level:acceso abierto
Palabra clave:heuristics
greedy algorithm
backtrack algorithm
one-dimensional cutting problem
Heurísticas
algoritmo goloso
algoritmo backtrack
problema unidimensional de cortes