IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i1p18-28.html
   My bibliography  Save this article

Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network

Author

Listed:
  • Androutsopoulos, Konstantinos N.
  • Zografos, Konstantinos G.

Abstract

Multi-criteria routing and scheduling in a multimodal fixed scheduled network with time-dependent travel times involves the determination of the non-dominated itineraries (i.e., paths enhanced with scheduled departures) under the following constraints: (i) visiting a given set of intermediate stops in a specified sequence, and (ii) strict time windows on the origin, the destination and the intermediate stops. The objective of this paper is to present the formulation and algorithmic solution for the multi-criteria itinerary planning problem that takes into account the aforementioned features. The algorithmic approach proposed is based on the decomposition of the problem to a sequence of elementary itinerary sub-problems, solved by a dynamic programming algorithm. The computational performance of the algorithms on a set of large scale test problems indicates non-prohibitive time requirements and encourages its integration into travel planning decision support systems.

Suggested Citation

  • Androutsopoulos, Konstantinos N. & Zografos, Konstantinos G., 2009. "Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network," European Journal of Operational Research, Elsevier, vol. 192(1), pages 18-28, January.
    • Handle: RePEc:eee:ejores:v:192:y:2009:i:1:p:18-28
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00918-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Wong, S. C. & Tong, C. O., 1998. "Estimation of time-dependent origin-destination matrices for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(1), pages 35-48, January.
    2. Horn, Mark E. T., 2003. "An extended model and procedural framework for planning multi-modal passenger journeys," Transportation Research Part B: Methodological, Elsevier, vol. 37(7), pages 641-660, August.
    3. Namorado Climaco, Joao Carlos & Queiros Vieira Martins, Ernesto, 1982. "A bicriterion shortest path algorithm," European Journal of Operational Research, Elsevier, vol. 11(4), pages 399-404, December.
    4. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    5. Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
    6. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    7. Modesti, Paola & Sciomachen, Anna, 1998. "A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 111(3), pages 495-508, December.
    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. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    2. Gecchelin, Tommaso & Webb, Jeremy, 2019. "Modular dynamic ride-sharing transport systems," Economic Analysis and Policy, Elsevier, vol. 61(C), pages 111-117.
    3. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    4. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    5. Zhang, Yu & Tang, Jiafu, 2018. "A robust optimization approach for itinerary planning with deadline," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 56-74.
    6. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    7. Said Dabia & Stefan Ropke & Tom van Woensel & Ton De Kok, 2013. "Branch and Price for the Time-Dependent Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 47(3), pages 380-396, August.
    8. Cats, Oded & Koutsopoulos, Haris N. & Burghout, Wilco & Toledo, Tomer, 2013. "Effect of real-time transit information on dynamic path choice of passengers," Working papers in Transport Economics 2013:28, CTS - Centre for Transport Studies Stockholm (KTH and VTI).
    9. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.

    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. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    2. Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
    3. López, David & Lozano, Angélica, 2020. "Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 541-559.
    4. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    5. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.
    6. Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
    7. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    8. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    9. Yang, Xuejing & Low, Joyce M.W. & Tang, Loon Ching, 2011. "Analysis of intermodal freight from China to Indian Ocean: A goal programming approach," Journal of Transport Geography, Elsevier, vol. 19(4), pages 515-527.
    10. Luigi Di Puglia Pugliese & Francesca Guerriero, 2013. "A Reference Point Approach for the Resource Constrained Shortest Path Problems," Transportation Science, INFORMS, vol. 47(2), pages 247-265, May.
    11. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
    12. Zhang, Yu & Tang, Jiafu, 2018. "A robust optimization approach for itinerary planning with deadline," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 113(C), pages 56-74.
    13. Li, Guoyuan & Chen, Anthony, 2022. "Frequency-based path flow estimator for transit origin-destination trip matrices incorporating automatic passenger count and automatic fare collection data," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 163(C).
    14. Rahul Nair & Elise Miller-Hooks, 2016. "Equilibrium design of bicycle sharing systems: the case of Washington D.C," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 321-344, August.
    15. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.
    16. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    17. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    18. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    19. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
    20. Bielli, Maurizio & Boulmakoul, Azedine & Mouncif, Hicham, 2006. "Object modeling and path computation for multimodal travel systems," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1705-1730, December.

    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:eee:ejores:v:192:y:2009:i:1:p:18-28. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.