Efficient algorithms to find optimal paths in a public transportation network
From MaRDI portal
Publication:4338573
DOI10.1080/02522667.1996.10699302zbMATH Open0874.90076OpenAlexW1964766019MaRDI QIDQ4338573FDOQ4338573
Authors: Andrew Lim 
Publication date: 28 May 1997
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1996.10699302
Recommendations
- Optimal routing in a transportation network
- Computing Pareto-optimal transit routes through mathematical algorithms
- Efficient traffic assignment for public transit networks
- Computational aspects of the optimal transit path problem
- Integrated algorithms for cost-optimal public transport planning
- An efficient search algorithm for road network optimization
- Fast and exact public transit routing with restricted Pareto sets
- Trip-based path algorithms using the transit network hierarchy
- Path based algorithms for metro network design
Cites Work
Cited In (11)
- Computational aspects of the optimal transit path problem
- Title not available (Why is that?)
- Regional multicriteria and multimodal route planning system for public transportation: a case study
- Understanding the effectiveness of data reduction in public transportation networks
- Cheapest paths in public transport: properties and algorithms
- Optimal bicycle routes with few signal stops
- Multiple routing strategies in a labelled network
- Computing and listing \(st\)-paths in public transportation networks
- Computing and listing \(st\)-paths in public transportation networks
- An efficient search algorithm for road network optimization
- Optimal routing algorithm for public traffic network based on matrix analysis
This page was built for publication: Efficient algorithms to find optimal paths in a public transportation network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4338573)
