This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232391
If you've NEVER registered a DOI in your Lattes, check our tutorial!The Capacitated Vehicle Routing Problem (CVRP) is a classic combinatorial optimization problem with wide theoretical and practical applications and has been studied for nearly 70 years. This work proposes a hybrid matheuristic for the CVRP to evaluate how initial solution methods, local searches, and perturbations affect final solution quality and computation time. The approach is based on Iterative Local Search (ILS) and, after execution, applies a column-and-cut procedure to compute the optimality gap and search exactly for new integer solutions. Tests on benchmark instances show that the method finds about 35% of known optimal solutions with an average runtime of 176 seconds.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper