Abstract

The rapid shift from internal combustion engine vehicles to battery-powered electric vehicles (EVs) presents considerable challenges, such as limited charging points (CPs), unpredictable wait times for charging, and difficulty in selecting appropriate CPs for EVs. To address these challenges, we propose a novel end-to-end framework, called Stable Matching based EV Charging Assignment (SMEVCA) that efficiently assigns charge-seeking EVs to CPs with the assistance of roadside units (RSUs). The proposed framework operates within a subscription-based model, ensuring that the subscribed EVs complete their charging within a predefined time limit enforced by a service level agreement (SLA). The framework SMEVCA employs a stable, fast, and efficient EV-CP assignment formulated as a one-to-many matching game with preferences. The matching process identifies the preferred coalition (a subset of EVs assigned to the CPs) using two strategies: (1) Preferred Coalition Greedy (PCG) that offers an efficient, locally optimal heuristic solution; and (2) Preferred Coalition Dynamic (PCD) that is more computation-intensive but delivers a globally optimal coalition. Extensive simulations reveal that PCG and PCD achieve a gain of 14.6% and 20.8% over random elimination for in-network charge transferred with only 3% and 0.1% EVs unserved within the RSUs vicinity.

Department(s)

Computer Science

Publication Status

Open Access

Comments

National Science Foundation, Grant OAC-2104078

Keywords and Phrases

Charge Point Assignment; Dynamic Programming; EVs; Greedy; Matching Theory; Subscription Model

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2025 Association for Computing Machinery, All rights reserved.

Publication Date

04 Jan 2025

Download

Full Text Link

Share

 
COinS