Journal
OPERATIONS RESEARCH LETTERS
Volume 41, Issue 1, Pages 40-46Publisher
ELSEVIER
DOI: 10.1016/j.orl.2012.10.007
Keywords
Hazardous material transport network design; Bilevel programming; Valid cuts; Cutting plane algorithm
Categories
Ask authors/readers for more resources
We consider the network design problem for hazardous material transportation that is modeled as a bilevel multi-commodity network flow model. We study a combinatorial bilevel formulation of the problem and present results on its solution space. We propose a family of valid cuts and incorporate them within an exact cutting plane algorithm. Numerical testing is performed using real as well as random data sets. The results show that the cutting plane method is faster than other methods in the literature on the same formulation. (c) 2012 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available