Normal view
MARC view
Computing shortest paths with logistic constraints Crainic, Teodor Gabriel ; Florian, Michael ; Noriega, Yolanda
Publication details: Montreal Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, CIRRELT, 2007; CIRRELT-2007-06, Description: 17 sSubject(s): Online resources: Abstract: 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.No physical items for this record
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.