In EDS ansehen

Minimum-delay opportunity charging scheduling for electricbuses

Gespeichert in:
Bibliographische Detailangaben
Titel: Minimum-delay opportunity charging scheduling for electricbuses
Autoren: McCabe, Dan, Ban, Xuegang (Jeff), Kulcsár, Balázs Adam, 1975
Quelle: Communications in Transportation Research. 5
Schlagwörter: Opportunity charging, Combinatorial Benders decomposition, Layover charging, Battery-electric bus, Heuristics
Beschreibung: Transit agencies that operate battery-electric buses must carefully manage fast-charging infrastructure to extend daily bus range without degrading on-time performance. To support this need, we propose a mixed-integer linear programming model to schedule opportunity charging that minimizes the amount of departure delay in all trips served by electric buses. Our novel approach directly tracks queuing at chargers in order to set and propagate departure delays. Allowing but minimizing delays makes it possible to optimize performance when delays due to traffic conditions and charging needs are inevitable, in contrast with existing methods that require charging to occur during scheduled layover time. To solve the model, we develop two algorithms based on decomposition. The first is an exact solution method based on combinatorial Benders (CB) decomposition, which avoids directly enumerating the model's logic-based “big M” constraints and their inevitable computational challenges. The second, inspired by the CB approach but more efficient, is a polynomial-time heuristic based on linear programming that we call Select–Sequence–Schedule (3S). Computational experiments on both a simple notional transit network and the real bus system of King County, Washington, USA demonstrate the performance of both methods. The 3S method appears particularly promising for creating good charging schedules quickly at real-world scale.
Dateibeschreibung: electronic
Zugangs-URL: https://research.chalmers.se/publication/548594
https://research.chalmers.se/publication/548594/file/548594_Fulltext.pdf
Datenbank: SwePub
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://research.chalmers.se/publication/548594#
    Name: EDS - SwePub (s4221598)
    Category: fullText
    Text: View record in SwePub
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=27724247&ISBN=&volume=5&issue=&date=20250101&spage=&pages=&title=Communications in Transportation Research&atitle=Minimum-delay%20opportunity%20charging%20scheduling%20for%20electricbuses&aulast=McCabe%2C%20Dan&id=DOI:10.1016/j.commtr.2025.100209
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=McCabe%20D
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsswe
DbLabel: SwePub
An: edsswe.oai.research.chalmers.se.0f1728cd.0caf.474e.b393.8d27acd5c63b
RelevancyScore: 1065
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1064.736328125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Minimum-delay opportunity charging scheduling for electricbuses
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22McCabe%2C+Dan%22">McCabe, Dan</searchLink><br /><searchLink fieldCode="AR" term="%22Ban%2C+Xuegang+%28Jeff%29%22">Ban, Xuegang (Jeff)</searchLink><br /><searchLink fieldCode="AR" term="%22Kulcsár%2C+Balázs+Adam%22">Kulcsár, Balázs Adam</searchLink>, 1975
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>Communications in Transportation Research</i>. 5
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Opportunity+charging%22">Opportunity charging</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorial+Benders+decomposition%22">Combinatorial Benders decomposition</searchLink><br /><searchLink fieldCode="DE" term="%22Layover+charging%22">Layover charging</searchLink><br /><searchLink fieldCode="DE" term="%22Battery-electric+bus%22">Battery-electric bus</searchLink><br /><searchLink fieldCode="DE" term="%22Heuristics%22">Heuristics</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Transit agencies that operate battery-electric buses must carefully manage fast-charging infrastructure to extend daily bus range without degrading on-time performance. To support this need, we propose a mixed-integer linear programming model to schedule opportunity charging that minimizes the amount of departure delay in all trips served by electric buses. Our novel approach directly tracks queuing at chargers in order to set and propagate departure delays. Allowing but minimizing delays makes it possible to optimize performance when delays due to traffic conditions and charging needs are inevitable, in contrast with existing methods that require charging to occur during scheduled layover time. To solve the model, we develop two algorithms based on decomposition. The first is an exact solution method based on combinatorial Benders (CB) decomposition, which avoids directly enumerating the model's logic-based “big M” constraints and their inevitable computational challenges. The second, inspired by the CB approach but more efficient, is a polynomial-time heuristic based on linear programming that we call Select–Sequence–Schedule (3S). Computational experiments on both a simple notional transit network and the real bus system of King County, Washington, USA demonstrate the performance of both methods. The 3S method appears particularly promising for creating good charging schedules quickly at real-world scale.
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: electronic
– Name: URL
  Label: Access URL
  Group: URL
  Data: <link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/548594" linkWindow="_blank">https://research.chalmers.se/publication/548594</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/548594/file/548594_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/548594/file/548594_Fulltext.pdf</link>
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsswe&AN=edsswe.oai.research.chalmers.se.0f1728cd.0caf.474e.b393.8d27acd5c63b
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.commtr.2025.100209
    Languages:
      – Text: English
    Subjects:
      – SubjectFull: Opportunity charging
        Type: general
      – SubjectFull: Combinatorial Benders decomposition
        Type: general
      – SubjectFull: Layover charging
        Type: general
      – SubjectFull: Battery-electric bus
        Type: general
      – SubjectFull: Heuristics
        Type: general
    Titles:
      – TitleFull: Minimum-delay opportunity charging scheduling for electricbuses
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: McCabe, Dan
      – PersonEntity:
          Name:
            NameFull: Ban, Xuegang (Jeff)
      – PersonEntity:
          Name:
            NameFull: Kulcsár, Balázs Adam
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 27724247
            – Type: issn-locals
              Value: SWEPUB_FREE
            – Type: issn-locals
              Value: CTH_SWEPUB
          Numbering:
            – Type: volume
              Value: 5
          Titles:
            – TitleFull: Communications in Transportation Research
              Type: main
ResultId 1