Journal article Open Access

Multi-depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period

Dávid Balázs; Krész Miklós


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">Bus scheduling</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">parking</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">maintenance</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">long-term planning</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">public transportation</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">assignment</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">integer programming</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">network flow</subfield>
  </datafield>
  <controlfield tag="005">20190409141811.0</controlfield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">The authors acknowledge the support of the Dél-alföldi Közlekedésfejlesztési
Klaszter, and the National Research, Development and Innovation Office NKFIH
Fund No. [SNN-117879].
EU-funded Hungarian grant [EFOP-3.6.2-16-2017-00015].</subfield>
  </datafield>
  <controlfield tag="001">1436354</controlfield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Innorenew CoE; University of Szeged</subfield>
    <subfield code="0">(orcid)0000-0002-7547-1128</subfield>
    <subfield code="a">Krész Miklós</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">1537926</subfield>
    <subfield code="z">md5:6faac1a483f815fc4b7e9b53eff22364</subfield>
    <subfield code="u">https://zenodo.org/record/1436354/files/Multi depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2018-09-10</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">openaire</subfield>
    <subfield code="p">user-innorenew</subfield>
    <subfield code="o">oai:zenodo.org:1436354</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Innorenew CoE; University of Szeged</subfield>
    <subfield code="0">(orcid)0000-0003-4414-4797</subfield>
    <subfield code="a">Dávid Balázs</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Multi-depot bus schedule assignment with parking and maintenance constraints for intercity transportation over a planning period</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-innorenew</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">739574</subfield>
    <subfield code="a">Renewable materials and healthy environments research and innovation centre of excellence</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">http://creativecommons.org/licenses/by/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;This article introduces the schedule assignment problem for public transit, which aims to assign vehicle blocks of a planning period to buses in the fleet of a transportation company. This assignment has to satisfy several constraints, the most important of which is compatibility, meaning that certain blocks can only be serviced by buses belonging to given types. Other constraints come from the fact that the problem considers a long-term plan for several days or weeks, which means that daily parking and periodic maintenance activities also have to be taken into account. We give a state-expanded multi-commodity flow network for the above problem. This model takes parking constraints into account, and also assigns preventive maintenance tasks to buses after serving blocks for a fixed amount of time. The solutions of this model are presented for real-life and randomly generated instances.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1080/19427867.2018.1512216</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
</record>
64
70
views
downloads
Views 64
Downloads 70
Data volume 107.7 MB
Unique views 55
Unique downloads 64

Share

Cite as