Abstract

Research on the range anxiety of battery electric vehicle (BEV) drivers is limited, and research on the route choice of such drivers has been restricted to a fixed range limit modeled as a distance constrained shortest path problem. In this paper, a more general network route choice model based on the range anxiety of BEV drivers is formulated as a nonadditive shortest path problem. More appropriate for BEVs, a tour-based analysis with a continuum of range limits is considered, and an outer approximation algorithm has been used to find the optimal path. Numerical experiments on a small network demonstrate how the routes taken by BEV drivers are influenced by their risk attitudes and uncertainty in the predicted range of the vehicle.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.