Robust time-varying shortest path with arbitrary waiting time at vertices
In this paper, we propose an algorithm for solving the robust time-varying shortest path problem in which the waiting time at any vertex is not restricted. The problem is to nd the shortest path connecting source node s and sink node i in a time-varying network ow such that the time of the path is at most T, where T is a given integer, the transit costs are uncertain and waiting time is arbitrarily allowed at any of the vertices.
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).