Rommel Saraiva

Ms. Rommel Saraiva


Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
30 April 2015 in International Journal of Computer Integrated Manufacturing
Verified
Journal Article
Closed access
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
BJBonfim Amaro Júnior
Bonfim Amaro Júnior
RSRommel Saraiva
Rommel Saraiva
This article presents a random-key genetic algorithm (RKGA) for the nesting problem, a particular case of cutting and packing problems in which a collection of items (or polygons) has to be packed onto a rectangular object with the aim of minimising its length. In general, our approach prescribes the integration of the aforementioned metaheuristic and well-known placement rules (e.g. bottom-left). Furthermore, a shrinking algorithm – that operates within the RKGA – is also proposed to improve partial solutions. To assess the potentials of the proposed methodology, computational experiments performed on a set of difficult benchmark instances of the nesting problem are discussed here for evaluation purposes, showing that our algorithm is able to compete with previous successful studies in some particular problem instances.


8 August 2018 in Electronic Notes in Discrete Mathematics
Verified
Journal Article
Closed access
RARafael Castro de Andrade
Rafael Castro de Andrade
RSRommel Saraiva
Rommel Saraiva

30 March 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
RSRommel Saraiva
Rommel Saraiva
Napoleão NepomucenoNapoleão Nepomuceno
Napoleão Nepomuceno
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
We propose in this paper a two-phase approach that decomposes the process of solving the three-dimensional single Container Loading Problem (CLP) into subsequent tasks: (i) the generation of blocks of boxes and (ii) the loading of blocks into the container. The first phase is deterministic, and it is performed by means of constructive algorithms from the literature. The second phase is non-deterministic, and it is performed with the use of Generate-and-Solve (GS), a problem-independent hybrid optimization framework based on problem instance reduction that combines a metaheuristic with an exact solver. Computational experiments performed on benchmark instances indicate that our approach presents competitive results compared to those found by state-of-the-art algorithms, particularly for problem instances consisting of a few types of boxes. In fact, we present new best solutions for classical instances from groups BR1 and BR2.

1 September 2013 in IFAC Proceedings Volumes
Verified
Journal Article
Closed access
PDF file
BJBonfim Amaro Junior
Bonfim Amaro Junior
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
RSRommel Saraiva
Rommel Saraiva

13 July 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
UGUiraquitan Tadeu Gomes
Uiraquitan Tadeu Gomes
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
RSRommel Saraiva
Rommel Saraiva
In a demanding and globalized market, production management plays a fundamental role in the company’s reference. Proper management of the production area allows companies to obtain productivity gains, reducing operational costs and make contributions to face the competitiveness of their competitors. When defining its strategic objectives in a productive system, it is necessary to formulate plans to manage human resources and strategies based on requirements. In this context, planning, production, and control (PPC) is an excellent ally of the organizations. The adequate development of the activities of the PPC allows companies to minimize production orders not attended, minimize stocks of raw materials, and finished products, minimize idleness of human resources by efficient allocation of work and minimize production processing times. The present work proposes a study to organize and develop a model that guides the prediction of the setup gain in the fabric dyeing process, structured by the traveling salesman problem.