Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Introduction to algorithms
Computers and Operations Research
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
SIAM Journal on Computing
A Doubly Dynamic Schedule-based Assignment Model for Transit Networks
Transportation Science
A Modeling Framework for Passenger Assignment on a Transport Network with Timetables
Transportation Science
Finding the first K shortest paths in a time-window network
Computers and Operations Research
Finding K shortest looping paths in a traffic-light network
Computers and Operations Research
Optimal Slack Time for Schedule-Based Transit Operations
Transportation Science
Introduction: Advances in intelligent information processing
Information Systems
Enterprise Information Systems
Flood decision support system on agent grid: method and implementation
Enterprise Information Systems
Finding a least hop(s) path subject to multiple additive constraints
Computer Communications
Hi-index | 0.02 |
Finding the shortest paths in a schedule-based public transit network is similar to finding the shortest paths in a network with multi-costs constrained and time-window constraints. We consider a schedule-based transit network, where each node in the network has a list of scheduled departure times for transit vehicles. The objective of this paper is to find out the first K shortest paths in a schedule-based transit network. An algorithm with a time complexity of O(S@?^2L@?^3)+O(L@?^4S@?R"l^m^a^x)+O(S@?L@?R"l^m^a^xK(L@?^3log(L@?^3)+L@?^3)) is proposed to enumerate these paths. We compare the time complexity of our algorithm with that of two existing path finding algorithms. We show that our algorithm has a better performance in computational time complexity than the two existing path finding algorithms, though it is only applicable if the number of transfers does not exceed 2. Also, for large sized real transit network, our algorithm determines the K shortest paths in a much shorter time frame than the existing two algorithms.