This work presents a new variant of the Green Vehicle Routing Problem with time windows. We propose an iterative local search heuristic to optimize the routing of a mixed vehicle fleet, composed of electric and conventional (internal combustion engine) vehicles. Since the batteries of electric vehicles have a limited autonomy of the battery, we consider the possibility of recharging partially at any of the available stations. In addition, we explicitly take into account a limitation on the polluting emissions for the conventional vehicles. The behaviour of the proposed approach is evaluated empirically on a large set of test instances.
The green mixed fleet vehicle routing problem with partial battery recharging and time windows
Di Puglia Pugliese Luigi;
2019
Abstract
This work presents a new variant of the Green Vehicle Routing Problem with time windows. We propose an iterative local search heuristic to optimize the routing of a mixed vehicle fleet, composed of electric and conventional (internal combustion engine) vehicles. Since the batteries of electric vehicles have a limited autonomy of the battery, we consider the possibility of recharging partially at any of the available stations. In addition, we explicitly take into account a limitation on the polluting emissions for the conventional vehicles. The behaviour of the proposed approach is evaluated empirically on a large set of test instances.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
