ČVUT DSpace
  • Search DSpace
  • Čeština
  • Login
  • Čeština
  • Čeština
View Item 
  •   ČVUT DSpace
  • Czech Technical University in Prague
  • Faculty of Transportation Sciences
  • Department of Applied Mathematics
  • Master Theses - 16111
  • View Item
  • Czech Technical University in Prague
  • Faculty of Transportation Sciences
  • Department of Applied Mathematics
  • Master Theses - 16111
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Snížení doby jízdy v městské dopravní síti pomocí lokálního směrování

Local level routing to reduce travel times in urban networks

Type of document
diplomová práce
master thesis
Author
Maia Pereira André
Supervisor
Přibyl Ondřej
Opponent
Dieckmann Claudia
Field of study
Inteligentní dopravní systémy
Study program
Technika a technologie v dopravě a spojích
Institutions assigning rank
ústav aplikované matematiky
Defended
2019-01-15



Rights
A university thesis is a work protected by the Copyright Act. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one?s own expense. The use of thesis should be in compliance with the Copyright Act http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf and the citation ethics http://knihovny.cvut.cz/vychova/vskp.html
Vysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem http://www.mkcr.cz/assets/autorske-pravo/01-3982006.pdf a citační etikou http://knihovny.cvut.cz/vychova/vskp.html
Metadata
Show full item record
Abstract
The thesis explores the concept of local level routing, where vehicles receive either travel times or route advice based on accurate short-term traffic conditions to reroute themselves throughout a network. We focus on developing a system to provide time-dependent road travel times considering information of signal timings, queue lengths, road closures and vehicle arrivals, in which traffic controllers model the movement of vehicles and share their knowledge about the traffic amongst themselves as a flexible centralized or distributed system. Our motivation is to reduce travel times, avoid congestion and balance the load of vehicles throughout the network. In order to achieve this, we first analyse how similar route guidance systems estimate travel times and define optimal routes. Then, we study possible solutions for the optimal route problem, specially shortest-path algorithms, and we defined the necessary inputs for the chosen algorithm type. After that, we research methods for estimation of discrete time-dependent travel times and decide to propose an event-based traffic theoretic model that models the driving behaviour of vehicles and cope with the restrictions of communication bandwidth between traffic controllers, the necessity of certain degree of prediction, and running time in larger networks, while feeding an deterministic queueing model that ensures estimations within a horizon of planning. We describe the functionality of our proposed system and evaluate it through simulations of a real-world scenario for several penetration rates, comparing it against the best, worst and current situations cases. Finally, we discuss the performance and future work for our local level routing system.
 
The thesis explores the concept of local level routing, where vehicles receive either travel times or route advice based on accurate short-term traffic conditions to reroute themselves throughout a network. We focus on developing a system to provide time-dependent road travel times considering information of signal timings, queue lengths, road closures and vehicle arrivals, in which traffic controllers model the movement of vehicles and share their knowledge about the traffic amongst themselves as a flexible centralized or distributed system. Our motivation is to reduce travel times, avoid congestion and balance the load of vehicles throughout the network. In order to achieve this, we first analyse how similar route guidance systems estimate travel times and define optimal routes. Then, we study possible solutions for the optimal route problem, specially shortest-path algorithms, and we defined the necessary inputs for the chosen algorithm type. After that, we research methods for estimation of discrete time-dependent travel times and decide to propose an event-based traffic theoretic model that models the driving behaviour of vehicles and cope with the restrictions of communication bandwidth between traffic controllers, the necessity of certain degree of prediction, and running time in larger networks, while feeding an deterministic queueing model that ensures estimations within a horizon of planning. We describe the functionality of our proposed system and evaluate it through simulations of a real-world scenario for several penetration rates, comparing it against the best, worst and current situations cases. Finally, we discuss the performance and future work for our local level routing system.
 
URI
http://hdl.handle.net/10467/80467
View/Open
PLNY_TEXT (5.844Mb)
POSUDEK (81.70Kb)
POSUDEK (91.74Kb)
POSUDEK (708.7Kb)
Collections
  • Diplomové práce - 16111 [14]

České vysoké učení technické v Praze copyright © 2016 

DSpace software copyright © 2002-2016  Duraspace

Contact Us | Send Feedback
Theme by 
@mire NV
 

 

Useful links

CTU in PragueCentral library of CTUAbout CTU Digital LibraryResourcesStudy and library skillsResearch support

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

České vysoké učení technické v Praze copyright © 2016 

DSpace software copyright © 2002-2016  Duraspace

Contact Us | Send Feedback
Theme by 
@mire NV