Minimum cost path problem for Plug-in Hybrid Electric Vehicles

被引：52

作者：

Arslan, Okan ^{[1
]}

Yildiz, Baris ^{[1
]}

Karasan, Oya Ekin ^{[1
]}

机构：

[1] Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2015年 / 80卷

关键词：

Dynamic programming; Integer programming; Routing; Long-distance trips; Energy management; DECISION-SUPPORT-SYSTEM; ROUTING PROBLEM; TIME WINDOWS; FUEL; LOCATION; MODEL; STATIONS; IMPACTS; BUYERS; CAR;

D O I：

10.1016/j.tre.2015.05.011

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

We introduce a practically important and theoretically challenging problem: finding the minimum cost path for PHEVs in a road network with refueling and charging stations. We show that this problem is NP-complete and present a mixed integer quadratically constrained formulation, a discrete approximation dynamic programming heuristic, and a shortest path heuristic as solution methodologies. Practical applications of the problem in transportation and logistics, considering specifically the long-distance trips, are discussed in detail. Through extensive computational experiments, significant insights are provided. In addition to the charging infrastructure availability, a driver's stopping tolerance arises as another critical factor affecting the transportation costs. (C) 2015 Elsevier Ltd. All rights reserved.

引用

页码：123 / 141

页数：19

共 89 条

[41]

Kuby M., 2005, Socio-Economic Planning Sci., V39, P125, DOI 10.1016/j.seps.2004.03.001

[42] Minimum cost path problems with relays [J].