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-232559
If you've NEVER registered a DOI in your Lattes, check our tutorial!The Vehicle Routing Problem with Time Window is a classic combinatorial optimization problem, relevant in complex logistics applications. Its objective is to determine minimum cost routes for a fleet of vehicles, serving customers with known demands. In this work, we propose a hybrid genetic algorithm that combines the I1 constructive heuristic, evolutionary operators and local search to refine the solutions. The method was evaluated in Solomon instances, considering two variants (with and without local search) to analyze its impact. The results show that the approach, especially with local search, produces high-quality solutions, with low deviations from the best known solutions
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