Abstract
Vehicle scheduling problem (VSP) has been studied since mid-90s, and yet the emerging electrification technology adoption requires a revisit to the problem since recharging event schedules need to be planned. The single depot electric vehicle scheduling problem (SDEVSP) is NP-hard, and large-scale instances cannot be solved to optimality in reasonable time. Hence, a heuristic solution approach was developed to address the problem. In this approach, we generate short tours that can be served by an electric vehicle (EV) and use a mixed-integer non-linear program to combine tour tuples that maximize EV utilization. The model was demonstrated on a hypothetical case study using a depot of the Chicago Transit Authority.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
