The growing adoption of electric vehicles (EVs) represents both a challenge and an opportunity for sustainable logistics. While EVs reduce greenhouse gas emissions, they introduce new operational complexities related to limited battery autonomy and the uneven distribution of charging stations. In this context, the electric vehicle routing problem plays a central role in transportation planning. This thesis addresses the Min-Max Electric Vehicle Routing Problem (MEVRP), a variant of the classical Vehicle Routing Problem (VRP) that focuses on minimizing the maximum distance traveled by a vehicle in the fleet. Unlike the traditional objective of minimizing total distance, the min-max criterion ensures a more balanced distribution of routes, reducing the risk of overloading certain vehicles and contributing to longer battery lifespans.