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-232523
If you've NEVER registered a DOI in your Lattes, check our tutorial!Studies in Smart and Sustainable Cities and Regions have become fundamental to addressing challenges related to mobility, sustainability, and service efficiency. In this context, the Vehicle Routing Problem (VRP) emerges as a challenge for optimizing logistics systems, contributing to the reduction of operational costs and pollutant emissions. This work presents efficient algorithms for the Electric Vehicle Routing Problem with a Heterogeneous Fleet and Split Deliveries, a little-explored variant of the classic VRP. Unlike the traditional approach, the fleet is composed of electric vehicles with different capacities and costs, in addition to the possibility of demand fractionation. Initially, a new exact mathematical model that formalizes the problem is proposed, followed by a GRASP heuristic with Randomized Variable Neighborhood Descent (RVND). The performance of the proposed approach is evaluated through computational experiments on benchmark instances from the literature, which prove the efficiency of the methods.
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