Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
DOI10.1016/j.apm.2013.10.059zbMath1427.90283OpenAlexW2078738709MaRDI QIDQ1630202
Juhua Yang, Linzhong Liu, Xiaojing Li, Fang Wu, Hai Bo Mu
Publication date: 7 December 2018
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2013.10.059
networkalgorithmlabel correcting algorithm (LCA)multi-modal shortest path problem (M-SPP)shortest path problem (SPP)urban transit network (UTN)
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A simulated annealing for multi-criteria network path problems
- Distributed approach for solving time-dependent problems in multimodal transport networks
- The transit route arc-node service maximization problem
- On finding dissimilar Pareto-optimal paths
- On a multicriteria shortest path problem
- A parametric approach to solving bicriterion shortest path problems
- A comparison of solution strategies for biobjective shortest path problems
- Heuristics for the bi-objective path dissimilarity problem
- 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
- A label correcting approach for solving bicriterion shortest-path problems
- Object modeling and path computation for multimodal travel systems
- Dynamic fleet management. Concepts, systems, algorithms \& case studies
- On the Shortest Route Through a Network
- Shortest-path algorithms: Taxonomy and annotation
- Transfer Graph Approach for Multimodal Transport Problems
- A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
- Near-shortest and K-shortest simple paths
- Label correcting methods to solve multicriteria shortest path problems
This page was built for publication: Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network