Article ID: | iaor20014152 |
Country: | United Kingdom |
Volume: | 52 |
Issue: | 1 |
Start Page Number: | 102 |
End Page Number: | 108 |
Publication Date: | Jan 2001 |
Journal: | Journal of the Operational Research Society |
Authors: | Tang K., Chen Y.-L., Rinks D. |
The time-constrained shortest path problem is an important generalisation of the classical shortest path problem and in recent years has attracted much research interest. We consider a time-schedule network, where every node in the network has a list of pre-specified departure times and departure from a node may take place only at one of these departure times. The objective of this paper is to find the first