Column Generation for Multi-Matrix Blocking Problems

Robert Voll () and Uwe Clausen ()
Additional contact information
Robert Voll: TU Dortmund
Uwe Clausen: TU Dortmund

A chapter in Operations Research Proceedings 2011, 2012, pp 281-286 from Springer

Abstract: Abstract The blocking problem in railroad freight traffic is a tactical routing problem. The problem was modeled as an arc-based MIP in former publications. We reformulate the problem and introduce a new model. The modified objective function can be handled easier without loss of structural information. Nevertheless, real instances cannot be solved by standard algorithms. Therefore, we present a column generation approach. The model is reformulated in a path-based way. We exploit the new model structure in the pricing step. Sets of new paths for each relation are generated in polynomial time.

Keywords: Column Generation; Master Problem; Feasible Path; Restricted Master Problem; Column Generation Approach (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_45

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_45

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().