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-232377
If you've NEVER registered a DOI in your Lattes, check our tutorial!This work proposes a heuristic for the heterogeneous load allocation problem in road transportation, extending a previously developed exact formulation. The approach combines a partially greedy initial construction with an improvement phase based on VND (variable neighborhood descent). The heuristic is designed to preserve the logic of the objective function and the constraints of the mathematical model, allowing direct comparison between both approaches. Computational experiments consider literature-based and author-generated instances, comparing the heuristic with the exact model in terms of solution quality and computational time. The results show that the heuristic substantially reduces computational effort and, for several instances, obtains solutions close to those of the exact model. However, larger average differences and greater variability were observed in some of the more demanding instances.
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