A new rich heterogeneous electric fleet routing problem is modeled and solved.
A new benchmark set with bounds computed using a branch-and-price solver is provided.
A hybrid Adaptive Large Neighbourhood Search is proposed for larger instances.
A sophisticated, constant time move evaluation process is described.