TRB Pubsindex
Text Size:

Title:

Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures

Accession Number:

01371510

Record Type:

Component

Availability:

Transportation Research Board Business Office

500 Fifth Street, NW
Washington, DC 20001 United States
Order URL: www.trb.org/Main/Blurbs/168300.aspx

Find a library where document is available


Order URL: http://worldcat.org/isbn/9780309223232

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 Accession #:

01450929

Report/Paper Numbers:

12-2144

Language:

English

Authors:

Fajardo, David
Waller, S Travis

Pagination:

pp 113–121

Publication Date:

2012

Serial:

Transportation Research Record: Journal of the Transportation Research Board

Issue Number: 2283
Publisher: Transportation Research Board
ISSN: 0361-1981

ISBN:

9780309223232

Media Type:

Print

Features:

Figures; References; Tables

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: