|
Title: Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
Accession Number: 01371510
Record Type: Component
Record URL: Availability: Transportation Research Board Business Office 500 Fifth Street, NW Find a library where document is available 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.
Monograph Title: Monograph Accession #: 01450929
Report/Paper Numbers: 12-2144
Language: English
Authors: Fajardo, DavidWaller, S TravisPagination: pp 113–121
Publication Date: 2012
ISBN: 9780309223232
Media Type: Print
Features: Figures; References; Tables
TRT Terms: Uncontrolled Terms: Subject Areas: Highways; Planning and Forecasting; I72: Traffic and Transport Planning
Files: TRIS, TRB, ATRI
Created Date: Feb 8 2012 5:08PM
More Articles from this Serial Issue:
|