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

BRUGLIERI, MAURIZIO;
2016

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.
Vehicle Routing, Refueling, Alternative Fuel Vehicles, Efficient set of Alternative Fuel Stations, Mixed Integer Programming
File in questo prodotto:
File Dimensione Formato  
GreenVRP_BMPP_CTW_ENDM.pdf

accesso aperto

Descrizione: Articolo_principale
: Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione 79.33 kB
Formato Adobe PDF
79.33 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11311/1005189
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 20
  • ???jsp.display-item.citation.isi??? ND
social impact