TY - JOUR
T1 - Optimal recharging policies for electric vehicles
AU - Sweda, Timothy M.
AU - Dolinskaya, Irina S.
AU - Klabjan, Diego
N1 - Publisher Copyright:
© 2016 INFORMS.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017
Y1 - 2017
N2 - Recharging decisions for electric vehicles require many special considerations because of battery dynamics. Battery longevity is prolonged by recharging less frequently and at slower rates, and also by not charging the battery too close to its maximum capacity. In this paper, we address the problem of finding an optimal recharging policy for an electric vehicle along a given path. The path consists of a sequence of nodes, each representing a charging station, and the driver must decide where to stop and how much to recharge at each stop. We present efficient algorithms for finding an optimal policy in general instances with deterministic travel costs and homogeneous charging stations, and also for two specialized cases - one where the vehicle can stop anywhere along the path to recharge and another with equidistant charging stations along the path. In addition, we develop two heuristic procedures that we characterize analytically and explore empirically. We further analyze and test our solution methods on model variations that include stochastic travel costs and nonhomogeneous charging stations.
AB - Recharging decisions for electric vehicles require many special considerations because of battery dynamics. Battery longevity is prolonged by recharging less frequently and at slower rates, and also by not charging the battery too close to its maximum capacity. In this paper, we address the problem of finding an optimal recharging policy for an electric vehicle along a given path. The path consists of a sequence of nodes, each representing a charging station, and the driver must decide where to stop and how much to recharge at each stop. We present efficient algorithms for finding an optimal policy in general instances with deterministic travel costs and homogeneous charging stations, and also for two specialized cases - one where the vehicle can stop anywhere along the path to recharge and another with equidistant charging stations along the path. In addition, we develop two heuristic procedures that we characterize analytically and explore empirically. We further analyze and test our solution methods on model variations that include stochastic travel costs and nonhomogeneous charging stations.
KW - Convex ordering cost
KW - Electric vehicles
KW - Lot sizing
KW - Optimal recharging policies
UR - http://www.scopus.com/inward/record.url?scp=85019773605&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85019773605&partnerID=8YFLogxK
U2 - 10.1287/trsc.2015.0638
DO - 10.1287/trsc.2015.0638
M3 - Article
AN - SCOPUS:85019773605
VL - 51
SP - 457
EP - 459
JO - Transportation Science
JF - Transportation Science
SN - 0041-1655
IS - 2
ER -