2026-09-18T22:52:34Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/293872022-01-13T07:54:48Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

William Weinstein and Cynthia Barnhart. Key, Jonathan Ramsay, 1976- Massachusetts Institute of Technology. Operations Research Center. Massachusetts Institute of Technology. Department of Civil and Environmental Engineering Massachusetts Institute of Technology. Operations Research Center 2005-10-14T20:15:57Z 2005-10-14T20:15:57Z 2004 2004 http://hdl.handle.net/1721.1/29387 56125179 Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Operations Research Center, 2004. Includes bibliographical references (p. 143-146). This thesis considers tlhe problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration factors such as the travel time variance. Additionally. such an approach implicitly assumes each user in the network has the same routing objective. In this thesis we develop an approach to routing in probabilistic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node. we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for a arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this thesis is the minimum travel time probability distribution. which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks. the minimum travel time distribution can be calculated efficiently. (cont.) For general, non-series-parallel networks. the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on three networks. The numerical results are obtained using an efficient implementation of the algorithms proposed in this thesis. We also consider the problem of generating an acyclic graph from a cyclic graph, and we propose a data structure that allows for the efficient calculation of the sum and minimum of independent random variables. by Jonathan Ramsay Key. S.M. 146 p. 5932340 bytes 5932149 bytes application/pdf application/pdf eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Civil and Environmental Engineering. Operations Research Center. Routing in probabilistic networks Thesis application/pdf false Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="7765fdfe-5f4e-473f-8503-eb7448f9b919"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Routing in probabilistic networks</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2004</PublicationDate> <Authors> <Author> <DisplayName>Key, Jonathan Ramsay, 1976-</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Civil and Environmental Engineering.</Keyword> <Keyword>Operations Research Center.</Keyword> <Abstract>This thesis considers tlhe problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration factors such as the travel time variance. Additionally. such an approach implicitly assumes each user in the network has the same routing objective. In this thesis we develop an approach to routing in probabilistic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node. we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for a arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this thesis is the minimum travel time probability distribution. which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks. the minimum travel time distribution can be calculated efficiently.</Abstract> <Abstract>(cont.) For general, non-series-parallel networks. the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on three networks. The numerical results are obtained using an efficient implementation of the algorithms proposed in this thesis. We also consider the problem of generating an acyclic graph from a cyclic graph, and we propose a data structure that allows for the efficient calculation of the sum and minimum of independent random variables.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>