MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Computation for Design and Optimization
  • Computation for Design and Optimization - Master's degree
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Theses - Computation for Design and Optimization
  • Computation for Design and Optimization - Master's degree
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Approximation of the transient joint queue-length distribution in tandem networks

Author(s)
Yamani, Jana H. (Jana Hashim)
Thumbnail
DownloadFull printable version (6.532Mb)
Other Contributors
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Advisor
Carolina Osorio.
Terms of use
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
Metadata
Show full item record
Abstract
This work considers an urban traffic network, and represents it as a Markovian queueing network. This work proposes an analytical approximation of the time-dependent joint queue-length distribution of the network. The challenge is to provide an accurate analytical description of between and within queue (i.e. link) dynamics, while deriving a tractable approach. In order to achieve this, we use an aggregate description of queue states (i.e. state space reduction). These are referred to as aggregate (queue-length) distributions. This reduces the dimensionality of the joint distribution. The proposed method is formulated over three different stages: we approximate the time-dependent aggregate distribution of 1) a single queue, 2) a tandem 3-queue network, 3) a tandem network of arbitrary size. The third stage decomposes the network into overlapping 3-queue sub-networks. The methods are validated versus simulation results. We then use the proposed tandem network model to solve an urban traffic signal control problem, and analyze the added value of accounting for time-dependent between queue dependency in traffic management problems for congested urban networks.
Description
Thesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2013.
 
Cataloged from PDF version of thesis.
 
Includes bibliographical references (pages 95-97).
 
Date issued
2013
URI
http://hdl.handle.net/1721.1/85470
Department
Massachusetts Institute of Technology. Computation for Design and Optimization Program.
Publisher
Massachusetts Institute of Technology
Keywords
Computation for Design and Optimization Program.

Collections
  • Computation for Design and Optimization - Master's degree
  • Computation for Design and Optimization - Master's degree

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.