No abstract

No abstract

No abstract

No 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.