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

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

DataCite XML

<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://datacite.org/schema/kernel-4" xsi:schemaLocation="http://datacite.org/schema/kernel-4 http://schema.datacite.org/meta/kernel-4.1/metadata.xsd">
  <identifier identifierType="URL">https://aperta.ulakbim.gov.tr/record/81993</identifier>
  <creators>
    <creator>
      <creatorName>Arslan, Okan</creatorName>
      <givenName>Okan</givenName>
      <familyName>Arslan</familyName>
      <affiliation>Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Yildiz, Baris</creatorName>
      <givenName>Baris</givenName>
      <familyName>Yildiz</familyName>
      <affiliation>Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
    <creator>
      <creatorName>Karasan, Oya Ekin</creatorName>
      <givenName>Oya Ekin</givenName>
      <familyName>Karasan</familyName>
      <affiliation>Bilkent Univ, Dept Ind Engn, TR-06800 Ankara, Turkey</affiliation>
    </creator>
  </creators>
  <titles>
    <title>Minimum Cost Path Problem For Plug-In Hybrid Electric Vehicles</title>
  </titles>
  <publisher>Aperta</publisher>
  <publicationYear>2015</publicationYear>
  <dates>
    <date dateType="Issued">2015-01-01</date>
  </dates>
  <resourceType resourceTypeGeneral="Text">Journal article</resourceType>
  <alternateIdentifiers>
    <alternateIdentifier alternateIdentifierType="url">https://aperta.ulakbim.gov.tr/record/81993</alternateIdentifier>
  </alternateIdentifiers>
  <relatedIdentifiers>
    <relatedIdentifier relatedIdentifierType="DOI" relationType="IsIdenticalTo">10.1016/j.tre.2015.05.011</relatedIdentifier>
  </relatedIdentifiers>
  <rightsList>
    <rights rightsURI="http://www.opendefinition.org/licenses/cc-by">Creative Commons Attribution</rights>
    <rights rightsURI="info:eu-repo/semantics/openAccess">Open Access</rights>
  </rightsList>
  <descriptions>
    <description descriptionType="Abstract">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.</description>
  </descriptions>
</resource>