Skip to main content
Log in

A theoretical and computational study of green vehicle routing problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This work investigates green vehicle routing problems (G-VRPs). GVRPs are NP-hard problems embodying the motivation, concepts, and advances of green logistics in the vehicle routing problem (VRP) domain. To address the shorter autonomy of electric vehicles, the G-VRP considers Alternative Fuel Stations (AFSs) that can be used to refuel vehicles in travel. Originally, the G-VRP prohibits consecutive AFS visits, i.e., a solution cannot have an edge between two AFSs. Here, besides the original G-VRP, we also consider the variant in which consecutive AFS visits are allowed. This research proposes combinatorial properties, concerning the number of visits to the AFSs, bounds on fuel consumption, and bounds on the number of routes and their cost. Furthermore, this research proposes valid inequalities, MILP formulations, preprocessing conditions, and lower bounds which strengthen the mathematical formulations for both G-VRP versions, thus improving their exact solution. The proposed methodologies were evaluated with extensive computational experiments. The results are analyzed and discussed, and conclusions on the benefits of the contributions are presented.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Data Availability

The datasets generated during and/or analyzed during the current study are available on-line.

Notes

  1. http://www.ic.unicamp.br/~fusberti/problems/grvp.

References

Download references

Acknowledgements

This work has been funded by the São Paulo Research Foundation (proc. 2015/11937-9 and 2018/25950-5), Brazilian National Council for Scientific and Technological Development (proc. 435520/2018-0 and 140328/2021-1), and BECAS SANTANDER - UNICAMP/ IC. This support is gratefully acknowledged. Furthermore, we thank the referees for their valuable comments.

Funding

This work has been funded by the São Paulo Research Foundation (proc. 2015/11937-9 and 2018/25950-5), Brazilian National Council for Scientific and Technological Development (proc. 435520/2018-0 and 140328/2021-1), and BECAS SANTANDER - UNICAMP/ IC.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matheus Diógenes Andrade.

Ethics declarations

Conflict of interest

The authors have no competing interests to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Andrade, M.D., Usberti, F.L. A theoretical and computational study of green vehicle routing problems. J Comb Optim 45, 118 (2023). https://doi.org/10.1007/s10878-023-01043-4

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10878-023-01043-4

Keywords

Navigation