Scenario-Scaping with Inverse Programming for Intermodal Transportation

Christina Naomi Burt; Jakob Puchinger

Scenario-Scaping with Inverse Programming for Intermodal Transportation

Christina Naomi Burt (Speaker), Jakob Puchinger

Research output: Chapter in Book or Conference Proceedings › Conference Proceedings with Oral Presentation

Abstract

We study an intermodal transportation problem over a long-term planning horizon where scenarios involving different equipment, location and network arcs are possible. We model the problem as a capacitated multi-commodity network flow problem and make use of inverse programming techniques to sketch the landscape of the uncertain scenario cost function to show when one scenario becomes preferable to another. We apply reduction, preprocessing and heuristic methods to solve some steps our procedure.

Original language	English
Title of host publication	INFORMS 2011 Annual Meeting
Publication status	Published - 2011
Event	INFORMS 2011 - Duration: 13 Nov 2011 → 16 Nov 2011

Conference

Conference	INFORMS 2011
Period	13/11/11 → 16/11/11

Research Field

Former Research Field - Mobility Systems

Cite this

@inproceedings{f65f4e30c2ca4a1cacc212004a2b50a5,

title = "Scenario-Scaping with Inverse Programming for Intermodal Transportation",

abstract = "We study an intermodal transportation problem over a long-term planning horizon where scenarios involving different equipment, location and network arcs are possible. We model the problem as a capacitated multi-commodity network flow problem and make use of inverse programming techniques to sketch the landscape of the uncertain scenario cost function to show when one scenario becomes preferable to another. We apply reduction, preprocessing and heuristic methods to solve some steps our procedure.",

author = "Burt, {Christina Naomi} and Jakob Puchinger",

year = "2011",

language = "English",

booktitle = "INFORMS 2011 Annual Meeting",

note = "INFORMS 2011 ; Conference date: 13-11-2011 Through 16-11-2011",

}

TY - GEN

T1 - Scenario-Scaping with Inverse Programming for Intermodal Transportation

AU - Puchinger, Jakob

A2 - Burt, Christina Naomi

PY - 2011

Y1 - 2011

N2 - We study an intermodal transportation problem over a long-term planning horizon where scenarios involving different equipment, location and network arcs are possible. We model the problem as a capacitated multi-commodity network flow problem and make use of inverse programming techniques to sketch the landscape of the uncertain scenario cost function to show when one scenario becomes preferable to another. We apply reduction, preprocessing and heuristic methods to solve some steps our procedure.

AB - We study an intermodal transportation problem over a long-term planning horizon where scenarios involving different equipment, location and network arcs are possible. We model the problem as a capacitated multi-commodity network flow problem and make use of inverse programming techniques to sketch the landscape of the uncertain scenario cost function to show when one scenario becomes preferable to another. We apply reduction, preprocessing and heuristic methods to solve some steps our procedure.

M3 - Conference Proceedings with Oral Presentation

BT - INFORMS 2011 Annual Meeting

T2 - INFORMS 2011

Y2 - 13 November 2011 through 16 November 2011

ER -

Scenario-Scaping with Inverse Programming for Intermodal Transportation

Abstract

Conference

Research Field

Fingerprint

Cite this