Ricardo Barboza Saboia

Ricardo Barboza Saboia


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
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.