par Amaldi, Edoardo;Bruglieri, Maurizio;Fortz, Bernard 
Référence Lecture notes in computer science, 6701 LNCS, page (327-338)
Publication Publié, 2011
Référence Lecture notes in computer science, 6701 LNCS, page (327-338)
Publication Publié, 2011
Article révisé par les pairs
| Résumé : | 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. © 2011 Springer-Verlag. |
