Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    Have you forgotten your password?
Repository logo
  • Communities & Collections
  • Research Outputs
  • Fundings & Projects
  • People
  • Statistics
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Italiano
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    Have you forgotten your password?
  1. Home
  2. Indian Institute of Technology Madras
  3. Publication7
  4. Sample-based algorithm to determine minimum robust cost path with correlated link travel times
 
  • Details
Options

Sample-based algorithm to determine minimum robust cost path with correlated link travel times

Date Issued
01-01-2014
Author(s)
Prakash, Arun
Karthik K Srinivasan 
Indian Institute of Technology, Madras
DOI
10.3141/2467-12
Abstract
Truvel time reliability is an important and desirable property in route and depurttire time choice, especially for a risk-averse traveler. Thus, optimizing lor reliability has seen growing interest in the recent past in transportation and also in the fields of computer science, stochastic optimization, and so forth. The present study addressed reliability optimization under uncertainty, in which travel time distributions were represented with a sample. The weighted mean-standard deviation measure (robust cost) was adopted as a metric of reliability. The minimum robust cost path problem with link travel times following a general correlation structure was addressed. A sampling-based approach, which had been relatively unused, was adopted from the literature to capture and represent spatial correlations. A novel network transformation and pruning procedure was proposed to determine an exact solution to the problem while circumventing the high dimensionality of the formulations in the literature. Computation experiments demonstrated the efficacy of the algorithm on real-world networks. The impact of the sample approximation on finding the true optimal solution or the population was quantified and found to be acceptable.
Volume
2467
Indian Institute of Technology Madras Knowledge Repository developed and maintained by the Library

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Cookie settings
  • Privacy policy
  • End User Agreement
  • Send Feedback