Dergi makalesi Açık Erişim

A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows

Rastani, Sina; Catay, Bulent


MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:aperta.ulakbim.gov.tr:238668</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">Range anxiety of electric vehicles (EVs) still poses a major barrier in their adoption in the logistics operations despite the advancements in the battery technology. The need for recharging the battery during the day brings additional complexities to the operational planning of commercial EVs in last mile deliveries. The driving range of an EV may vary according to different factors including ambient temperature, weight, speed, acceleration/deceleration, and the road profile. In this study, we revisit the well-known electric vehicle routing problem with time windows by taking into account the weight of the load carried. Cargo weight may play a crucial role in the operational efficiency of the EVs since it may affect the energy consumption significantly. We first present two alternative mathematical formulations of the problem and test their performances on small-size instances that can be solved using a commercial solver. Next, we develop a matheuristic approach that integrates an optimal repair procedure in the large neighbourhood search method and validate its performance. Then, we present an extensive numerical study to investigate the influence of load on the routing decisions. Our results show that cargo weight may create substantial changes in the route plans and fleet size, and neglecting it may cause severe disruptions in service and increase the costs.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Rastani, Sina</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:5d058f75e3650fea6220e43f4a5c7311</subfield>
    <subfield code="s">184</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/238668/files/bib-b9a0263f-47d4-446e-832d-bbfaf2490a51.txt</subfield>
  </datafield>
  <controlfield tag="005">20221007101724.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2021-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s10479-021-04320-9</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">ANNALS OF OPERATIONS RESEARCH</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Catay, Bulent</subfield>
  </datafield>
  <controlfield tag="001">238668</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>
28
9
görüntülenme
indirilme
Görüntülenme 28
İndirme 9
Veri hacmi 1.7 kB
Tekil görüntülenme 28
Tekil indirme 9

Alıntı yap