Publication: Design of an efficient algorithm to determine a near-optimal location of parking areas for dangerous goods in the european road transport network
Loading...
Identifiers
Publication date
Reading date
Event date
Start date of the public exhibition period
End date of the public exhibition period
Advisors
Authors of photography
Person who provides the photography
Journal Title
Journal ISSN
Volume Title
Publisher
Springer International Publishing.
Export
Abstract
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.
Doctoral program
Related publication
Research projects
Description
The authors would like to thank the ERDF of European Union for financial support via project “Localización de áreas de estacionamiento para mercancías peligrosas en Andalucía y la Red Transeuropea” of the “Programa Operativo FEDER de Andalucí a 2007-2013”.We also thank to PublicWorks Agency and Regional Ministry of Public Works and Housing of the Regional Government of Andalusia.
Bibliographic reference
Caro, M.D., Fedriani, E.M., Tenorio, Á.F. (2015). Design of an Efficient Algorithm to Determine a Near-Optimal Location of Parking Areas for Dangerous Goods in the European Road Transport Network. In: Corman, F., Voß, S., Negenborn, R. (eds) Computational Logistics. ICCL 2015. Lecture Notes in Computer Science(), vol 9335. Springer, Cham. https://doi.org/10.1007/978-3-319-24264-4_42