A Path-based exact solution approach for the Green Vehicle Routing Problem Maurizio Bruglieri Dipartimento di Design, Politecnico di Milano Simona Mancini ∗ Dipartimento di Matematica e Informatica, Universit´a di Cagliari Ferdinando Pezzella Dipartimento di Ingegneria dell’Informazione, Universit´ a Politecnica delle Marche Ornella Pisacane Dipartimento di Ingegneria dell’Informazione, Universit´ a Politecnica delle Marche Abstract The Green Vehicle Routing Problem aims routing Alternative Fuel Vehicles, based at a depot, minimizing the total travel distance. Each vehicle handles a subset of customers, leaving from and returning to the depot, respecting a maximum duration and a distance traveled without refuels. We propose a two phases exact approach, composing each route through two/more paths. Each path serves a subset of customers without intermediate refuels. Dominance rules limit the number of feasible paths. Our approach, tested on benchmark instances, strongly outperforms the existing exact methods and it can be generalized to solve other VRP with Intermediate Stops. Keywords: Vehicle Routing Problem, Alternative FuelVehicles, Dominance rules, Mixed Integer LinearProgramming formulation * Corresponding author Email address: simona.mancini@unica.it, simona.mancini@polito.it (Simona Mancini) Preprint submitted to Computers & Operations Research August 10, 2017