Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
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.
- Record URL:
- Summary URL:
-
Availability:
- Find a library where document is available. Order URL: www.trb.org/Main/Blurbs/168300.aspx
-
Authors:
- Fajardo, David
- Waller, S Travis
- Publication Date: 2012
Language
- English
Media Info
- Media Type: Print
- Features: Figures; References; Tables;
- Pagination: pp 113–121
- Monograph Title: Network Modeling 2012, Volume 1
-
Serial:
- Transportation Research Record: Journal of the Transportation Research Board
- Issue Number: 2283
- Publisher: Transportation Research Board
- ISSN: 0361-1981
Subject/Index Terms
- TRT Terms: Heuristic methods; Markov processes; Network links; Network nodes; Origin and destination; Policy; Routing; Stochastic processes
- Uncontrolled Terms: Cost minimization
- Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning;
Filing Info
- Accession Number: 01371510
- Record Type: Publication
- ISBN: 9780309223232
- Report/Paper Numbers: 12-2144
- Files: TRIS, TRB, ATRI
- Created Date: May 30 2012 3:02PM