A spatiotemporal clustering method for mobile energy storage routing and vehicle-to-grid

IF 17 1区 工程技术 Q1 ENERGY & FUELS
Xinjiang Chen , Jiayang Yao , Guannan He
{"title":"A spatiotemporal clustering method for mobile energy storage routing and vehicle-to-grid","authors":"Xinjiang Chen ,&nbsp;Jiayang Yao ,&nbsp;Guannan He","doi":"10.1016/j.etran.2025.100478","DOIUrl":null,"url":null,"abstract":"<div><div>Mobile Energy Storage (MES) has proven effective in integrating renewable energy and alleviating grid congestion due to its flexible deployment. However, in MES routing and Vehicle-to-Grid applications (such as energy arbitrage), the large-scale routing problem involving multiple vehicles and nodes encompasses high-dimensional spatiotemporal decision variables, making it challenging for general commercial solvers to solve efficiently. To address this challenge, we develop an improved time–space network-based model that uses feasible spatiotemporal arcs to represent the routing schemes for MES throughout the entire scheduling period. Furthermore, we propose an adaptive spatiotemporal clustering algorithm based on time–space network aggregation-split to solve the model quickly. In the aggregation phase, given the lower bound of cluster quantities, nodes with closely related spatiotemporal distances are clustered into one representative node. During the split phase, we design a spatiotemporal envelope method to identify nodes with potential arbitrage opportunities in each cluster and classify them into a separate cluster. We apply the proposed model and algorithm to the energy arbitrage of MES within the California power grid. The results reveal that, compared to the commercial solver, the proposed algorithm significantly reduces the average time overhead by 92.7%, while only sacrificing 0.9% in optimality in more than 300 daily scheduling cases.</div></div>","PeriodicalId":36355,"journal":{"name":"Etransportation","volume":"26 ","pages":"Article 100478"},"PeriodicalIF":17.0000,"publicationDate":"2025-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Etransportation","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590116825000852","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENERGY & FUELS","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile Energy Storage (MES) has proven effective in integrating renewable energy and alleviating grid congestion due to its flexible deployment. However, in MES routing and Vehicle-to-Grid applications (such as energy arbitrage), the large-scale routing problem involving multiple vehicles and nodes encompasses high-dimensional spatiotemporal decision variables, making it challenging for general commercial solvers to solve efficiently. To address this challenge, we develop an improved time–space network-based model that uses feasible spatiotemporal arcs to represent the routing schemes for MES throughout the entire scheduling period. Furthermore, we propose an adaptive spatiotemporal clustering algorithm based on time–space network aggregation-split to solve the model quickly. In the aggregation phase, given the lower bound of cluster quantities, nodes with closely related spatiotemporal distances are clustered into one representative node. During the split phase, we design a spatiotemporal envelope method to identify nodes with potential arbitrage opportunities in each cluster and classify them into a separate cluster. We apply the proposed model and algorithm to the energy arbitrage of MES within the California power grid. The results reveal that, compared to the commercial solver, the proposed algorithm significantly reduces the average time overhead by 92.7%, while only sacrificing 0.9% in optimality in more than 300 daily scheduling cases.
移动储能路径和车到网的时空聚类方法
移动储能系统由于其灵活的部署,在整合可再生能源和缓解电网拥堵方面已被证明是有效的。然而,在MES路由和车辆到电网应用(如能源套利)中,涉及多个车辆和节点的大规模路由问题包含高维时空决策变量,使得一般商业求解者难以有效解决。为了解决这一挑战,我们开发了一种改进的基于时空网络的模型,该模型使用可行的时空弧线来表示MES在整个调度期间的路由方案。在此基础上,提出了一种基于时空网络聚合-分裂的自适应时空聚类算法来快速求解该模型。在聚集阶段,给定聚类数量的下界,将时空距离密切相关的节点聚为一个代表性节点。在分割阶段,我们设计了一种时空包络方法来识别每个集群中具有潜在套利机会的节点,并将其分类到一个单独的集群中。我们将所提出的模型和算法应用于加州电网MES的能源套利。结果表明,与商业求解器相比,该算法在300多个日常调度案例中,平均时间开销显著降低92.7%,而最优性仅牺牲0.9%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Etransportation
Etransportation Engineering-Automotive Engineering
CiteScore
19.80
自引率
12.60%
发文量
57
审稿时长
39 days
期刊介绍: eTransportation is a scholarly journal that aims to advance knowledge in the field of electric transportation. It focuses on all modes of transportation that utilize electricity as their primary source of energy, including electric vehicles, trains, ships, and aircraft. The journal covers all stages of research, development, and testing of new technologies, systems, and devices related to electrical transportation. The journal welcomes the use of simulation and analysis tools at the system, transport, or device level. Its primary emphasis is on the study of the electrical and electronic aspects of transportation systems. However, it also considers research on mechanical parts or subsystems of vehicles if there is a clear interaction with electrical or electronic equipment. Please note that this journal excludes other aspects such as sociological, political, regulatory, or environmental factors from its scope.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信