期刊
OPERATIONS RESEARCH LETTERS
卷 41, 期 1, 页码 40-46出版社
ELSEVIER
DOI: 10.1016/j.orl.2012.10.007
关键词
Hazardous material transport network design; Bilevel programming; Valid cuts; Cutting plane algorithm
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据