Computing Shortest Paths with Logistic Constraints

The issue considered in this contribution is the computation of shortest paths on networks that represent freight movements. The features of a particular distribution system can be abstracted with a series of conditions which are referred to as logistic constraints. We propose a polynomial shortest path algorithm that takes into account such logistic constraints.