File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.trb.2016.02.002
- Scopus: eid_2-s2.0-84959044446
- WOS: WOS:000375505500010
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The electric vehicle touring problem
Title | The electric vehicle touring problem |
---|---|
Authors | |
Keywords | Vehicle routing Shortest path Battery swap Electric vehicle Approximation algorithm Traveling salesman problem |
Issue Date | 2016 |
Citation | Transportation Research Part B: Methodological, 2016, v. 86, p. 163-180 How to Cite? |
Abstract | © 2016. Published by Elsevier Ltd. The increasing concern over global warming has led to the rapid development of the electric vehicle industry. Electric vehicles (EVs) have the potential to reduce the greenhouse effect and facilitate more efficient use of energy resources. In this paper, we study several EV route planning problems that take into consideration possible battery charging or swapping operations. Given a road network, the objective is to determine the shortest (travel time) route that a vehicle with a given battery capacity can take to travel between a pair of vertices or to visit a set of vertices with several stops, if necessary, at battery switch stations. We present polynomial time algorithms for the EV shortest travel time path problem and the fixed tour EV touring problem, where the fixed tour problem requires visiting a set of vertices in a given order. Based on the result, we also propose constant factor approximation algorithms for the EV touring problem, which is a generalization of the traveling salesman problem. |
Persistent Identifier | http://hdl.handle.net/10722/296120 |
ISSN | 2023 Impact Factor: 5.8 2023 SCImago Journal Rankings: 2.660 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Liao, Chung Shou | - |
dc.contributor.author | Lu, Shang Hung | - |
dc.contributor.author | Shen, Zuo Jun Max | - |
dc.date.accessioned | 2021-02-11T04:52:52Z | - |
dc.date.available | 2021-02-11T04:52:52Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Transportation Research Part B: Methodological, 2016, v. 86, p. 163-180 | - |
dc.identifier.issn | 0191-2615 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296120 | - |
dc.description.abstract | © 2016. Published by Elsevier Ltd. The increasing concern over global warming has led to the rapid development of the electric vehicle industry. Electric vehicles (EVs) have the potential to reduce the greenhouse effect and facilitate more efficient use of energy resources. In this paper, we study several EV route planning problems that take into consideration possible battery charging or swapping operations. Given a road network, the objective is to determine the shortest (travel time) route that a vehicle with a given battery capacity can take to travel between a pair of vertices or to visit a set of vertices with several stops, if necessary, at battery switch stations. We present polynomial time algorithms for the EV shortest travel time path problem and the fixed tour EV touring problem, where the fixed tour problem requires visiting a set of vertices in a given order. Based on the result, we also propose constant factor approximation algorithms for the EV touring problem, which is a generalization of the traveling salesman problem. | - |
dc.language | eng | - |
dc.relation.ispartof | Transportation Research Part B: Methodological | - |
dc.subject | Vehicle routing | - |
dc.subject | Shortest path | - |
dc.subject | Battery swap | - |
dc.subject | Electric vehicle | - |
dc.subject | Approximation algorithm | - |
dc.subject | Traveling salesman problem | - |
dc.title | The electric vehicle touring problem | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.trb.2016.02.002 | - |
dc.identifier.scopus | eid_2-s2.0-84959044446 | - |
dc.identifier.volume | 86 | - |
dc.identifier.spage | 163 | - |
dc.identifier.epage | 180 | - |
dc.identifier.isi | WOS:000375505500010 | - |
dc.identifier.issnl | 0191-2615 | - |