SIAM Journal on Computing
Minimum time paths in a network with mixed time constraints
Computers and Operations Research
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
Solving the k-shortest path problem with time windows in a time varying network
Operations Research Letters
| Hi-index | 0.01 |
We study a new variant of the time-constrained shortest path problem (TCSPP), that is, the K shortest paths problem in a time-schedule network with constraints on arcs. In such networks, each arc has a list of pre-specified departure times, and traversal along the arc can only take place at one of those departure times. We develop a solution algorithm that finds the K shortest looping paths in O(mlog(nr)+Kmr^2@h) time, where n is the number of nodes, m is the number of arcs, r is the maximum number of departure times on an arc, and @h is the maximum in-degree of a node. Computational experiments show that our algorithm outperforms existing ones adapted to solve the same problem.