A dynamic programming solution of a shortest path problem with time constraints on movement and parking

AbstractIn this paper we present a dynamic programming formulation of a shortest path problem when some arcs are open for travelling during specified periods of time. We consider the case when parking is allowed on the nodes whenever it is necessary to wait for an adjacent arc to be opened. We will also assume the possibility of no parking at the nodes during the time when the nodes are occupied