A Multi-Strategy Improved Ant Colony Optimization Algorithm for the Electric Vehicle Routing Problem with Time Windows and En-Route Recharging
With the continued electrification and digitalization of urban logistics, electric freight routing increasingly requires the coordinated consideration of customer time windows, vehicle capacity, limited battery range, and en-route charging. This study formulates an electric vehicle routing problem with time windows (EVRPTW) for smart-city electric freight and develops a multi-strategy improved ant colony optimization algorithm (IACO). The proposed model integrates customer service, route continuity, time windows, vehicle capacity, battery-energy propagation, and en-route charging. IACO combines a route–charging-state representation with feasibility-guided sweep-insertion initialization, max–min pheromone control, multi-representative guidance, reachable charging-station insertion, greedy feasibility repair, and 2-opt local search, forming a multi-stage search process that integrates global exploration, feasibility restoration, and local intensification. Computational experiments on an R-C benchmark scenario with 51 customers and 9 charging stations compare IACO with ACO, GA, TS, LNS, SA, PSO, and WOA over 100 independent runs under a common 300-iteration limit. Under the current experimental protocol, IACO records a representative generalized cost of 570.88, with reductions of 7.75–44.65% relative to the seven comparison methods, while its median CPU time is 28.42 s. These results demonstrate a clear solution-quality–computation trade-off and indicate the potential of IACO for plan-level electric freight routing and en-route charging coordination.