Narrow your search

Library

KU Leuven (52)

UGent (2)

EHC (1)

KBR (1)


Resource type

dissertation (47)

book (6)


Language

English (33)

Dutch (15)

Undetermined (3)

German (2)


Year
From To Submit

2024 (1)

2023 (6)

2022 (5)

2021 (5)

2020 (4)

More...
Listing 1 - 10 of 53 << page
of 6
>>
Sort by

Book
Human-kinetic multiclass traffic flow theory and modelling : with application to Advanced Driver Assistance Systems in congestion.
Author:
ISBN: 9055840602 Year: 2004 Publisher: Delft Technische universiteit Delft

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Dissertation
Integrated algorithms for repeated dynamic traffic assignments : the iterative link transmission model with equilibrium assignment procedure
Authors: --- ---
Year: 2016

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords

MORO. --- Mobiliteit --- Wegvervoer.


Dissertation
Network design under variable demand and / or capacity conditions
Authors: --- ---
Year: 2009 Publisher: Leuven KUL. Faculteit ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Book
De verkeersknoop
Authors: --- --- ---
ISBN: 9789401411479 Year: 2013 Volume: *1 Publisher: Leuven Leuven LannooCampus Katholieke Universiteit Leuven. Metaforum

Loading...
Export citation

Choose an application

Bookmark

Abstract


Dissertation
Wartemodell für Gleissgruppen mit teilweiser Erreichbarkeit

Loading...
Export citation

Choose an application

Bookmark

Abstract

Keywords


Book
Decentralized Anticipatory Network Traffic Control
Authors: --- ---
Year: 2016 Publisher: Leuven KU Leuven.Faculteit ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

Intelligent Transportation Systems are a promising set of technological advancements, whose main objective is that of enabling road users and policymakers alike to better exploit the available transportation infrastructure at its best possible level of service. The reduced costs of collecting, storing and processing information are enabling the development of richer mathematical models, which in turn can be exploited to better understand and anticipate the behaviour of transportation networks. From the perspective of Dynamic Traffic Management policymakers, this is highly desirable: being able to correctly anticipate the behaviour of users travelling in a network has been historically recognized as a strict prerequisite to achieve system optimal performances. However, a gap can be found in the state-of-the-art between what’s theoretically achievable and what’s practically feasible. Existing anticipatory traffic control policies are defined in a fully centralized framework, where a single, global entity is responsible for determining the network-wide optimal control law. This is undesirable from two perspectives: on the one hand, no centralization exists in the real world where multiple (hierarchical and/or equivalent) controllers interact; on the other hand, the centralized problem is computationally complex. In the “control track” of this work, the aim is that of determining under which conditions such a centralized problem can be decomposed into smaller, distinct sub-problems. To achieve this goal, the problem is analysed both analytically from a time static point of view and empirically from a time dynamic perspective. Once the nature of the controller-to-controller interactions is established, controller-wise decomposition policies are developed, together with the respective conditions for optimality. Decomposed anticipatory control techniques are therefore introduced in form of algorithms, tested and validated through in-silico experiments. The developed methodologies are proven to be highly competitive with respect to fully centralized anticipatory control solutions, as well as very beneficial compared to standard, non-anticipatory techniques. The accuracy of transportation models, upon which the aforementioned dynamic traffic management policies are based, depend directly on the amount and quality of information that is retrieved from the underlying network. When dealing with anticipatory traffic control policies, this becomes a very stringent assumption, as information on the whole transportation network is needed to achieve system optimal behaviour. Installing and maintaining a set of sensors on a network to achieve network-wide information is though very expensive, therefore the problem of determining the minimum amount of sensors to be located on a network so to obtain this information has been defined and studied in literature. Full observability solutions to the Network Sensor Location Problem have been defined, however, the amount of sensors needed to obtain full information is still beyond what is economically viable. In the “sensing track” of this work, the main focus is thus on the problem of characterizing partial observability solutions, that is, solutions in which only a subset of all sensors needed to retrieve full information from the underlying network is available. A partial observability metric capable of capturing the indirect and partially known relationships between the observed and unobserved variables characterizing the network is developed, and exploited in simple heuristic algorithms to obtain the set and locations of sensors that maximizes the amount of partially recovered information. The implications of locating sensors according to this metric are studied in Origin/Destination matrix estimation procedures. Furthermore, the relationship between the route set enumeration technique utilized to obtain full observability solutions and the resulting quality and amount of information embedded therein is assessed empirically. The overall results show that selecting sensor locations according to the developed metric is beneficial both from the theoretical aspects of observability problems and from the practical point of view of flow-estimation methodologies.

Keywords

Theses


Book
Integrated Algorithms for Repeated Dynamic Traffic Assignments The Iterative Link Transmission Model with Equilibrium Assignment Procedure
Authors: --- ---
Year: 2016 Publisher: Leuven KU Leuven.Faculteit ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

The contributions of this research are situated on three main (individual) components and on the synergy that emerges when they are considered together. Dynamic network loading The contributions of this part are mainly the development of an iterative link transmission model scheme. Firstly, this semi-analytical simulation scheme allows a modeller to define a time resolution that is fit for the accuracy level required by the application. Secondly it is optimized to handle repeated evaluations efficiently, with a minimum of redundant calculations. Shortest path algorithm A second mostly separate development is the presentation of an efficient dynamic shortest path algorithm. This procedure is required to guide traffic along the shortest paths in dynamic user equilibrium (DUE) and to evaluate travel times in the network. The contributions of this part are more or less in line with the previous part on the dynamic network loading. Namely, the method does not have any bounds on the time resolution and it handles repeated evaluations efficiently. Dynamic user equilibrium Although the dynamic user equilibrium is composed of the two previous parts, the most important contribution here is the development of calculation schemes that are able to exploit the opportunities of the previously introduced procedures. As a result any supplementary method, which provides the same functionality and benefits, could in theory replace one of two (or both) methods of the previous parts. To our knowledge is this the first time that these procedure have been developed simultaneously to amplify the effect of combining them in one application. The fact that all three components have been developed bearing in mind this synergy, is perhaps the largest contribution of this work.

Keywords

Theses


Book
Optimization-based Iterative Learning for Anticipatory Traffic Signal Control
Authors: --- --- ---
Year: 2015 Publisher: Leuven KU Leuven.Faculteit ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

In urban traffic networks, delays at signal-controlled interactions are a main component of the travel time experienced by road users. Effective optimization of traffic signal control offers high opportunities to reduce delays and overall to improve traffic operations. A strategic network traffic signal control policy, also called anticipatory network traffic control, determines signal timings to optimize network-wide objectives, e.g. minimize network travel times. While optimizing control variables, anticipatory traffic control explicitly takes into account road users’ route choice responses and the resulting network flow patterns. A traffic assignment model is usually used for approximating this route choice response. The basic problem in implementing anticipatory network control in a real-life system is that: due to the inherent model-reality mismatch of this approximated response model, the true resulting traffic pattern will in general not be optimal; signal control using incorrect anticipation might even trigger undesired traffic conditions, for instance unexpected delays, traffic congestion and spillback. Hence, since a model will unavoidably represent a coarse approximation of reality, there is a need for introducing corrective measures to deal with the model-reality mismatch and in turn achieve an effective control. The general aim of this PhD research is to develop control methods that elevate the traffic system to its best achievable performance, by explicitly addressing the model-reality mismatch. We take advantage of the fact that routine traffic patterns repeat from day to day, allowing one to learn from observing the true traffic patterns, resulting from a response to control, to compensate for errors in the response model. The solution method is initially inspired from industrial applications in robot manipulator, which have a similar objective, i.e improving performance of unknown / uncertain systems that operate repeatedly. A rule-based Iterative Learning Control (ILC) is applied to the traffic signal setting. The operational signal timings are iteratively corrected to achieve the predefined desired traffic state. The basic idea behind the iterative learning approach is to learn from the errors between observations and the desired reference. Following this basic idea of learning from observed errors, an optimization-based iterative learning approach is elaborated in the anticipatory control context. By making use of the traffic assignment model, the desired state is no longer predefined, but rather endogenously optimized. A method of Iterative Optimizing Control with Model Bias Correction (IOCMBC) is then proposed. IOCMBC generates a sequence of control settings based on a first-order model bias correction. Control performance is improved by learning from the model bias between real measurements and model predictions. It is proven that IOCMBC has two desirable properties: convergence in real traffic operations, and consistency between the convergent point and the real optimum. An integrated framework is then presented to jointly perform IOCMBC and model parameter estimation. The objective is to complete the iterative optimizing control scheme in which the underlying network flow modeling is imperfectly calibrated. Two objectives are fulfilled by this integrated framework, i.e. better control for the real system, and better model calibration. This integrated approach is advantageous to applications in which the underlying model is not only used for designing optimal control, but also for supporting other traffic management measures, for instance traffic information or route guidance. In order to link the methodology to general network applications, the key algorithmic implementation issue regarding the calculation of flow sensitivity is later addressed. We present a method to estimate the derivative of real flows with respect to signal control variables; this derivative information is particularly important in choosing directions to improve control optimization objectives. The derivative estimation method obviates the need to explicitly explore sensitivity by adding perturbations on each individual control variable, and hence allows for multiple control variables. By an evaluation on the derivative estimation, two types of estimation errors are revealed, i.e. truncation error and noise error. The presence of measurement noise is particularly detrimental to the estimation, which ultimately affects the quality of control solutions. A reliable dual method, i.e. dual IOCMBC is then proposed, improving both optimization objective and derivative estimation during the control process. Dual IOCMBC is able to generate a control sequence that converges to the real optimal point, and meanwhile forms a basis for estimation of the real flow derivatives. Numerical experiments on a general midsize network present an important intermediate step towards field implementations.

Keywords

Theses


Book
Optimal Signal Settings with Transit Signal Priority
Authors: --- ---
Year: 2016 Publisher: Leuven KU Leuven.Faculteit ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

Traffic signals and queues at intersections are major components of public transportation (transit) delay. Active transit signal priority (TSP) strategies are used as an effective way of reducing that delay. They can be divided in green split adjustment and phase resequencing measures. However, the effectiveness of TSP strategies is dependent on the traffic conditions, the frequency of priority requests, and their specific impact on the signal control. Some strategies can add significant delay to non-priority flows. From the transit operator’s point of view, this becomes problematic when an intersection contains several conflicting transit lines in mixed traffic conditions. Serving priority for one phase can lead to substantial additional delay for a transit line served by another phase. In networks, TSP strategies could cause spillbacks to other intersections serving transit lines. From the road operator’s point of view, spillbacks of non-priority flows are mostly not desired. The key feature of a proper multimodal optimization of the signal settings is to take conflicting objectives into account in a balanced manner. In this research, models and insights are delivered for optimizing signal settings (i.e. offsets, green splits and cycle lengths) when TSP strategies are applied. The focus is on active TSP strategies such as phase extension (i.e. green extension), phase advance (i.e. red truncation), and phase resequencing strategies like rotation of the transit phase for early service, insertion of an extra transit phase, and skipping of non-priority phases. The thesis can be divided in three research parts: 1) Development and validation of a new stochastic traffic and optimization model CAPACITEL for optimizing green splits, cycle lengths of isolated intersections (chapter 3) and extra optimization dimension of offsets of corridors with TSP (chapter 4). 2) Development and validation of analytical formulas for optimal signal settings of isolated intersections with transit signal priority using CAPACITEL (chapter 6 and chapter 5); 3) Comparison of the effectiveness of various active TSP strategies for isolated intersections (chapter 7 and chapter 8) and in combination with coordination recovery strategies for arterials (chapter 9). In the first part, new signal setting formulas are proposed for optimizing the green splits and cycle lengths. The scope of these equations is isolated intersections when TSP strategies are applied, applicable for undersaturated, near-saturated and oversaturated traffic demands. Webster’s optimal green split and cycle length formulas are still considered relevant in many signal timing manuals. However, TSP strategies can influence the optimal green splits and cycle lengths of isolated intersections. These effects are now researched for adapting the Webster formulas accordingly. For updating the Webster formulas for a multimodal environment, signal settings are optimized for various combinations of the following parameters: intersection flow ratio, transit and non-transit phase flow ratio, transit frequency, detector location, lost time, and the type of TSP strategy. The coefficients of the new formulas are then calibrated with those results by a linear regression analysis. Two categories of formulas of minimal delay are identified: 1) TSP strategies with limited capacity shift like phase rotation in combination with green extension, but without red truncation (chapter 5); 2) TSP strategies with red truncation (chapter 6); TSP strategies with red truncation significantly change green splits. A new optimal green split formula is developed that is applicable for 2, 3 and 4-phase intersections. The critical lane method – as proposed by Webster – is used for calculating the green splits for TSP strategies without red truncation. The main reason is that a TSP request impacts the green split significantly when red truncation is applied. When milder TSP strategies are used, the green split is hardly influenced when considering a full hour of simulation. For both categories of TSP, a new optimal cycle length formula is suggested. The regression formula for the TSP strategies with red truncation has 29 parameters and correlations of those parameters. The number of parameters and their correlations in the formula is limited to 3 for the strategies without red truncation. The latter formula is thus more suitable for practitioners and easier to use. Both categories of formulas have a significantly better performance in minimizing delay compared to existing alternatives and are best applicable for near-saturated and oversaturated traffic demands. In the second part of the research, various TSP strategies are compared on their effectiveness in reducing person or vehicle delay. A dynamic TSP control with an early call detection and a confirmation detection is developed and compared with full priority in chapter 7. For comparing their effectiveness, a sensitivity analysis is performed for different intersection flow ratios, weights for the performance function, location of the detector and impact of a transit stop. Dynamic TSP is preferred in undersaturated conditions because of its flexibility of redistributing green lengths without going to oversaturation. When the intersection gets saturated, the favour shifts to full priority with a short distance detector (150m). Transit stops shift the favour towards a TSP strategy with a detector beyond the stop. Twelve TSP strategies are compared for their effectiveness in chapter 8. The impact of these TSP strategies is investigated for undersaturated, near-saturated and oversaturated conditions for a wide range of transit and traffic demand scenarios. In order to guarantee a fair comparison, the basic signal settings are optimized and tailored to each TSP strategy and demand so that the total person delay at the intersection is properly minimized. This is in contrast with chapter 7 where TSP strategies were applied after the optimization of the signal settings. Phase skipping and strategies that apply red truncation are not effective in reducing person delay. They are mostly effective in reducing bus delay but they come at a cost of adding person delay to other users. Green extension, phase insertion, phase insertion with green extension and phase rotation with green extension appear to be the most effective TSP strategies in minimizing intersection person delay. For undersaturated conditions the choice of the TSP strategy has a limited effect on the objective function and travel time reliability. Once an intersection reaches near-saturated or undersaturated conditions, strategies with red truncation or phase skipping shouldn’t be used. In the last part, the performance of a new stochastic mesomodel for corridors, CAPACITEL, is validated. CAPACITEL incorporates microscopic arrivals and departures, but models spillbacks and queues macroscopically. By using less detail for the queuing, it is able to perform simulations a lot faster than VISSIM. That makes the model more suitable for optimization purposes. On the other hand, CAPACITEL is detailed enough to simulate buses and grasp the stochastic impact of TSP strategies on the signal settings and the corresponding flows. Besides the aforementioned TSP strategies, a fixed cycle length and a green compensation strategy is available for coordination recovery after a transit vehicle is served. In this way local – i.e. serving TSP – and global – i.e. arterial progression – multimodal objectives can be combined. The optimization of the signal settings in CAPACITEL is split in three subproblems. Green splits, cycle lengths and offsets are optimized in series with the new multimodal formulas of chapter 5 as a starting point. When optimizing the network, the optimization of each subproblem starts at the heaviest loaded intersection. Neighbouring intersections are optimized one by one starting from the heaviest loaded intersection till the end of the arterial. CAPACITEL demonstrates its superiority for optimizing the signal settings of multimodal arterials by outperforming TRANSYT15 for a test case in Zeebrugge, Belgium. In conclusion, a decision tree is developed where all the insights from this research are incorporated. This decision tree proposes a methodology for designing optimal multimodal signal settings.

Keywords

Theses


Dissertation
Mobility as a service in residential areas: the effect of price setting on profitability and sustainability
Authors: --- ---
Year: 2019 Publisher: Leuven KU Leuven. Faculteit Ingenieurswetenschappen

Loading...
Export citation

Choose an application

Bookmark

Abstract

This study aims to discover the effects of introducing a MaaS operator in a residential area on the sustainability of that area. In addition, it aims to reveal whether such a MaaS operator is able to be economically viable. The price setting of the MaaS operator will be the major parameter to influence sustainability and profitability. In contrast with most pilot projects where MaaS in introduced in an urban environment, this study performs a case study in a non-urbanised, residential area in Herent, Flanders, Belgium. The demand of the area is simulated based on statistical averages. Each inhabitant is attributed a package that may consist of MaaS or may consist of a personal vehicle. To attribute these packages, a utility-based model is used that calculates the expected utility of a package for an inhabitant's set of weekly trips. It will turn out that MaaS is able to reduce the total $CO_2$ emission in residential areas substantially. In addition, whether such a MaaS operator is able to make profit seems to depend on scale advantages, subsidies and deals with public transport providers.

Keywords

Listing 1 - 10 of 53 << page
of 6
>>
Sort by