This file is part of IDEAS, which uses RePEc data


[ Papers | Articles | Software | Books | Chapters | Authors | Institutions | JEL Classification | NEP reports | Search | New papers by email | Author registration | Rankings | Volunteers | FAQ | Blog | Help! ]

Optimal Routing for Maximizing the Travel Time Reliability

Author info | Abstract | Publisher info | Download info | Related research | Statistics
Author Info
Yueyue Fan ()
Yu Nie
Abstract

Optimal path problems are important in many science and engineering fields. Performance criteria may vary in coping with uncertainty, such as expectation, reliability, value at risk, etc. In this paper, we will first summarize our recent work on a dynamic programming based optimal path algorithm for maximizing the time reliability. We then study the convergence properties of the algorithm by introducing two special successive approximation sequences. Finally we will show the connection between the maximum reliability problem and the shortest and k-shortest path problems. Copyright Springer Science + Business Media, LLC 2006

Download Info
To download:

If you experience problems downloading a file, check if you have the proper application to view it first. Information about this may be contained in the File-Format links below. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

File URL: http://hdl.handle.net/10.1007/s11067-006-9287-6
File Format: text/html
File Function:
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Publisher Info
Article provided by Springer in its journal Networks and Spatial Economics.

Volume (Year): 6 (2006)
Issue (Month): 3 (September)
Pages: 333-344
Download reference. The following formats are available: HTML (with abstract), plain text (with abstract), BibTeX, RIS (EndNote, RefMan, ProCite), ReDIF
Handle: RePEc:kap:netspa:v:6:y:2006:i:3:p:333-344

Contact details of provider:
Web page: http://www.springerlink.com/link.asp?id=106607

For technical questions regarding this item, or to correct its listing, contact: (Guenther Eichhorn) or (Christopher F. Baum).

Related research
Keywords: Shortest path problem; Dynamic programming; Stochastic networks; Reliability; Successive approximation;

Statistics
Access and download statistics

Did you know? There are NEP reports in over 80 fields that deliver new research to your email.

This page was last updated on 2010-3-20.

This information is provided to you by IDEAS at the Department of Economics, College of Liberal Arts and Sciences, University of Connecticut using RePEc data on a server sponsored by the Society for Economic Dynamics.