A cutting plane approach for bilevel hazardous material transport network design

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...

Full description

Saved in:
Bibliographic Details
Published in:Operations research letters 2013-01, Vol.41 (1), p.40-46
Main Author: Gzara, Fatma
Format: Article
Language:English
Subjects:
Bilevel programming
Combinatorial analysis
Cutting
Cutting plane algorithm
Cutting speed
Hazardous material transport network design
Hazardous materials
Mathematical models
Networks
Planes
Transportation
Valid cuts
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2012.10.007