Optimising Waiting at Nodes in Time-Dependent Networks: Cost Functions and Applications
In this paper, the relationship between waiting at nodes and the path cost in a transport network is analysed. An exact solution algorithm for generating the shortest path with optimal waiting at the nodes is proposed. The general case is examined, considering a time-dependent network (time influences the cost). To develop a full application, the algorithm is applied in the case of a vehicle routing problem on a real network.
time-dependent networks continuous link cost functions dynamic approach path design