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

DOI10.1016/S0377-2217(99)00388-4zbMATH Open0967.90009OpenAlexW2010687205MaRDI QIDQ1582033FDOQ1582033

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

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

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)

Cites Work

• On a routing problem
• Title not available (Why is that?)
• Shortest‐path methods: Complexity, interrelations and new propositions

Cited In (19)

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