Home /Research /Electric Vehicle Routing Problem with Time Windows and Station-based or Route-based Charging Options
OTHER

Electric Vehicle Routing Problem with Time Windows and Station-based or Route-based Charging Options

Tran Trung Duc, Vu Duc Minh, Nguyen Ngoc Doanh, Pham Gia Nguyen, Laurent El Ghaoui, Ha Minh Hoang

Year
2025
Access
Open access

Abstract

The Electric Vehicle Routing Problem with Time Windows and Station-based or Route-based Charging Options addresses fleet optimization incorporating both conventional charging stations and continuous wireless charging infrastructure. This paper extends Schneider et al.'s foundational EVRP-TW model with arc-based dynamic wireless charging representation, partial coverage modeling, and hierarchical multi-objective optimization prioritizing fleet minimization. Computational experiments on Schneider benchmark instances demonstrate substantial operational benefits, with distance and time improvements ranging from 0.7% to 35.9% in secondary objective components. Analysis reveals that 20% wireless coverage achieves immediate benefits, while 60% coverage delivers optimal performance across all test instances for infrastructure investment decisions.

Keywords

eess.SY

Related papers

Browse all OTHER papers