Napoleão Nepomuceno

Dr. Napoleão Nepomuceno

Universidade de Fortaleza, Fortaleza, Ceará, Brazil
orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications

1 January 2007 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
Napoleão NepomucenoNapoleão Nepomuceno
Napoleão Nepomuceno
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
André CoelhoAndré Coelho
André Coelho

1 January 2008
Verified
Book Chapter
Closed access
PDF file
Napoleão NepomucenoNapoleão Nepomuceno
Napoleão Nepomuceno
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
André CoelhoAndré Coelho
André Coelho

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 May 2010 in Computer Communications
Verified
Journal Article
Closed access
DCDavid Coudert
David Coudert
Napoleão NepomucenoNapoleão Nepomuceno
Napoleão Nepomuceno
HRHervé Rivano
Hervé Rivano

3 August 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
Napoleão NepomucenoNapoleão Nepomuceno
Napoleão Nepomuceno
RSRicardo Barboza Saboia
Ricardo Barboza Saboia
Placido Rogerio PinheiroPlacido Rogerio Pinheiro
Placido Rogerio Pinheiro
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), customers demanding both delivery and pickup operations have to be visited once by a single vehicle. In this work, we propose a fast randomized algorithm using a nearest neighbor strategy to tackle an extension of the VRPSPD in which the fleet of vehicles is heterogeneous. This variant is an NP-hard problem, which in practice makes it impossible to be solved to proven optimality for large instances. To evaluate the proposal, we use benchmark instances from the literature and compare our results to those obtained by a state-of-the-art algorithm. Our approach presents very competitive results, not only improving several of the known solutions, but also running in a shorter time.