Minimum cost path problem for Plug-in Hybrid Electric Vehicles
Barış Yıldız and
Oya Ekin Karaşan
Transportation Research Part E: Logistics and Transportation Review, 2015, vol. 80, issue C, 123-141
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.
Keywords: Dynamic programming; Integer programming; Routing; Long-distance trips; Energy management (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations View citations in EconPapers (2) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:80:y:2015:i:c:p:123-141
Ordering information: This journal article can be ordered from
http://www.elsevier. ... 600244/bibliographic
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Series data maintained by Dana Niculescu ().