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

Multi-Objective Stochastic Synchronous Timetable Optimization Model Based on a Chance-Constrained Programming Method Combined with Augmented Epsilon Constraint Algorithm

Author

Listed:
  • Yu Yuan
  • Pengcheng Wang
  • Minghui Wang
  • Amandeep Kaur

Abstract

The design of the timetable is essential to improve the service quality of the public transport system. A lot of random factors in the actual operation environment will affect the implementation of the synchronous timetable, and adjusting timetables to improve synchronization will break the order of normal service and increase the cost of operation. A multi-objective bus timetable optimization problem is characterized by considering the randomness of vehicle travel time and passenger transfer demand. A multi-objective optimization model is proposed, aiming at minimizing the total waiting time of passengers in the whole bus network and the inconsistency between the timetable after synchronous optimization and the original timetable. Through large sample analysis, it is found that the random variables in the model obey normal distribution, so the stochastic programming problem is transformed into the traditional deterministic programming problem by the chance-constrained programming method. A model solving method based on the augmented epsilon-constraint algorithm is designed. Examples show that when the random variables are considered, the proposed algorithm can obtain multiple high-quality Pareto optimal solutions in a short time, which can provide more practical benefits for decisionmakers. Ignoring the random influence will reduce the effectiveness of the schedule optimization scheme. Finally, sensitivity analysis of random variables and constraint confidence in the model is made.

Suggested Citation

  • Yu Yuan & Pengcheng Wang & Minghui Wang & Amandeep Kaur, 2022. "Multi-Objective Stochastic Synchronous Timetable Optimization Model Based on a Chance-Constrained Programming Method Combined with Augmented Epsilon Constraint Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-18, August.
  • Handle: RePEc:hin:jnlmpe:9222636
    DOI: 10.1155/2022/9222636
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9222636.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/9222636.xml
    Download Restriction: no

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