4.7 Article

A Multi-Objective Optimization Framework for Electric Vehicle Charge Scheduling With Adaptable Charging Ports

期刊

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY
卷 72, 期 5, 页码 5702-5714

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TVT.2022.3231901

关键词

Charging stations; Costs; Customer satisfaction; Scheduling; Approximation algorithms; Pricing; Processor scheduling; Adaptable ports; electric vehicles; scheduling

向作者/读者索取更多资源

The problem of charge scheduling of Electric Vehicles (EVs) at charging stations remains a significant challenge due to long charging time and insufficient charging infrastructure. In this study, we propose an efficient EV charge scheduling plan for a charging station equipped with adaptable charging ports, aiming to improve performance and maximize profit and customer satisfaction.
The problem of charge scheduling of Electric Vehicles (EVs) at charging stations remains one of the significant challenges due to high charging time and insufficient charging infrastructure leading to unfulfilled demands. Moreover, most public charging stations (CSs) are equipped with charging ports that serve only a fixed charging rate. The installation of adaptable ports, that can vary their rate of charging with time, has been observed to alleviate these challenges. Hence, we propose an efficient EV charge scheduling plan, for a CS equipped with adaptable charging ports, to improve its performance. The CS aims at maximizing not only its profit but also its total customer satisfaction. Also, it is assumed that, upon being unable to fulfill their total energy demands, the CS pays an incentive to the EV owners. Such incentives reduce the profit margins of the CSs. Hence, we formulate a bi-objective optimization EV scheduling model that drives the CSs toward maximizing their profit and customer satisfaction. Satisfiability Modulo Theory (SMT) solver and Non-dominated Sorting Genetic Algorithm-II (NSGA-II) evolutionary algorithm are used to obtain the optimal and approximate Pareto fronts respectively. We further propose a charging action replacement-based heuristic approach to speed up the process of obtaining an approximate set of non-dominated solutions. We run several simulations and observe that the proposed algorithm results in a near-optimal set of solutions compared to the actual Pareto front with a much less computation time.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据