Routing and charging locations for electric vehicles for intercity trips

Hong Zheng and Srinivas Peeta

Transportation Planning and Technology, 2017, vol. 40, issue 4, 393-419

Abstract: This study addresses two problems in the context of battery electric vehicles (EVs) for intercity trips: the EV routing problem and the EV optimal charging station location problem (CSLP). The paper shows that EV routing on the shortest path subject to range feasibility for one origin–destination (O–D) pair, called the shortest walk problem (SWP), as well as a stronger version of the problem – the p-stop limited SWP – can be reduced to solving the shortest path problem on an auxiliary network. The paper then addresses optimal CSLPs in which EVs are range feasible with and without p-stops. We formulate the models as mixed-integer multi-commodity flow problems on the same auxiliary network without path and relay pattern enumeration. Benders decomposition is used to propose an exact solution approach. Numerical experiments are conducted using the Indiana state network.

Date: 2017
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://hdl.handle.net/10.1080/03081060.2017.1300245 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:transp:v:40:y:2017:i:4:p:393-419

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/GTPT20

DOI: 10.1080/03081060.2017.1300245

Access Statistics for this article

Transportation Planning and Technology is currently edited by Dr. David Gillingwater

More articles in Transportation Planning and Technology from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().