A Simulated Annealing Approach for Electric Vehicle Routing with Time Windows

Emerging economies face mounting pressure to adopt sustainable and cost-efficient methods for delivering products and services in urban areas. This study examines the Electric Vehicle Routing Problem with Time Windows (EVRPTW) within a pragmatic urban context. We concentrate on the short-haul delivery network in Marrakesh, Morocco, whose operational viability is influenced by climatic, infrastructural, and regulatory limitations. We present a simulated annealing (SA) metaheuristic, augmented with repair heuristics and a penalty-based cost function, to concurrently reduce routing costs and lateness fines, subject to time-window and battery capacity restrictions. The technique undergoes evaluation through extensive computer tests utilizing realistic instance sets that replicate local demand patterns and charging infrastructure. The penalty-calibrated model demonstrates delivery completion rates of up to 100%, significantly reducing route costs and the number of unserved clients relative to baseline setups. We thoroughly analyze the tuning parameters among several runs. This study intends to provide a useful tool for real-world decision support by fusing extensive literature synthesis with local context validation and by integrating a simulation module that evaluates time-window settings and charging patterns under realistic traffic.