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

Optimization of headway and bus stop spacing for low demand bus routes

Author

Listed:
  • Sushreeta Mishra
  • Babak Mehran
  • Prasanta K. Sahu

Abstract

We propose a methodology for optimization of service headway and stop spacing along a low-demand bus route that minimizes operator and user costs. This study develops analytical cost models that are representative of low-demand routes by using negative binomial distribution for passenger demand for boarding and alighting pattern to estimate the probability of stopping and both random and planned arrival of passengers are considered to estimate the waiting time. Pareto optimal solutions obtained using multi-objective evolutionary algorithm, NSGA-II indicate that optimal values of headway and stop spacing are underestimated if optimized based on assumptions typical of high-demand routes which is passenger demand for boarding and alighting at bus stops randomly following a Poisson process. With the aid of the study methodology, transit planners will be able to improve the service utilization and passenger accessibility along an under-performing low demand routes by recommending minimal modifications to the existing route and bus schedule.

Suggested Citation

  • Sushreeta Mishra & Babak Mehran & Prasanta K. Sahu, 2023. "Optimization of headway and bus stop spacing for low demand bus routes," Transportation Planning and Technology, Taylor & Francis Journals, vol. 46(8), pages 1024-1049, November.
  • Handle: RePEc:taf:transp:v:46:y:2023:i:8:p:1024-1049
    DOI: 10.1080/03081060.2023.2231429
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03081060.2023.2231429
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03081060.2023.2231429?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:8:p:1024-1049. 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.