IDEAS home Printed from https://ideas.repec.org/a/taf/transp/v46y2023i5p615-652.html
   My bibliography  Save this article

A variable neighborhood search algorithm for a public bus line with a demand-responsive operation during peak hours

Author

Listed:
  • Dilay Aktaş
  • Kenneth Sörensen
  • Pieter Vansteenwegen

Abstract

In this study, we propose a variable neighborhood search (VNS) algorithm to optimize the performance of a single bus line during peak hours where the passenger flows in one direction are typically much larger than the flows in the opposite direction. The system we propose aims to increase the frequency of the service towards the city center during morning peak hours, by allowing some of the vehicles to perform short-cut trips away from the city center. Just before the morning peak hours and based on the expected demand, the VNS algorithm decides which buses should visit all the stops ahead or take a short-cut during its return trip. Experiments show that with the demand-responsive system, total passenger travel time improves about 10% on average for a real-size benchmark instance. The performance of the system is also analyzed under different fleet size and capacity, duration of peak hours, and demand scenarios.

Suggested Citation

  • Dilay Aktaş & Kenneth Sörensen & Pieter Vansteenwegen, 2023. "A variable neighborhood search algorithm for a public bus line with a demand-responsive operation during peak hours," Transportation Planning and Technology, Taylor & Francis Journals, vol. 46(5), pages 615-652, July.
    • Handle: RePEc:taf:transp:v:46:y:2023:i:5:p:615-652
    DOI: 10.1080/03081060.2023.2213313
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2023.2213313
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03081060.2023.2213313?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:transp:v:46:y:2023:i:5:p:615-652. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/GTPT20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.