A new MILP formulation for the Green Vehicle Routing Problem is introduced where the visits to the Alternative Fuel Stations (AFSs) are only implicitly considered. The number of variables is also reduced by pre-computing for each couple of customers an efficient set of AFSs, only given by those that may be actually used in an optimal solution. Numerical experiments on benchmark instances show that our model outperforms the previous ones proposed in the literature.
A new mathematical programming model for the Green Vehicle Routing Problem
MANCINI, SIMONA;
2016-01-01
Abstract
A new MILP formulation for the Green Vehicle Routing Problem is introduced where the visits to the Alternative Fuel Stations (AFSs) are only implicitly considered. The number of variables is also reduced by pre-computing for each couple of customers an efficient set of AFSs, only given by those that may be actually used in an optimal solution. Numerical experiments on benchmark instances show that our model outperforms the previous ones proposed in the literature.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
CTW_green2016.pdf
Solo gestori archivio
Tipologia:
versione editoriale (VoR)
Dimensione
174.91 kB
Formato
Adobe PDF
|
174.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
