An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays

DOI10.1016/S0377-2217(99)00388-4zbMath0967.90009OpenAlexW2010687205MaRDI QIDQ1582033

Whitney Wardell, Athanasios K. Ziliaskopoulos

Publication date: 3 September 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00388-4

zbMATH Keywords

computational complexitycorrectnessshortest path algorithmsfreight transportationmode-to-mode switchingmultimodal transportation networks

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (16)

Time dependent multiobjective best path for multimodal urban routing ⋮ Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ User equilibrium with recourse ⋮ Distributed approach for solving time-dependent problems in multimodal transport networks ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms ⋮ Object modeling and path computation for multimodal travel systems ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network ⋮ Dynamic journeying under uncertainty ⋮ Hub location-allocation in intermodal logistic networks ⋮ An intermodal multicommodity routing problem with scheduled services ⋮ Equilibrium network design of shared-vehicle systems ⋮ Dynamic shortest paths minimizing travel times and costs ⋮ Modeling and solving a multimodal transportation problem with flexible-time and scheduled services ⋮ Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram

Cites Work

• On a routing problem
• Shortest‐path methods: Complexity, interrelations and new propositions
• Unnamed Item

This page was built for publication: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays