Luiz Henrique Cherri

Luiz Henrique Cherri

Auto-generated profile, based on publicly available information

Luiz Henrique Cherri

University of São Paulo

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 September 2016 in European Journal of Operational Research
Verified
Journal Article
Closed access
LCLuiz H. Cherri
Luiz H. Cherri
LMLeandro R. Mundim
Leandro R. Mundim
MAMarina Andretta
Marina Andretta
FTFranklina M.B. Toledo
Franklina M.B. Toledo
JOJosé Fernando Oliveira
José Fernando Oliveira
MCMaria Antónia Carravilla
Maria Antónia Carravilla

14 March 2018 in Journal of Global Optimization
Verified
Journal Article
Closed access
PDF file
LCLuiz H. Cherri
Luiz H. Cherri
ACAdriana Cristina Cherri
Adriana Cristina Cherri
ESEdilaine Martins Soler
Edilaine Martins Soler

1 December 2016 in Pesquisa Operacional
Verified
Journal Article
Open access
PDF file
LCLuiz Henrique Cherri
Luiz Henrique Cherri
MCMaria Antónia Carravilla
Maria Antónia Carravilla
FTFranklina Maria Bragion Toledo
Franklina Maria Bragion Toledo
The irregular strip packing problem is a common variant of cutting and packing problems. Only a few exact methods have been proposed to solve this problem in the literature. However, several heuristics have been proposed to solve it. Despite the number of proposed heuristics, only a few methods that combine exact and heuristic approaches to solve the problem can be found in the literature. In this paper, a matheuristic is proposed to solve the irregular strip packing problem. The method has three phases in which exact mixed integer programming models from the literature are used to solve the sub-problems. The results show that the matheuristic is less dependent on the instance size and finds equal or better solutions in 87,5% of the cases in shorter computational times compared with the results of other models in the literature. Furthermore, the matheuristic is faster than other heuristics from the literature.

1 January 2019 in Operations Research Perspectives
Verified
Journal Article
Open access
LCLuiz Henrique Cherri
Luiz Henrique Cherri
MCMaria Antónia Carravilla
Maria Antónia Carravilla
CRCristina Ribeiro
Cristina Ribeiro
FTFranklina Maria Bragion Toledo
Franklina Maria Bragion Toledo

1 September 2014 in Computers & Operations Research
Verified
Journal Article
Closed access
ALAline A.S. Leão
Aline A.S. Leão
LCLuiz H. Cherri
Luiz H. Cherri
MAMarcos N. Arenales
Marcos N. Arenales

2 December 2017 in International Journal of Production Research
Verified
Journal Article
Closed access
LCLuiz Henrique Cherri
Luiz Henrique Cherri
ACAdriana Cristina Cherri
Adriana Cristina Cherri
MCMaria Antónia Carravilla
Maria Antónia Carravilla
JOJosé Fernando Oliveira
José Fernando Oliveira
FTFranklina Maria Bragion Toledo
Franklina Maria Bragion Toledo
AVAndréa Carla Gonçalves Vianna
Andréa Carla Gonçalves Vianna
As in many other combinatorial optimisation problems, research on nesting problems (aka irregular packing problems) has evolved around the dichotomy between continuous (time consuming) and discrete (memory consuming) representations of the solution space. Recent research has been devoting increasing attention to discrete representations for the geometric layer of nesting problems, namely in mathematical programming-based approaches. These approaches employ conventional regular meshes, and an increase in their precision has a high computational cost. In this paper, we propose a data structure to represent non-regular meshes, based on the geometry of each piece. It supports non-regular discrete geometric representations of the shapes, and by means of the proposed data structure, the discretisation can be easily adapted to the instances, thus overcoming the precision loss associated with discrete representations and consequently allowing for a more efficient implementation of search methods for the nesting problem. Experiments are conducted with the dotted-board model – a recently published mesh-based binary programming model for nesting problems. In the light of both the scale of the instances, which are now solvable, and the quality of the solutions obtained, the results are very promising.