MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
  • DSpace@MIT Home
  • Operations Research Center
  • Operations Research Center Working Papers
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Modeling Travel Times in Dynamic Transportation Networks; A Fluid Dynamics Approach

Author(s)
Kachani, Soulaymane; Perakis, Georgia
Thumbnail
DownloadOR-353-01.pdf (1.949Mb)
Metadata
Show full item record
Abstract
In this paper, we take a fluid dynamics approach to determine the travel time in traversing a network's link. We propose a general model for travel time functions that utilizes fluid dynamics laws for compressible flow to capture a variety of flow patterns such as the formation and dissipation of queues, drivers' response to upstream congestion or decongestion and drivers' reaction time. We examine two variants of the model, in the case of separable velocity functions, which gives rise to two families of travel time functions for the problem; a polynomial and an exponential family. We analyze these travel time functions and examine several special cases. Our investigation also extends to the case of non-separable velocity functions starting with an analysis of the interaction between two links, and then extending it to the general case of acyclic networks.
Date issued
2001-04
URI
http://hdl.handle.net/1721.1/5224
Publisher
Massachusetts Institute of Technology, Operations Research Center
Series/Report no.
Operations Research Center Working Paper;OR 353-01

Collections
  • Operations Research Center Working Papers

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.