IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v36y2002i10p853-874.html
   My bibliography  Save this article

Shortest viable hyperpath in multimodal networks

Author

Listed:
  • Lozano, Angélica
  • Storchi, Giovanni

Abstract

No abstract is available for this item.

Suggested Citation

  • Lozano, Angélica & Storchi, Giovanni, 2002. "Shortest viable hyperpath in multimodal networks," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 853-874, December.
  • Handle: RePEc:eee:transb:v:36:y:2002:i:10:p:853-874
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(01)00038-8
    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. Crainic, Teodor G. & Rousseau, Jean-Marc, 1986. "Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 20(3), pages 225-242, June.
    2. Enrique Fernandez & Joaquin de Cea & Michael Florian & Enrique Cabrera, 1994. "Network Equilibrium Models with Combined Modes," Transportation Science, INFORMS, vol. 28(3), pages 182-192, August.
    3. Lozano, Angelica & Storchi, Giovanni, 2001. "Shortest viable path algorithm in multimodal networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(3), pages 225-241, March.
    4. 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.
    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. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
    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. Liang, Wen Yau & Huang, Chun-Che & Lin, Yin-Chen & Chang, Tsun Hsien & Shih, Meng Hao, 2013. "The multi-objective label correcting algorithm for supply chain modeling," International Journal of Production Economics, Elsevier, vol. 142(1), pages 172-178.
    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. Deng, Yuntian & Shao, Shiping & Mittal, Archak & Twumasi-Boakye, Richard & Fishelson, James & Gupta, Abhishek & Shroff, Ness B., 2022. "Incentive design and profit sharing in multi-modal transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 1-21.
    7. Feixiong Liao & Theo Arentze & Eric Molin & Wendy Bothe & Harry Timmermans, 2017. "Effects of land-use transport scenarios on travel patterns: a multi-state supernetwork application," Transportation, Springer, vol. 44(1), pages 1-25, January.

    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. 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.
    2. 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.
    3. Zhang, M. & Pel, A.J., 2016. "Synchromodal hinterland freight transport: Model study for the port of Rotterdam," Journal of Transport Geography, Elsevier, vol. 52(C), pages 1-10.
    4. 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.
    5. Yi Zhao & Ronghui Liu & Xi Zhang & Anthony Whiteing, 2018. "A chance-constrained stochastic approach to intermodal container routing problems," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-22, February.
    6. 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.
    7. van Riessen, B. & Negenborn, R.R. & Dekker, R. & Lodewijks, G., 2013. "Impact and relevance of transit disturbances on planning in intermodal container networks," Econometric Institute Research Papers EI 2013-18, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Li, Zhaojin & Liu, Ya & Yang, Zhen, 2021. "An effective kernel search and dynamic programming hybrid heuristic for a multimodal transportation planning problem with order consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    9. 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.
    10. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
    11. van Riessen, B. & Negenborn, R.R. & Dekker, R. & Lodewijks, G., 2013. "Service network design for an intermodal container network with flexible due dates/times and the possibility of using subcontracted transport," Econometric Institute Research Papers EI2013-17, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Lo, Hong K. & Yip, C. W. & Wan, K. H., 2003. "Modeling transfer and non-linear fare structure in multi-modal network," Transportation Research Part B: Methodological, Elsevier, vol. 37(2), pages 149-170, February.
    13. Xinyuan Chen & Ruyang Yin & Qinhe An & Yuan Zhang, 2021. "Modeling a Distance-Based Preferential Fare Scheme for Park-and-Ride Services in a Multimodal Transport Network," Sustainability, MDPI, vol. 13(5), pages 1-14, March.
    14. Paraskevopoulos, Dimitris C. & Gürel, Sinan & Bektaş, Tolga, 2016. "The congested multicommodity network design problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 85(C), pages 166-187.
    15. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    16. Meng, Qiang & Hei, Xiuling & Wang, Shuaian & Mao, Haijun, 2015. "Carrying capacity procurement of rail and shipping services for automobile delivery with uncertain demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 82(C), pages 38-54.
    17. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    18. Xin Wang & Teodor Gabriel Crainic & Stein W. Wallace, 2019. "Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 153-170, February.
    19. Zhimei Wang & Avishai Ceder, 2017. "Efficient design of freight train operation with double-hump yards," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(12), pages 1600-1619, December.
    20. Afshar, Abbas & Haghani, Ali, 2012. "Modeling integrated supply chain logistics in real-time large-scale disaster relief operations," Socio-Economic Planning Sciences, Elsevier, vol. 46(4), pages 327-338.

    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:eee:transb:v:36:y:2002:i:10:p:853-874. 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/wps/find/journaldescription.cws_home/548/description#description .

    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.