We investigate a specific version of the Green Vehicle Routing Problem, in which we assume the availability of a mixed vehicle fleet composed of electrical and conventional (internal combustion engine) vehicles. These are typically light- and medium-duty vehicles. We allow partial battery recharging at any of the available stations. In addition, we use a comprehensive energy consumption model which can take into account speed, acceleration, deceleration, load cargo and gradients. We propose a matheuristic embedded within a large neighborhood search scheme. In a numerical study we evaluate the performance of the proposed approach.
An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
Di Puglia Pugliese Luigi
2019
Abstract
We investigate a specific version of the Green Vehicle Routing Problem, in which we assume the availability of a mixed vehicle fleet composed of electrical and conventional (internal combustion engine) vehicles. These are typically light- and medium-duty vehicles. We allow partial battery recharging at any of the available stations. In addition, we use a comprehensive energy consumption model which can take into account speed, acceleration, deceleration, load cargo and gradients. We propose a matheuristic embedded within a large neighborhood search scheme. In a numerical study we evaluate the performance of the proposed approach.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.