Modeling Network Transition Constraints with Hypergraphs

Steven Harrod ()
Additional contact information
Steven Harrod: Department of Management Information Systems, Operations Management, and Decision Sciences, University of Dayton, Dayton, Ohio 45469

Transportation Science, 2011, vol. 45, issue 1, 81-97

Abstract: Discrete time dynamic graphs are frequently used to model multicommodity flows or activity paths through constrained resources, but simple graphs fail to capture the interaction effects of resource transitions. The resulting schedules are not operationally feasible, and return inflated objective values. A directed hypergraph formulation is derived to address railway network sequencing constraints, and an experimental problem sample solved to estimate the magnitude of objective inflation when interaction effects are ignored. The model is used to demonstrate the value of advance scheduling of train paths on a busy North American railway.

Keywords: directed hypergraphs; discrete networks; railway scheduling (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (20)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1100.0337 (application/pdf)

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:inm:ortrsc:v:45:y:2011:i:1:p:81-97

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().