In this paper, we introduce the Green Vehicle Routing Problem with capacitated Alternative Fuel Stations (AFSs), a more realistic variant of the Green Vehicle Routing Problem where the capacity of the AFSs is addressed. Two Mixed Integer Linear Programming formulations, one based on arc-variables and one on path-variables are presented. In order to reduce the computational time required to solve the problem, two variants of an exact cutting planes method are proposed. All the proposed approaches are also extended to be applied in a scenario in which AFSs reservation is allowed, by introducing time windows at them. Computational experiments are carried out on both benchmark and challenging realistic instances for which the capacity of the AFSs is a crucial issue.
The green vehicle routing problem with capacitated alternative fuel stations
M. Bruglieri;
2019-01-01
Abstract
In this paper, we introduce the Green Vehicle Routing Problem with capacitated Alternative Fuel Stations (AFSs), a more realistic variant of the Green Vehicle Routing Problem where the capacity of the AFSs is addressed. Two Mixed Integer Linear Programming formulations, one based on arc-variables and one on path-variables are presented. In order to reduce the computational time required to solve the problem, two variants of an exact cutting planes method are proposed. All the proposed approaches are also extended to be applied in a scenario in which AFSs reservation is allowed, by introducing time windows at them. Computational experiments are carried out on both benchmark and challenging realistic instances for which the capacity of the AFSs is a crucial issue.| File | Dimensione | Formato | |
|---|---|---|---|
|
StationCapacitated_GVRP.pdf
Open Access dal 02/12/2022
Descrizione: Articolo principale
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
883.11 kB
Formato
Adobe PDF
|
883.11 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
