IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v41y2007i4p527-538.html
   My bibliography  Save this article

To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation

Author

Listed:
  • Andreas Ginkel

    (Institut für Numerische und Angewandte Mathematik, Georg-August Universität, Göttingen, Lotzestr 16-18, D-37083, Göttingen, Germany)

  • Anita Schöbel

    (Institut für Numerische und Angewandte Mathematik, Georg-August Universität, Göttingen, Lotzestr 16-18, D-37083, Göttingen, Germany)

Abstract

Assume that a train reaches a station with delay. At the station there is a bus ready to depart. The question of whether the bus should wait for the delayed train or depart on time is called the delay management problem . Different single objective functions for this problem have been introduced and analyzed. In this paper, we present a bicriteria model for the delay management problem, taking into account both the delay of the vehicles and the number of passengers who miss a connection. Our model does not depend on detailed data about the passengers and hence can be easily implemented in practice.To analyze the problem, we present an integer programming formulation and a graph-theoretic approach that is based on discrete time/cost trade-off project networks. Using results of project planning, we develop an efficient solution method. We tested our procedure using real-world data. The results show the applicability of the approach.

Suggested Citation

  • Andreas Ginkel & Anita Schöbel, 2007. "To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation," Transportation Science, INFORMS, vol. 41(4), pages 527-538, November.
    • Handle: RePEc:inm:ortrsc:v:41:y:2007:i:4:p:527-538
    DOI: 10.1287/trsc.1070.0212
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.1070.0212
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.1070.0212?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
    ---><---

    References listed on IDEAS

    as
    1. Demeulemeester, Erik L. & Herroelen, Willy S. & Elmaghraby, Salah E., 1996. "Optimal procedures for the discrete time/cost trade-off problem in project networks," European Journal of Operational Research, Elsevier, vol. 88(1), pages 50-68, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kang, Liujiang & Zhu, Xiaoning & Sun, Huijun & Wu, Jianjun & Gao, Ziyou & Hu, Bin, 2019. "Last train timetabling optimization and bus bridging service management in urban railway transit networks," Omega, Elsevier, vol. 84(C), pages 31-44.
    2. Paul Davidsson & Banafsheh Hajinasab & Johan Holmgren & Åse Jevinger & Jan A. Persson, 2016. "The Fourth Wave of Digitalization and Public Transport: Opportunities and Challenges," Sustainability, MDPI, vol. 8(12), pages 1-16, November.
    3. Luan, Xiaojie & Corman, Francesco, 2022. "Passenger-oriented traffic control for rail networks: An optimization model considering crowding effects on passenger choices and train operations," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 239-272.
    4. Twan Dollevoet & Dennis Huisman & Marie Schmidt & Anita Schöbel, 2012. "Delay Management with Rerouting of Passengers," Transportation Science, INFORMS, vol. 46(1), pages 74-89, February.
    5. Dollevoet, T.A.B. & Huisman, D. & Schöbel, A. & Schmidt, M.E., 2012. "Delay Management including Capacities of Stations," Econometric Institute Research Papers EI 2012-22, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    6. Dollevoet, T.A.B. & Huisman, D. & Schmidt, M.E. & Schöbel, A., 2010. "Delay Management with Re-Routing of Passengers," Econometric Institute Research Papers EI 2010-31, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    7. Kroon, L.G. & Maróti, G. & Nielsen, L.K., 2010. "Rescheduling of Railway Rolling Stock with Dynamic Passenger Flows," ERIM Report Series Research in Management ERS-2010-045-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    8. Michael Schachtebeck & Anita Schöbel, 2010. "To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions," Transportation Science, INFORMS, vol. 44(3), pages 307-321, August.
    9. Luan, Xiaojie & Wang, Yihui & De Schutter, Bart & Meng, Lingyun & Lodewijks, Gabriel & Corman, Francesco, 2018. "Integration of real-time traffic management and train control for rail networks - Part 1: Optimization problems and solution approaches," Transportation Research Part B: Methodological, Elsevier, vol. 115(C), pages 41-71.
    10. König, Eva & Schön, Cornelia, 2021. "Railway delay management with passenger rerouting considering train capacity constraints," European Journal of Operational Research, Elsevier, vol. 288(2), pages 450-465.
    11. Luan, Xiaojie & De Schutter, Bart & Meng, Lingyun & Corman, Francesco, 2020. "Decomposition and distributed optimization of real-time traffic management for large-scale railway networks," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 72-97.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. A B Hafızoğlu & M Azizoğlu, 2010. "Linear programming based approaches for the discrete time/cost trade-off problem in project networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(4), pages 676-685, April.
    2. Eleni Hadjiconstantinou & Evelina Klerides, 2010. "A new path-based cutting plane approach for the discrete time-cost tradeoff problem," Computational Management Science, Springer, vol. 7(3), pages 313-336, July.
    3. HazIr, Öncü & Erel, Erdal & Günalay, Yavuz, 2011. "Robust optimization models for the discrete time/cost trade-off problem," International Journal of Production Economics, Elsevier, vol. 130(1), pages 87-95, March.
    4. Zsolt T. Kosztyán & István Szalkai, 2020. "Multimode resource-constrained project scheduling in flexible projects," Journal of Global Optimization, Springer, vol. 76(1), pages 211-241, January.
    5. Ma, Jun & Nault, Barrie R. & Tu, Yiliu (Paul), 2023. "Customer segmentation, pricing, and lead time decisions: A stochastic-user-equilibrium perspective," International Journal of Production Economics, Elsevier, vol. 264(C).
    6. He, Zhengwen & Wang, Nengmin & Jia, Tao & Xu, Yu, 2009. "Simulated annealing and tabu search for multi-mode project payment scheduling," European Journal of Operational Research, Elsevier, vol. 198(3), pages 688-696, November.
    7. Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke, 2022. "Multimode time-cost-robustness trade-off project scheduling problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1173-1202, July.
    8. Tiwari, Vikram & Patterson, James H. & Mabert, Vincent A., 2009. "Scheduling projects with heterogeneous resources to meet time and quality objectives," European Journal of Operational Research, Elsevier, vol. 193(3), pages 780-790, March.
    9. Kolisch, R. & Padman, R., 2001. "An integrated survey of deterministic project scheduling," Omega, Elsevier, vol. 29(3), pages 249-272, June.
    10. Kosztyán, Zsolt T. & Szalkai, István, 2018. "Hybrid time-quality-cost trade-off problems," Operations Research Perspectives, Elsevier, vol. 5(C), pages 306-318.
    11. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    12. Kolisch, Rainer & Padman, Rema, 1997. "An integrated survey of project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 463, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    13. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    14. M. Vanhoucke, 2007. "An electromagnetic time/cost trade-off optimization in project scheduling," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 07/457, Ghent University, Faculty of Economics and Business Administration.
    15. Vanhoucke, Mario, 2005. "New computational results for the discrete time/cost trade-off problem with time-switch constraints," European Journal of Operational Research, Elsevier, vol. 165(2), pages 359-374, September.
    16. Sprecher, Arno, 1998. "Non-equivalent search strategies for resource-constrained project scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 493, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    17. HazIr, Öncü & Haouari, Mohamed & Erel, Erdal, 2010. "Robust scheduling and robustness measures for the discrete time/cost trade-off problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 633-643, December.
    18. R L Bregman, 2009. "Preemptive expediting to improve project due date performance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 120-129, January.
    19. KIlIç, Murat & Ulusoy, Gündüz & Serifoglu, Funda Sivrikaya, 2008. "A bi-objective genetic algorithm approach to risk mitigation in project scheduling," International Journal of Production Economics, Elsevier, vol. 112(1), pages 202-216, March.
    20. Bregman, Robert L., 2009. "A heuristic procedure for solving the dynamic probabilistic project expediting problem," European Journal of Operational Research, Elsevier, vol. 192(1), pages 125-137, January.

    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:inm:ortrsc:v:41:y:2007:i:4:p:527-538. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.