A theoretical and computational study of green vehicle routing problems

Matheus Diógenes Andrade () and Fábio Luiz Usberti ()
Additional contact information
Matheus Diógenes Andrade: University of Campinas
Fábio Luiz Usberti: University of Campinas

Journal of Combinatorial Optimization, 2023, vol. 45, issue 5, No 8, 56 pages

Abstract: 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.

Keywords: Mixed integer linear programming; Mathematical programming; Vehicle routing problem; Combinatorial optimization; Green logistics (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01043-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:45:y:2023:i:5:d:10.1007_s10878-023-01043-4

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-023-01043-4

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().