Finding minimum-cost dynamic routing policies in stochastic-state networks with link failures

Research output: Contribution to journalResearch articleContributedpeer-review

Contributors

  • David Fajardo - , University of New South Wales (Author)
  • S. Waller - , University of New South Wales (Author)

Abstract

The focus of this research is to develop minimum-cost dynamic routing policies that can identify connecting paths between nodes in a stochastic-state network. In this context, the stochastic element of the network is the network structure, that is, the set of links that exist under each realization of the network state. It is assumed that information about the true network state can be gathered only endogenously through the routing decisions themselves. As such, the objective becomes finding a dynamic policy that accounts for information gathered en route that minimizes the cost of detection of a viable path between a given origin and destination. An exact solution method, based on a Markovian decision process, is presented, and then a heuristic based on an aggregating function of the network is developed.

Details

Original languageEnglish
Pages (from-to)113-121
Number of pages9
JournalTransportation research record
Volume2283
Issue number1
Publication statusPublished - 12 Jan 2012
Peer-reviewedYes
Externally publishedYes

External IDs

ORCID /0000-0002-2939-2090/work/141543828