One-side oscillation strategic approach
Fuente:
Redalyc
Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Universidad de Costa Rica
2013
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1876424428411158528 |
|---|---|
| author | Ricardo Beausoleil |
| author_facet | Ricardo Beausoleil |
| contents | One-side oscillation strategic approach Ricardo Beausoleil Yasser Valcárcel Miró Física, Astronomía y Matemáticas one Heuristics greedy algorithm backtrack algorithm dimensional cutting problem 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 Problem is 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 or instances of more than 500 pieces at a very low computational cost. 2013 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45328566003 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.1 Vol.20 |
| format | Artículo científico |
| id | redalyc_45328566003 |
| institution | Redalyc |
| language | en |
| publishDate | 2013 |
| publisher | Universidad de Costa Rica |
| spellingShingle | One-side oscillation strategic approach Ricardo Beausoleil Física, Astronomía y Matemáticas one Heuristics greedy algorithm backtrack algorithm dimensional cutting problem One-side oscillation strategic approach Ricardo Beausoleil Yasser Valcárcel Miró Física, Astronomía y Matemáticas one Heuristics greedy algorithm backtrack algorithm dimensional cutting problem 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 Problem is 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 or instances of more than 500 pieces at a very low computational cost. 2013 artículo científico 1409-2433 https://www.redalyc.org/articulo.oa?id=45328566003 en http://www.redalyc.org/revista.oa?id=453 Revista de Matemática: Teoría y Aplicaciones application/pdf Universidad de Costa Rica Revista de Matemática: Teoría y Aplicaciones (Costa Rica) Num.1 Vol.20 |
| title | One-side oscillation strategic approach |
| topic | Física, Astronomía y Matemáticas one Heuristics greedy algorithm backtrack algorithm dimensional cutting problem |
| url | https://www.redalyc.org/articulo.oa?id=45328566003 |