Dergi makalesi Açık Erişim
Arslan, Okan; Yildiz, Baris; Karasan, Oya Ekin
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.
| Dosya adı | Boyutu | |
|---|---|---|
|
bib-85da378e-46ed-419d-bf66-ea88ddca9344.txt
md5:265c622b3b0f6cf8c8cc69bbaecd8dab |
195 Bytes | İndir |
| Görüntülenme | 55 |
| İndirme | 10 |
| Veri hacmi | 1.9 kB |
| Tekil görüntülenme | 52 |
| Tekil indirme | 10 |