Abstract

This paper investigates the online station assignment for (commercial) electric vehicles (EVs) that make battery swapping requests to a central operator, with the aim of minimizing cost to EVs and congestion at service stations. Inspired by a polynomial-time solvable offline solution via a bipartite matching approach, we develop an efficient online station assignment algorithm that provably achieves a tight (optimal) competitive ratio under mild conditions.

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.