Wilton Gustavo Gomes da Costa
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Wilton Gustavo Gomes da Costa has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Bianca de Almeida Dantas
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
1 shared publication - Ricardo Santos
College of Computing, Federal University of Mato Grosso do Sul, Campo Grande 79070-900, Brazil
1 shared publication - Willy Alves de Oliveira Soler
Mathematics Institute, Universidade Federal de Mato Grosso do Sul, Campo Grande, Brazil
1 shared publication
Latest Publications
- Open Access
- 19 May 2025
- Published by Instituto Federal de Educacao, Ciencia e Tecnologia da Paraiba in Revista Principia
- Vol. 62
A neighborhood search-based heuristic for the dynamic vehicle routing problem
The Vehicle Routing Problem (VRP) is a classical optimization problem focused on determining routes for a fleet of vehicles to fulfill the demands of a set of customers. Due to its wide applicability, particularly in the logistics sector, numerous variants of the VRP have been developed. One such variant is the Dynamic Vehicle Routing Problem (DVRP), characterized by the emergence of new customer demands after the initial routing has been established. The combinatorial complexity of the DVRP poses significant challenges in finding high-quality, feasible solutions within practical runtime limits for real-world, large-scale problems, thereby driving the development of heuristic approaches. This paper introduces a novel heuristic algorithm, Dynamic Search per Neighbors Routes (DSNR), which employs neighborhood search techniques based on the 2-Opt* operator to incorporate new delivery requests into existing routes. The DSNR algorithm was tested using instances from the Loggibud benchmark, representing real-world data from three distinct Brazilian cities. In terms of distance and the number of vehicles required, the proposed approach demonstrated superior performance compared to two existing methods from the literature: the QRP Sweep (QRPS) and K-Means Greedy (KG). The DSNR achieved improvements of 15% to 17% in terms of distance and final delivery costs.
- 19 May 2025
- Published by Instituto Federal de Educacao, Ciencia e Tecnologia da Paraiba in Revista Principia
- Vol. 62
Open AccessA neighborhood search-based heuristic for the dynamic vehicle routing problem
The Vehicle Routing Problem (VRP) is a classical optimization problem focused on determining routes for a fleet of vehicles to fulfill the demands of a set of customers. Due to its wide applicability, particularly in the logistics sector, numerous variants of the VRP have been developed. One such variant is the Dynamic Vehicle Routing Problem (DVRP), characterized by the emergence of new customer demands after the initial routing has been established. The combinatorial complexity of the DVRP poses significant challenges in finding high-quality, feasible solutions within practical runtime limits for real-world, large-scale problems, thereby driving the development of heuristic approaches. This paper introduces a novel heuristic algorithm, Dynamic Search per Neighbors Routes (DSNR), which employs neighborhood search techniques based on the 2-Opt* operator to incorporate new delivery requests into existing routes. The DSNR algorithm was tested using instances from the Loggibud benchmark, representing real-world data from three distinct Brazilian cities. In terms of distance and the number of vehicles required, the proposed approach demonstrated superior performance compared to two existing methods from the literature: the QRP Sweep (QRPS) and K-Means Greedy (KG). The DSNR achieved improvements of 15% to 17% in terms of distance and final delivery costs.