Models and Algorithms for Intermodal Transportation and Equipment Selection

Christina Burt () and Jakob Puchinger ()
Additional contact information
Christina Burt: AIT Austrian Institute of Technology
Jakob Puchinger: AIT Austrian Institute of Technology

A chapter in Operations Research Proceedings 2011, 2012, pp 305-310 from Springer

Abstract: Abstract We study a cement transportation problem with asset-management (equipment selection) for strategic planning scenarios involving multiple forms of transportation and network expansion. A deterministic mixed integer programming approach is difficult due to the underlying capacitated multi-commodity network flow model and the need to consider a time-space network to ensure operational feasibility. Considering uncertain aspects is also difficult but important. In this paper we propose three approaches: solve a deterministic mixed integer program optimally; solve stochastic programs to obtain robust bounds on the solution; and, study alternative solutions to obtain their optimal cost vectors using inverse programming.

Keywords: Mixed Integer Program; Network Design Problem; Cost Vector; Equipment Selection; Service Network Design (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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_49

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

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

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