.png){kind=icon}
返回
Network flow problems with electric vehicles
.png){kind=icon}
PRE
AI
DOI：10.1007/s10107-025-02295-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article, we introduce new models and algorithms that extend the classical network flow problems to the setting with electric vehicles (EV) that accommodate EV-specific constraints such as range limitations, charging strategies, and station capacities. Our work focuses on solving three key problems: single EV optimal charging strategy, maximum EV flow, and minimum-cost EV flow, each central to the efficient operation of EV routing systems. We establish the computational complexity of these problems, demonstrating their NP-hardness in general settings, while also identifying precise conditions under which they become polynomial-time solvable. For these tractable cases, we develop exact algorithms, and for the general settings, we design fully polynomial-time approximation schemes (FPTAS). We conduct numerical experiments using a network calibrated with real-world data. Although the conditions for polynomial time solvability do not hold in this setting, our algorithm still computes the optimal solution, which demonstrates its scalability and practical relevance.
Keyword:
Electric vehicle routing
Network flow algorithms
Charge-augmented networks
期刊
M
IF:
2.5
论文数:
85
被引数:
0
机构
引用论文
.png){kind=icon}
分享收藏Branch-Price-and-Cut for the Electric Vehicle Routing Problem with Heterogeneous Recharging Technologies and Nonlinear Recharging Functions分支-定价-割算法用于具有异构充电技术和非线性充电函数的电动汽车路径问题
PREAI
分享收藏分享收藏Energy Consumption and Cost Savings of Truck Electrification for Heavy-Duty Vehicle Applications
OAAI
OAAI分享收藏Battery degradation and behaviour for electric vehicles: Review and numerical analyses of several models电动汽车的电池退化和行为: 几种模型的回顾和数值分析
PREAI
分享收藏
查看更多内容