This article presents our adaptation of the Ruin-and-Recreate (R&R) algorithm to solve the electric vehicle routing problem with time windows and multiple trips. We implement this adaptation in JSprit, an open-source vehicle routing problem solver. We showcase the framework for a case study in Lyon, France. In the case study, we assess the efficiency impact of adding charging constraints to a simulation of a fleet of autonomous delivery robots. The framework is tested on benchmark instances and compared with results from literature.