Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
type: Item
instance of: scholarly article
title: Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network
zbMATH Open document ID: 1427.90283
author: Linzhong Liu
author: Juhua Yang
author: Xiaojing Li
author: Fang Wu
author: Haibo Mu
published in: Applied Mathematical Modelling
publication date: 2018-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 6990710
zbMATH Keywords: network
zbMATH Keywords: algorithm
zbMATH Keywords: shortest path problem (SPP)
zbMATH Keywords: multi-modal shortest path problem (M-SPP)
zbMATH Keywords: urban transit network (UTN)
zbMATH Keywords: label correcting algorithm (LCA)
MaRDI profile type: Publication
full work available at URL: j.apm.2013.10.059
OpenAlex ID: W2078738709
cites work: On the shortest route through a network
cites work: A note on two problems in connexion with graphs
cites work: Q4495163
cites work: Shortest-path algorithms: Taxonomy and annotation
cites work: Object modeling and path computation for multimodal travel systems
cites work: Q4198056
cites work: Q3888874
cites work: On a multicriteria shortest path problem
cites work: A parametric approach to solving bicriterion shortest path problems
cites work: Q4546246
cites work: A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
cites work: A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks
cites work: Transfer Graph Approach for Multimodal Transport Problems
cites work: A simulated annealing for multi-criteria network path problems
cites work: An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays
cites work: Dynamic fleet management. Concepts, systems, algorithms \& case studies
cites work: Distributed approach for solving time-dependent problems in multimodal transport networks
cites work: A label correcting approach for solving bicriterion shortest-path problems
cites work: Label correcting methods to solve multicriteria shortest path problems
cites work: Near-shortest and K-shortest simple paths
cites work: The transit route arc-node service maximization problem
cites work: On finding dissimilar Pareto-optimal paths
cites work: Heuristics for the bi-objective path dissimilarity problem
cites work: A comparison of solution strategies for biobjective shortest path problems
DOI: 10.1016/J.APM.2013.10.059
description: scientific article; zbMATH DE number 6990710