Flows over time problems relate to finding optimal flows over a capacitated network where transit times on network arcs are explicitly considered. In this article, we study the problem of determining a minimum cost origin-destination path where the cost and the travel time of each arc depend on the time taken to travel from the origin to that particular arc along the path. We provide computational complexity results for this problem and an exact solution algorithm based on an enumeration scheme on the corresponding time expanded network. Finally, we show the efficiency of our approach through a number of experimental tests. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 23–32 2017.
Di Bartolomeo, M., Grande, E., Nicosia, G., & Pacifici, A. (2017). Cheapest paths in dynamic networks. NETWORKS, 69(1), 23-32.
|Titolo:||Cheapest paths in dynamic networks|
|Data di pubblicazione:||2017|
|Citazione:||Di Bartolomeo, M., Grande, E., Nicosia, G., & Pacifici, A. (2017). Cheapest paths in dynamic networks. NETWORKS, 69(1), 23-32.|
|Appare nelle tipologie:||1.1 Articolo in rivista|