Online routing and battery reservations for electric vehicles with swappable batteries

Jonathan D. Adler, Pitu Mirchandani

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

Electric vehicles are becoming a more popular form of transportation, however their limited range has proven problematic. Battery-exchange stations allow the vehicles to swap batteries during their trip, but if a vehicle arrives at a station without a full battery available it may have to wait an extended period of time to get one. The vehicles can be routed so that they avoid stations without available batteries or to keep batteries available for other vehicles that need them in the future. The batteries can also be reserved during the routing process so that each vehicle is ensured the battery it plans to use is available. This paper provides a method of online routing of electric vehicles and making battery reservations that minimizes the average delay of the all vehicles by occasionally detouring them to the benefit of future ones. The system is modeled as a Markov chance-decision process and the optimal policy is approximated using the approximate dynamic programming technique of temporal differencing with linear models. The solution algorithm provides a quick way for vehicles to be routed using onboard vehicle software connected to a central computer. Computational results for the algorithm are provided using data on the Arizona highway network.

Original languageEnglish (US)
Pages (from-to)285-302
Number of pages18
JournalTransportation Research Part B: Methodological
Volume70
DOIs
StatePublished - Dec 1 2014

Fingerprint

electric vehicle
Electric vehicles
linear model
programming
Routing
Electric vehicle
Reservation
Dynamic programming
software
time
Optimal policy
Software
Decision process
Approximate dynamic programming
Swaps

Keywords

  • Approximate dynamic programming
  • Electric vehicles
  • Linear temporal differencing
  • Markov chance-decision processes
  • Vehicle routing

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Transportation

Cite this

Online routing and battery reservations for electric vehicles with swappable batteries. / Adler, Jonathan D.; Mirchandani, Pitu.

In: Transportation Research Part B: Methodological, Vol. 70, 01.12.2014, p. 285-302.

Research output: Contribution to journalArticle

@article{6329e826823f4c33a355016061c8b579,
title = "Online routing and battery reservations for electric vehicles with swappable batteries",
abstract = "Electric vehicles are becoming a more popular form of transportation, however their limited range has proven problematic. Battery-exchange stations allow the vehicles to swap batteries during their trip, but if a vehicle arrives at a station without a full battery available it may have to wait an extended period of time to get one. The vehicles can be routed so that they avoid stations without available batteries or to keep batteries available for other vehicles that need them in the future. The batteries can also be reserved during the routing process so that each vehicle is ensured the battery it plans to use is available. This paper provides a method of online routing of electric vehicles and making battery reservations that minimizes the average delay of the all vehicles by occasionally detouring them to the benefit of future ones. The system is modeled as a Markov chance-decision process and the optimal policy is approximated using the approximate dynamic programming technique of temporal differencing with linear models. The solution algorithm provides a quick way for vehicles to be routed using onboard vehicle software connected to a central computer. Computational results for the algorithm are provided using data on the Arizona highway network.",
keywords = "Approximate dynamic programming, Electric vehicles, Linear temporal differencing, Markov chance-decision processes, Vehicle routing",
author = "Adler, {Jonathan D.} and Pitu Mirchandani",
year = "2014",
month = "12",
day = "1",
doi = "10.1016/j.trb.2014.09.005",
language = "English (US)",
volume = "70",
pages = "285--302",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - Online routing and battery reservations for electric vehicles with swappable batteries

AU - Adler, Jonathan D.

AU - Mirchandani, Pitu

PY - 2014/12/1

Y1 - 2014/12/1

N2 - Electric vehicles are becoming a more popular form of transportation, however their limited range has proven problematic. Battery-exchange stations allow the vehicles to swap batteries during their trip, but if a vehicle arrives at a station without a full battery available it may have to wait an extended period of time to get one. The vehicles can be routed so that they avoid stations without available batteries or to keep batteries available for other vehicles that need them in the future. The batteries can also be reserved during the routing process so that each vehicle is ensured the battery it plans to use is available. This paper provides a method of online routing of electric vehicles and making battery reservations that minimizes the average delay of the all vehicles by occasionally detouring them to the benefit of future ones. The system is modeled as a Markov chance-decision process and the optimal policy is approximated using the approximate dynamic programming technique of temporal differencing with linear models. The solution algorithm provides a quick way for vehicles to be routed using onboard vehicle software connected to a central computer. Computational results for the algorithm are provided using data on the Arizona highway network.

AB - Electric vehicles are becoming a more popular form of transportation, however their limited range has proven problematic. Battery-exchange stations allow the vehicles to swap batteries during their trip, but if a vehicle arrives at a station without a full battery available it may have to wait an extended period of time to get one. The vehicles can be routed so that they avoid stations without available batteries or to keep batteries available for other vehicles that need them in the future. The batteries can also be reserved during the routing process so that each vehicle is ensured the battery it plans to use is available. This paper provides a method of online routing of electric vehicles and making battery reservations that minimizes the average delay of the all vehicles by occasionally detouring them to the benefit of future ones. The system is modeled as a Markov chance-decision process and the optimal policy is approximated using the approximate dynamic programming technique of temporal differencing with linear models. The solution algorithm provides a quick way for vehicles to be routed using onboard vehicle software connected to a central computer. Computational results for the algorithm are provided using data on the Arizona highway network.

KW - Approximate dynamic programming

KW - Electric vehicles

KW - Linear temporal differencing

KW - Markov chance-decision processes

KW - Vehicle routing

UR - http://www.scopus.com/inward/record.url?scp=84908665673&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908665673&partnerID=8YFLogxK

U2 - 10.1016/j.trb.2014.09.005

DO - 10.1016/j.trb.2014.09.005

M3 - Article

AN - SCOPUS:84908665673

VL - 70

SP - 285

EP - 302

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

ER -