IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7183465.html
   My bibliography  Save this article

Flexible Bus Route Optimization for Multitarget Stations

Author

Listed:
  • Sun Ji-yang
  • Huang Jian-ling
  • Chen Yan-yan
  • Wei Pan-yi
  • Jia Jian-lin

Abstract

This paper proposes a flexible bus route optimization model for efficient public city transportation systems based on multitarget stations. The model considers passenger demands, vehicle capacities, and transportation network and aims to solve the optimal route, minimizing the vehicles’ running time and the passengers’ travel time. A heuristic algorithm based on a gravity model is introduced to solve this NP-hard optimization problem. Simulation studies verify the effectiveness and practicality of the proposed model and algorithm. The results show that the total number of vehicles needed to complete the service is 17–21, the average travel time of each vehicle is 24.59 minutes, the solving time of 100 sets of data is within 25 seconds, and the average calculation time is 12.04 seconds. It can be seen that under the premise of real-time adjustment of connection planning time, the optimization model can satisfy the passenger’s dynamic demand to a greater extent, and effectively reduce the planning path error, shorten the distance and travel time of passengers, and the result is better than that of the flexible bus scheduling model which ignores the change of connection travel time.

Suggested Citation

  • Sun Ji-yang & Huang Jian-ling & Chen Yan-yan & Wei Pan-yi & Jia Jian-lin, 2020. "Flexible Bus Route Optimization for Multitarget Stations," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-8, March.
  • Handle: RePEc:hin:jnlmpe:7183465
    DOI: 10.1155/2020/7183465
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/7183465.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2020/7183465.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/7183465?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
    ---><---

    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:hin:jnlmpe:7183465. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.