EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Simultaneous Departure Time/Ro...
  • More details
Cover Image

Simultaneous Departure Time/Route Choices in Queuing Networks and a Novel Paradox

Year of publication:
2010
Authors: Zhang, Xiaoning ; Zhang, H.
Published in:
Networks and Spatial Economics. - Springer, ISSN 1566-113X. - Vol. 10.2010, 1, p. 93-112
Publisher: Springer
Subject: Dynamic traffic assignment (DTA) | Simultaneous departure time and route (SDR) choices | Braess’s paradox | First-In-First-Out (FIFO) | Bottleneck models
Saved in:
  • More details
Extent:
text/html
Type of publication: Article
Source:
RePEc - Research Papers in Economics
Persistent link: https://www.econbiz.de/10008615278
    • EndNote
    • BibTeX
    • Zotero, Mendeley, RefWorks, ...
    • Text
Saved in favorites
    Similar items by subject
    • The Dynamics of Iterated Transportation Simulations

      Nagel, Kai, (2000)

    • Submission to the DTA2012 special issue: a case for higher-order traffic flow models in DTA

      Mohan, Ranju, (2015)

    • Locating inefficient links in a large-scale transportation network

      Sun, Li, (2015)

    • More ...
    Similar items by person
    • Game-theoretical models for competition analysis in a new emerging liner container shipping market

      Wang, Hua, (2014)

    • Service charge and capacity selection of an inland river port with location-dependent shipping cost and service congestion

      Tan, Zhijia, (2015)

    • On the morning commute problem with bottleneck congestion and parking space constraints

      Yang, Hai, (2013)

    • More ...
    A service of the
    zbw
    • Sitemap
    • Plain language
    • Accessibility
    • Contact us
    • Imprint
    • Privacy

    Loading...