The EVRP-TW with heterogeneous recharging stations. An exact branch-and-price method

Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations with different technologies during the course of a route. In this thesis, I consider three variants of the electric vehicle-routing problem with hard time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on visit of a recharging station; (ii) multiple recharges per route, full recharges only and (iii) at most a single recharge per route, and partial battery recharges are possible. For each variant, I present exact branch-price-and-cut algorithms that rely on customized monodirectional forward labeling algorithms for generating feasible vehicle routes. The main point of the implemented algorithms are the tailored resource extension functions (REFs) that enable efficient labeling with constant time feasibility checking and strong dominance rules, even if these REFs are intricate and rather elaborate to derive.

instradamento intelligente per veicoli elettrici tramite uso di generazione di colonna. per maggior informazioni guardare abstract in inglese