2015 | OriginalPaper | Buchkapitel
Design of an Efficient Algorithm to Determine a Near-Optimal Location of Parking Areas for Dangerous Goods in the European Road Transport Network
verfasst von : María D. Caro, Eugenio M. Fedriani, Ángel F. Tenorio
Erschienen in: Computational Logistics
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper deals with the problem of locating the minimal number of parking areas being necessary for dangerous goods in the European Road Transport Network. To obtain a near-optimal solution for this problem, we introduce the design of a new graph-based algorithm to locate parking areas in such a way that drivers can obey the regulations related to driving and resting times. This restriction is imposed to the problem as follows: each point in the European Road Transport Network has to be at a distance lower than 200 km from a parking area in the Network.