1 Ocak 2015 Dergi makalesi Açık Erişim

Arslan, Okan; Yildiz, Baris; Karasan, Oya Ekin

Dublin Core

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:creator>Arslan, Okan</dc:creator>
  <dc:creator>Yildiz, Baris</dc:creator>
  <dc:creator>Karasan, Oya Ekin</dc:creator>
  <dc:date>2015-01-01</dc:date>
  <dc:description>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.</dc:description>
  <dc:identifier>https://aperta.ulakbim.gov.trrecord/81993</dc:identifier>
  <dc:identifier>oai:zenodo.org:81993</dc:identifier>
  <dc:rights>info:eu-repo/semantics/openAccess</dc:rights>
  <dc:rights>http://www.opendefinition.org/licenses/cc-by</dc:rights>
  <dc:source>TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 80 123-141</dc:source>
  <dc:title>Minimum cost path problem for Plug-in Hybrid Electric Vehicles</dc:title>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>publication-article</dc:type>
</oai_dc:dc>