Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns

Full text
Author(s):
de Queiroz, Thiago Alves [1] ; Miyazawa, Flavio Keidi [2] ; Wakabayashi, Yoshiko [3]
Total Authors: 3
Affiliation:
[1] Univ Fed Goias, Dept Math, UFG RC, Catalao, Go - Brazil
[2] Univ Estadual Campinas, Inst Comp, IC UNICAMP, Campinas, SP - Brazil
[3] Univ Sao Paulo, Inst Math & Stat, IME USP, Sao Paulo, SP - Brazil
Total Affiliations: 3
Document type: Journal article
Source: 4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH; v. 13, n. 2, p. 199-219, JUN 2015.
Web of Science Citations: 1
Abstract

Many cutting problems on two- or three-dimensional objects require that the cuts be orthogonal and of guillotine type. However, there are applications in which the cuts must be orthogonal but need not be of guillotine type. In this paper we focus on the latter type of cuts on rectangular bins. We investigate the so-called -approach, introduced by Lins et al. (J Oper Res Soc 54:777-789, 2003), which has been used to tackle, among others, the pallet loading problem and the two-dimensional unconstrained knapsack problem. This approach concerns a method to generate two -shaped pieces from an -shaped piece. More recently, Birgin et al. (J Oper Res Soc 63(2):183-200, 2012), raised two questions concerning this approach. The first question is whether one may restrict only to cuts on raster points (rather than on all discretization points), without loss in the quality of the solution. We prove that the answer to this question is positive. The second question is whether the -approach is an optimal method to solve the unconstrained knapsack problem. We show an instance of the problem for which this approach fails to find an optimum solution. (AU)

FAPESP's process: 13/08278-8 - Algorithms for the location-routing with loading constraints problem
Grantee:Thiago Alves de Queiroz
Support type: Scholarships in Brazil - Post-Doctorate
FAPESP's process: 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science
Grantee:Carlos Eduardo Ferreira
Support type: Research Projects - Thematic Grants