Abstract
We consider the problem of designing a network for hazardous material transportation where the government can decide which roads have to be forbidden to hazmats and the carriers choose the routes on the network. We assume that the government is interested in minimizing the overall risk of the shipments whereas the carriers minimize the route costs. In spite of the rich literature on hazmat transportation and of the relevance of this network design problem, it has received little attention and only quite recently. In this work we prove that the version of the hazmat transport network design problem where a subset of arcs can be forbidden is NP-hard even when a single commodity has to be shipped. We propose a bilevel integer programming formulation that guarantees solution stability and we derive a (single-level) mixed integer linear programming formulation that can be solved in reasonable time with a state-of-the-art solver.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bruglieri, M., Maja, R., Marchionni, G., Rainoldi, G.: Safety in hazardous material road transportation: state of the art and emerging problems. In: Bersani, C., et al. (eds.) Advanced Technologies and Methodologies for Risk Management in the Global Transport of Dangerous Goods, pp. 88–129. IOS Press, Amsterdam (2007)
Carotenuto, P., Giordani, S., Ricciardelli, S.: Finding minimum and equitable risk routes for hazmat shipments. Computers and Operations Research 34(5), 1304–1327 (2007)
Centrone, G., Pesenti, R., Ukovich, W.: Hazardous Materials Transportation: A Literature Review and an Annotated Bibliography. In: Bersani, C., et al. (eds.) Advanced Technologies and Methodologies for Risk Management in the Global Transport of Dangerous Goods, pp. 33–62. IOS Press, Amsterdam (2007)
Colson, B., Marcotte, P., Savard, G.: An overview of Bilevel optimization. Annals of Operations Research 153, 235–256 (2007)
Dell’Olmo, P., Gentili, M., Scozzari, A.: On finding dissimilar Pareto-optimal paths. European Journal of Operational Research 162(1), 70–82 (2005)
Erkut, E., Alp, O.: Designing a road network for dangerous goods shipments. Computers & Operations Research 34(5), 1241–1242 (2007)
Erkut, E., Gzara, F.: Solving the hazmat transport network design problem. Computers & Operations Research 35(7), 2234–2247 (2008)
Fourer, R., Gay, D.: The AMPL Book. Duxbury Press, Pacific Grove (2002)
Kara, B.Y., Verter, V.: Designing a road network for hazardous materials transportation. Transportation Science 38(2), 188–196 (2004)
Verter, V., Kara, B.Y.: A path-based approach for hazmat transport network design. Management Science 54(1), 29–40 (2008)
Roch, S., Savard, G., Marcotte, P.: An approximation algorithm for Stackelberg network pricing. Networks 46(1), 57–67 (2005)
UNECE, United Nations Economic Commission for the Europe, European Agreement concerning the international carriage of Dangerous goods by Road (ADR), 73-76 (2007), 1.9.5, http://www.unece.org/trans/danger/publi/adr/adr2007/English/01-0%20E_Part%201.pdf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Amaldi, E., Bruglieri, M., Fortz, B. (2011). On the Hazmat Transport Network Design Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)