FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W11807714> ?p ?o ?g. }

• W11807714 endingPage "208" @default.
• W11807714 startingPage "171" @default.
• W11807714 abstract "Transportation networks are subject to a large degree of uncertainty due to traveler behavior, recurring congestion, capacity variability (construction zones, traffic incidents), variation in demands, etc.. resulting in unstable and unpredictable trip travel times. This has led to an emphasis on travel time reliability as a key determinant of route choice and an important measure of system performance, thus motivating research on optimizing travel time reliability on such stochastic networks. In this context, this work proposes an algorithm to compute the path of minimum robust cost (defined as a weighted combination of mean squared and variance of path travel time) on a network with stochastic and correlated link travel times.The proposed approach involves transforming the robust cost objective to a link separable or sum of squares form. Based on this formulation, a related multiple objective optimization problem is defined, and it is shown that the optimal robust cost path must lie in the non-dominated solution set of the multiple objective problem. Thus, a label correcting procedure for the multicriteria shortest path problem is applied to compute the non-dominated set and hence, the path of minimum robust cost. In addition, a new criterion of dominance is proposed (permutation invariant non-dominance or PIND) to reduce the size of the non-dominated path set while maintaining optimality with respect to the robust path problem. An approximate label correcting type procedure is developed to compute this reduced path set. Empirical experiments on a real-world network indicate that the PIND path set is significantly smaller than the corresponding ND set (between 60% and 95% on tested networks). In addition, computational tests on synthetic networks of size up to 1,500 nodes (7,500 links) demonstrate the efficiency of the proposed heuristic (computational time < 35 s) in computing the path of minimum robust cost on sparse/moderately dense (links to nodes ratio < 5) networks of size less than 500 nodes. The study also underscores the role of variability, correlations, and risk attitudes on benefits obtained from minimizing robust cost, and the suboptimality of the independence assumption." @default.
• W11807714 created "2016-06-24" @default.
• W11807714 creator A5000538134 @default.
• W11807714 creator A5039264010 @default.
• W11807714 date "2011-08-30" @default.
• W11807714 modified "2023-09-25" @default.
• W11807714 title "An Algorithm for the Minimum Robust Cost Path on Networks with Random and Correlated Link Travel Times" @default.
• W11807714 cites W1527511816 @default.
• W11807714 cites W1969261977 @default.
• W11807714 cites W1972886737 @default.
• W11807714 cites W1974399255 @default.
• W11807714 cites W1976699101 @default.
• W11807714 cites W1982649161 @default.
• W11807714 cites W1994015283 @default.
• W11807714 cites W2004894471 @default.
• W11807714 cites W2016049811 @default.
• W11807714 cites W2023727736 @default.
• W11807714 cites W2028186501 @default.
• W11807714 cites W2033564834 @default.
• W11807714 cites W2034204928 @default.
• W11807714 cites W2036868106 @default.
• W11807714 cites W2039114216 @default.
• W11807714 cites W2046236705 @default.
• W11807714 cites W2046916960 @default.
• W11807714 cites W2048608180 @default.
• W11807714 cites W2049345634 @default.
• W11807714 cites W2057742448 @default.
• W11807714 cites W2058794637 @default.
• W11807714 cites W2062568266 @default.
• W11807714 cites W2066145367 @default.
• W11807714 cites W2081730757 @default.
• W11807714 cites W2091253199 @default.
• W11807714 cites W2092499098 @default.
• W11807714 cites W2114251562 @default.
• W11807714 cites W2119702428 @default.
• W11807714 cites W2123784360 @default.
• W11807714 cites W4243529478 @default.
• W11807714 doi "https://doi.org/10.1007/978-1-4614-0947-2_11" @default.
• W11807714 hasPublicationYear "2011" @default.
• W11807714 type Work @default.
• W11807714 sameAs 11807714 @default.
• W11807714 citedByCount "9" @default.
• W11807714 countsByYear W118077142014 @default.
• W11807714 countsByYear W118077142015 @default.
• W11807714 countsByYear W118077142017 @default.
• W11807714 countsByYear W118077142018 @default.
• W11807714 countsByYear W118077142020 @default.
• W11807714 countsByYear W118077142021 @default.
• W11807714 crossrefType "book-chapter" @default.
• W11807714 hasAuthorship W11807714A5000538134 @default.
• W11807714 hasAuthorship W11807714A5039264010 @default.
• W11807714 hasConcept C11413529 @default.
• W11807714 hasConcept C2777735758 @default.
• W11807714 hasConcept C2778753846 @default.
• W11807714 hasConcept C31258907 @default.
• W11807714 hasConcept C41008148 @default.
• W11807714 hasConceptScore W11807714C11413529 @default.
• W11807714 hasConceptScore W11807714C2777735758 @default.
• W11807714 hasConceptScore W11807714C2778753846 @default.
• W11807714 hasConceptScore W11807714C31258907 @default.
• W11807714 hasConceptScore W11807714C41008148 @default.
• W11807714 hasLocation W118077141 @default.
• W11807714 hasOpenAccess W11807714 @default.
• W11807714 hasPrimaryLocation W118077141 @default.
• W11807714 hasRelatedWork W2023505575 @default.
• W11807714 hasRelatedWork W2059974767 @default.
• W11807714 hasRelatedWork W2329809794 @default.
• W11807714 hasRelatedWork W2351491280 @default.
• W11807714 hasRelatedWork W2371125232 @default.
• W11807714 hasRelatedWork W2371447506 @default.
• W11807714 hasRelatedWork W2386767533 @default.
• W11807714 hasRelatedWork W3013034866 @default.
• W11807714 hasRelatedWork W303980170 @default.
• W11807714 hasRelatedWork W4248042515 @default.
• W11807714 isParatext "false" @default.
• W11807714 isRetracted "false" @default.
• W11807714 magId "11807714" @default.
• W11807714 workType "book-chapter" @default.