SG-GAN for Electric Vehicle Road Networks and Q-Learning in Energy Efficient Routing

This paper suggests a novel routing scheme for multiple electric vehicles (EVs) on a mesh-type road network, which is generated using a Spatial Graph-Generative Adversarial Network (SG-GAN). The scheme focuses on optimizing both the routing of EVs and their association with the respective charging stations(CSs) to reduce energy consumption. The challenge lies in effectively managing factors such as travel cost, the state of charge (SoC) of the battery, and congestion in the road network. To address this problem, we propose a Reinforcement Learning (RL) based approach that minimizes energy consumption and the overall travel time for EVs to reach their destinations. A Q-learning algorithm for RL is employed to solve the nonlinear constrained optimization problems. Through simulation experiments on a road network evolved through SG-GAN, which generates realistic and complex network topologies, we address the allocation of CSs and EVs optimal routing. The results demonstrate the effectiveness of our approach compared to the existing methods, achieving a 2.68% reduction in energy consumption along with a similarity measure, on an average Kullback–Leibler (KL) distance (divergence) 0.54 in the SG-GAN generated road network from the reference real one.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Intelligent Transportation Systems
Published
2025-01-01
DOI
https://doi.org/10.1109/tits.2025.3585310
Primary Topic
Brain Tumor Detection and Classification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

SG-GAN for Electric Vehicle Road Networks and Q-Learning in Energy Efficient Routing

Santi P. Maity, Chinmay Chakraborty, Sukanta Das
IEEE Transactions on Intelligent Transportation Systems
Brain Tumor Detection and Classification
article

SG-GAN for Electric Vehicle Road Networks and Q-Learning in Energy Efficient Routing

Santi P. Maity, Chinmay Chakraborty, Sukanta Das
article en

Abstract

This paper suggests a novel routing scheme for multiple electric vehicles (EVs) on a mesh-type road network, which is generated using a Spatial Graph-Generative Adversarial Network (SG-GAN). The scheme focuses on optimizing both the routing of EVs and their association with the respective charging stations(CSs) to reduce energy consumption. The challenge lies in effectively managing factors such as travel cost, the state of charge (SoC) of the battery, and congestion in the road network. To address this problem, we propose a Reinforcement Learning (RL) based approach that minimizes energy consumption and the overall travel time for EVs to reach their destinations. A Q-learning algorithm for RL is employed to solve the nonlinear constrained optimization problems. Through simulation experiments on a road network evolved through SG-GAN, which generates realistic and complex network topologies, we address the allocation of CSs and EVs optimal routing. The results demonstrate the effectiveness of our approach compared to the existing methods, achieving a 2.68% reduction in energy consumption along with a similarity measure, on an average Kullback–Leibler (KL) distance (divergence) 0.54 in the SG-GAN generated road network from the reference real one.

IEEE Transactions on Intelligent Transportation Systems
KIIT University (IN), Indian Institute of Engineering Science and Technology, Shibpur (IN), Indian Institute of Technology Bhubaneswar (IN)
Affordable and clean energy
Openalex Percentile: Top 78%
Brain Tumor Detection and Classification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.