The Electric Vehicle Shortest-Walk Problem With Battery Exchanges
The Electric Vehicle Shortest-Walk Problem With Battery Exchanges
复制标题
DOI：
10.1007/s11067-013-9221-7
复制
发表时间：
2016-03
影响因子：
2.4
通讯作者：
Jonathan D. Adler;P. Mirchandani;G. Xue;Minjun Xia
中科院分区：
文献类型：
--
作者：
Jonathan D. Adler;P. Mirchandani;G. Xue;Minjun Xia
在过去的几年里，电动汽车（EV）受到了广泛的关注。然而，它们既没有被通勤者广泛接受，也没有被拥有服务车队的机构广泛接受。主要是充电基础设施的缺乏阻碍了电动汽车的大规模采用。使用电动汽车的问题在长途旅行或城际旅行中尤为明显。里程焦虑，即驾驶者担心车辆在到达目的地之前电量耗尽，是电动汽车市场渗透的主要障碍。要发展充电基础设施，在电池充电/交换设施很少的情况下，将车辆从起点引导到目的地，尽量减少绕路是很重要的。本文定义了电动汽车最短步行问题，以确定从起点到目的地的路径，绕行最少；这条路线可能包括绕道充电的周期。研究了两种问题场景：一种是在任意次数的电池充电/交换站的情况下，从起点到目的地的行驶距离最小的问题。另一种是在规定了最大停靠次数的情况下从出发地到目的地旅行。证明了这两个问题都是多项式可解的，并给出了求解算法。本文还提出了另一个新问题，即寻找使该路线引起的最大焦虑最小化的路线。
Electric vehicles (EV) have received much attention in the last few years. Still, they have neither been widely accepted by commuters nor by organizations with service fleets. It is predominately the lack of recharging infrastructure that is inhibiting a wide-scale adoption of EVs. The problem of using EVs is especially apparent in long trips, or inter-city trips.Range anxiety, when the driver is concerned that the vehicle will run out of charge before reaching the destination, is a major hindrance for the market penetration of EVs. To develop a recharging infrastructure it is important to route vehicles from origins to destinations with minimum detouring when battery recharging/exchange facilities are few and far between. This paper defines theEV shortest-walk problemto determine the route from a starting point to a destination with minimum detouring; this route may include cycles for detouring to recharge batteries. Two problem scenarios are studied: one is the problem of traveling from an origin to a destination to minimize the travel distance when any number of battery recharge/exchange stops may be made. The other is to travel from origin to destination when a maximum number of stops is specified. It is shown that both of these problems are polynomially solvable and solution algorithms are provided. This paper also presents another new problem of finding the route that minimizes the maximum anxiety induced by the route.