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

DOI10.1016/S0377-2217(99)00388-4MaRDI QIDQ1582033zbMATH OpenOpenAlexFDO

Authors 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 complexityfreight transportationcorrectnessshortest path algorithmsmode-to-mode switchingmultimodal transportation networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1070409
• Efficient computation of shortest paths in time-dependent multi-modal networks
• A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem
• Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Cites work

• scientific article; zbMATH DE number 3767009 (Why is no real title available?)
• On a routing problem
• Shortest‐path methods: Complexity, interrelations and new propositions

Cited in

(19)

• Hub location-allocation in intermodal logistic networks
• Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
• A simulation-based dynamic intermodal network equilibrium algorithm
• User equilibrium with recourse
• Modeling and solving a multimodal transportation problem with flexible-time and scheduled services
• scientific article; zbMATH DE number 1070409 (Why is no real title available?)
• Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
• Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network
• Time dependent multiobjective best path for multimodal urban routing
• Algorithms for time-dependent bicriteria shortest path problems
• Multimodal K-shortest viable path problem in Tehran public transportation network and its solution applying ant colony and simulated annealing algorithms
• Distributed approach for solving time-dependent problems in multimodal transport networks
• Dynamic shortest paths minimizing travel times and costs
• Object modeling and path computation for multimodal travel systems
• Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram
• Dynamic journeying under uncertainty
• An intermodal multicommodity routing problem with scheduled services
• Equilibrium network design of shared-vehicle systems
• The Modulo Network Simplex with Integrated Passenger Routing

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1582033)