Object modeling and path computation for multimodal travel systems
From MaRDI portal
Publication:2433544
DOI10.1016/j.ejor.2005.02.036zbMath1142.90367OpenAlexW2155754515MaRDI QIDQ2433544
Hicham Mouncif, Maurizio Bielli, Azedine Boulmakoul
Publication date: 27 October 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.02.036
schedulingmultimodal routingobject modelingGIS-transit itinerary planningtransportation network systems
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)
Related Items (10)
Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ Distributed approach for solving time-dependent problems in multimodal transport networks ⋮ Railway disruption management: designing bus bridging services under uncertainty ⋮ 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 ⋮ Transfer Graph Approach for Multimodal Transport Problems ⋮ Multimodal processes scheduling in mesh-like network environment ⋮ Reliability based assignment in stochastic-flow freight network ⋮ Reconstructing freeway travel times with a simplified network flow model alternating the adopted fundamental diagram
Cites Work
- Unnamed Item
- An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
- A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
- Object modeling and path computation for multimodal travel systems
- On algorithms for finding the k shortest paths in a network
- Network Equilibrium Models with Combined Modes
- Finding the K Shortest Loopless Paths in a Network
- Comparaison d'algorithmes de plus courts chemins sur des graphes routiers de grande taille
This page was built for publication: Object modeling and path computation for multimodal travel systems