V.L. Knoop
Please Note
19 records found
1
This thesis extends the classical bathtub model — a network-level traffic model driven by average density — with an explicit, path-dependent congestion variable representing the spatial extent of congestion in the network. To calibrate the model, loop detector data from 124 weekday mornings on the A10 ring road in Amsterdam (January–June 2018) were used to construct empirical congestion measures. Three candidate congestion measures were compared — density spread, an unweighted congestion fraction, and a density–weighted variant — on their ability to characterise the network congestion state. The density–weighted measure was selected based on superior fit to observed network speeds (R2 = 0.960). Empirical analysis established a critical density threshold ρcrit ≈ 17.2 veh km−1 above which congestion onset and recovery follow asymmetric paths, captured by a dynamical system with separate build-up and recovery rates. Calibration confirmed that congestion builds approximately 31% faster than it dissipates. Forward simulation of the calibrated model reproduces the hysteresis loops observed on the A10.
The model offers a tractable basis for traffic management applications such as ramp metering, variable speed limits, and congestion pricing, enabling prediction of the asymmetric dynamics of morning rush congestion. A current limitation is that inflow is treated as exogenous, producing an unrealistically sharp gridlock sensitivity. Incorporating observed inflow data is identified as the most important direction for future work. ...
This thesis extends the classical bathtub model — a network-level traffic model driven by average density — with an explicit, path-dependent congestion variable representing the spatial extent of congestion in the network. To calibrate the model, loop detector data from 124 weekday mornings on the A10 ring road in Amsterdam (January–June 2018) were used to construct empirical congestion measures. Three candidate congestion measures were compared — density spread, an unweighted congestion fraction, and a density–weighted variant — on their ability to characterise the network congestion state. The density–weighted measure was selected based on superior fit to observed network speeds (R2 = 0.960). Empirical analysis established a critical density threshold ρcrit ≈ 17.2 veh km−1 above which congestion onset and recovery follow asymmetric paths, captured by a dynamical system with separate build-up and recovery rates. Calibration confirmed that congestion builds approximately 31% faster than it dissipates. Forward simulation of the calibrated model reproduces the hysteresis loops observed on the A10.
The model offers a tractable basis for traffic management applications such as ramp metering, variable speed limits, and congestion pricing, enabling prediction of the asymmetric dynamics of morning rush congestion. A current limitation is that inflow is treated as exogenous, producing an unrealistically sharp gridlock sensitivity. Incorporating observed inflow data is identified as the most important direction for future work.
Modelling changing travel behaviour in response to road capacity reductions
The impact of reallocating road space in urban areas on car use
Using a three-step iterative framework, the model adjusts the traffic demand based on observed travel times in response to capacity reductions. The process accounts for modal shifts, destination changes and trip frequency reduction. The methodology is applied to a real-world case study where significant road space reallocation is implemented, allowing for an evaluation of the extent and mechanisms of disappearing traffic.
Findings indicate that a considerable share of the traffic does not reroute but instead disappears due to behavioural changes. The extent of disappearing traffic depends on the severity of capacity reductions, the existing congestion levels on both intervening and alternative routes, and the availability of viable transport alternatives. The findings highlight the importance of incorporating adaptive travel behaviour in transport models to better support decision-making in sustainable urban mobility planning.
This research contributes to the growing body of knowledge on the effects of road capacity reductions and provides a modelling framework for policymakers and urban planners to anticipate and manage disappearing traffic effects effectively.
...
Using a three-step iterative framework, the model adjusts the traffic demand based on observed travel times in response to capacity reductions. The process accounts for modal shifts, destination changes and trip frequency reduction. The methodology is applied to a real-world case study where significant road space reallocation is implemented, allowing for an evaluation of the extent and mechanisms of disappearing traffic.
Findings indicate that a considerable share of the traffic does not reroute but instead disappears due to behavioural changes. The extent of disappearing traffic depends on the severity of capacity reductions, the existing congestion levels on both intervening and alternative routes, and the availability of viable transport alternatives. The findings highlight the importance of incorporating adaptive travel behaviour in transport models to better support decision-making in sustainable urban mobility planning.
This research contributes to the growing body of knowledge on the effects of road capacity reductions and provides a modelling framework for policymakers and urban planners to anticipate and manage disappearing traffic effects effectively.
Keep Traffic Moving: Safeguarding Traffic Accessibility during Temporary Roadworks
A Microsimulation-based Case Study Complemented with Expert Validation
Lateral position differences showed a stronger correlation with speed difference than longitudinal position differences. The highest roll rates and angles occurred during the overtaking phase. Pre-overtaking, higher roll rates and angles were observed when e-bikes overtook other e-bikes, indicating greater control adjustments. No significant gender differences were found in overtaking behavior. However, in non-interactive scenarios, male e-scooter riders traveled at higher speeds than females, while no gender differences were observed among e-bike riders. These results provide insights into the complex interactions between different types of micromobility vehicles during overtaking maneuvers. The findings underscore the need for targeted safety interventions and infrastructure improvements to mitigate risks associated with shared cycling spaces, ensuring safer coexistence of micromobility users and conventional cyclists in urban environments. ...
Lateral position differences showed a stronger correlation with speed difference than longitudinal position differences. The highest roll rates and angles occurred during the overtaking phase. Pre-overtaking, higher roll rates and angles were observed when e-bikes overtook other e-bikes, indicating greater control adjustments. No significant gender differences were found in overtaking behavior. However, in non-interactive scenarios, male e-scooter riders traveled at higher speeds than females, while no gender differences were observed among e-bike riders. These results provide insights into the complex interactions between different types of micromobility vehicles during overtaking maneuvers. The findings underscore the need for targeted safety interventions and infrastructure improvements to mitigate risks associated with shared cycling spaces, ensuring safer coexistence of micromobility users and conventional cyclists in urban environments.
PSEs, such as football games or large concerts, typically result in concentrated vehicle arrivals within a limited time period, leading to increased traffic flow, potential disruptions, elevated emissions, and safety concerns in nearby areas. By optimizing parking space allocation strategies in the parking lot, this project seeks to improve overall traffic management and relieve these challenges.
To achieve this, a linear programming (LP) algorithm and a simulation-based genetic algorithm (GA) are employed to search for the optimal solution. While the LP model offers computational efficiency, it has limitations in incorporating different route conditions. To address this, an agent-based simulation is constructed to depict the interaction and movement of vehicles within the parking lot. The simulation-based GA utilizes objective values derived from the simulation, providing a more comprehensive basis for finding the optimal solution. The allocation process considers factors such as parking lot layout, vehicle entry time step, and specific parking rules including road directions within the parking lot.
Results demonstrate that the optimal strategy obtained from the simulation-based GA outperforms comparison groups. The simulation-based GA showcases its ability to converge on the optimal solution within a large solution area. The optimal strategy saving time for all vehicles, particularly during periods of high demand. Effective parking is achieved by allocating parking spaces according to the arrival order and positioning vehicles on the left or right based on their arrival order and parking space location.
By employing these methods, this project offers a valuable contribution to the field of parking space allocation in the parking lot during PSEs, enhancing the overall parking experience for event attendees. ...
PSEs, such as football games or large concerts, typically result in concentrated vehicle arrivals within a limited time period, leading to increased traffic flow, potential disruptions, elevated emissions, and safety concerns in nearby areas. By optimizing parking space allocation strategies in the parking lot, this project seeks to improve overall traffic management and relieve these challenges.
To achieve this, a linear programming (LP) algorithm and a simulation-based genetic algorithm (GA) are employed to search for the optimal solution. While the LP model offers computational efficiency, it has limitations in incorporating different route conditions. To address this, an agent-based simulation is constructed to depict the interaction and movement of vehicles within the parking lot. The simulation-based GA utilizes objective values derived from the simulation, providing a more comprehensive basis for finding the optimal solution. The allocation process considers factors such as parking lot layout, vehicle entry time step, and specific parking rules including road directions within the parking lot.
Results demonstrate that the optimal strategy obtained from the simulation-based GA outperforms comparison groups. The simulation-based GA showcases its ability to converge on the optimal solution within a large solution area. The optimal strategy saving time for all vehicles, particularly during periods of high demand. Effective parking is achieved by allocating parking spaces according to the arrival order and positioning vehicles on the left or right based on their arrival order and parking space location.
By employing these methods, this project offers a valuable contribution to the field of parking space allocation in the parking lot during PSEs, enhancing the overall parking experience for event attendees.
A natural cycling experiment with 10 participants is conducted, where data is collected similar to the capabilities of e-bike IoT modules (GNSS, power and IMU data) and participants are asked to cycle through Delft, The Netherlands. The data is combined with a traffic accident dataset from the Dutch government, where intersections with accidents are labelled dangerous. The cycling data is separated into separate intersection approaches, based on positional data. Metrics based on power and cadence data show the most significant statistical difference (p-values <0.02) and the largest effect size (Cohen's d >0.80) at dangerous intersections. A binary classification model is trained on the dataset, which can correctly predict whether an intersection is dangerous or safe with an accuracy of 68,2%, a specificity of 50,0%, and a sensitivity of 24,2%. This prediction is based on the metrics of a single intersection approach.
To investigate the viability of using geofencing to implement low-speed areas at designated dangerous intersections, a simulation is carried out to determine the minimum size of a geofence that effectively slows down e-bike cyclists. The minimal effective geofence size to limit a cyclist's speed at an intersection is determined by simulating cyclists approaching a geofence for several geofence perimeters, incline levels, and wind speeds. The e-bike's motor stops supporting when the geofence is entered and the cyclist is cycling above a target speed. The minimal effective geofence size ranges from 50 to 300+ m and depends on the target speed, wind speed, and road incline.
This study shows that cycling data can be used to identify dangerous intersections. Enforcing a slower speed on intersections with local geofencing is not feasible, as the geofences have to be extremely large, showing a lot of overlap on other intersections in cities due to high intersection density. Future work can be done on the intersection risk estimation method and the feasibility of speed-limiting geofences that employ active braking. ...
A natural cycling experiment with 10 participants is conducted, where data is collected similar to the capabilities of e-bike IoT modules (GNSS, power and IMU data) and participants are asked to cycle through Delft, The Netherlands. The data is combined with a traffic accident dataset from the Dutch government, where intersections with accidents are labelled dangerous. The cycling data is separated into separate intersection approaches, based on positional data. Metrics based on power and cadence data show the most significant statistical difference (p-values <0.02) and the largest effect size (Cohen's d >0.80) at dangerous intersections. A binary classification model is trained on the dataset, which can correctly predict whether an intersection is dangerous or safe with an accuracy of 68,2%, a specificity of 50,0%, and a sensitivity of 24,2%. This prediction is based on the metrics of a single intersection approach.
To investigate the viability of using geofencing to implement low-speed areas at designated dangerous intersections, a simulation is carried out to determine the minimum size of a geofence that effectively slows down e-bike cyclists. The minimal effective geofence size to limit a cyclist's speed at an intersection is determined by simulating cyclists approaching a geofence for several geofence perimeters, incline levels, and wind speeds. The e-bike's motor stops supporting when the geofence is entered and the cyclist is cycling above a target speed. The minimal effective geofence size ranges from 50 to 300+ m and depends on the target speed, wind speed, and road incline.
This study shows that cycling data can be used to identify dangerous intersections. Enforcing a slower speed on intersections with local geofencing is not feasible, as the geofences have to be extremely large, showing a lot of overlap on other intersections in cities due to high intersection density. Future work can be done on the intersection risk estimation method and the feasibility of speed-limiting geofences that employ active braking.
Traffic signals in a coordinated network normally use a common cycle length which remains constant at all times, including when there is a request for priority from a public transport vehicle. This enables green waves to be maintained effectively but can limit the signals' ability to promptly serve the prioritised vehicle.
To study the effects of momentarily relaxing the constraint of cycle length during Transit Signal Priority (TSP) interventions, a new TSP system is developed for a CRSV halfstarre traffic signal controller, which permits a flexible cycle length during priority interventions. That system is tested using a Vissim microsimulation of a simple fictional network, and compared to the existing fixed-cycle-length TSP system included with the controller.
The new TSP system permits TSP actions as long as it is expected that the signal can return to its normal "in sync" timings within two cycles. During the intervention, the positive and negative impacts on each signal phase are monitored, and "Offset Correction Credits" are distributed, which each represent one second of additional green time. Signal phases which received extra time during the TSP intervention will receive negative OC Credits, and phases which were truncated will receive positive OC Credits. Once the intervention is complete, the signal will execute "offset correction" to return the signal to its normal "In Sync" timings while redeeming OC Credits.
The subject road network consists of fictional road with three coordinated traffic
signals, spaced 150 metres and 400 metres apart. The central intersection is the capacity-critical intersection and also includes a frequent bus line (12 buses per hour per direction) travelling along a median busway perpendicular to the coordinated direction.
In the scenario with a high flexibility to reduce green durations, the average delay for late buses dropped by 59% from 10.7 secondsto 4.4 seconds for the flexible-cycle system compared to the fixed-cycle system. With low flexibility, the average delay for late buses dropped by 78% from 28.0 seconds to 6.2 seconds. The large improvements in performance for buses are due to the flexible-cycle TSP systems being able to execute more TSP actions such as phase insertions which may not fit within a fixed cycle length.
However, the controller’s ability to remain in sync was negatively impacted and the frequency of queues exceeding storage increased by as much as 70% on short roadway links. However on long roadway links, delaysand queue lengths decreased in the coordinated directions thanks to the new TSP system’s green time compensation mechanism.
When the assumed occupancy rate for late buses is 50 passengers (corresponding to a busy but not overcrowded standard bus), there was no significant difference in person-delay between any of the scenarios. Early buses were not included in the calculation for average person-delay. ...
Traffic signals in a coordinated network normally use a common cycle length which remains constant at all times, including when there is a request for priority from a public transport vehicle. This enables green waves to be maintained effectively but can limit the signals' ability to promptly serve the prioritised vehicle.
To study the effects of momentarily relaxing the constraint of cycle length during Transit Signal Priority (TSP) interventions, a new TSP system is developed for a CRSV halfstarre traffic signal controller, which permits a flexible cycle length during priority interventions. That system is tested using a Vissim microsimulation of a simple fictional network, and compared to the existing fixed-cycle-length TSP system included with the controller.
The new TSP system permits TSP actions as long as it is expected that the signal can return to its normal "in sync" timings within two cycles. During the intervention, the positive and negative impacts on each signal phase are monitored, and "Offset Correction Credits" are distributed, which each represent one second of additional green time. Signal phases which received extra time during the TSP intervention will receive negative OC Credits, and phases which were truncated will receive positive OC Credits. Once the intervention is complete, the signal will execute "offset correction" to return the signal to its normal "In Sync" timings while redeeming OC Credits.
The subject road network consists of fictional road with three coordinated traffic
signals, spaced 150 metres and 400 metres apart. The central intersection is the capacity-critical intersection and also includes a frequent bus line (12 buses per hour per direction) travelling along a median busway perpendicular to the coordinated direction.
In the scenario with a high flexibility to reduce green durations, the average delay for late buses dropped by 59% from 10.7 secondsto 4.4 seconds for the flexible-cycle system compared to the fixed-cycle system. With low flexibility, the average delay for late buses dropped by 78% from 28.0 seconds to 6.2 seconds. The large improvements in performance for buses are due to the flexible-cycle TSP systems being able to execute more TSP actions such as phase insertions which may not fit within a fixed cycle length.
However, the controller’s ability to remain in sync was negatively impacted and the frequency of queues exceeding storage increased by as much as 70% on short roadway links. However on long roadway links, delaysand queue lengths decreased in the coordinated directions thanks to the new TSP system’s green time compensation mechanism.
When the assumed occupancy rate for late buses is 50 passengers (corresponding to a busy but not overcrowded standard bus), there was no significant difference in person-delay between any of the scenarios. Early buses were not included in the calculation for average person-delay.
Speed limits and their effect on freeway capacity
An investigation of two lane freeway bottlenecks
This study focuses specifically on the first part i.e., estimating the amount of fuel consumed by heavy duty trucks in the European Union and thereby determine the emissions being produced. The main objective is to examine whether an approach of machine learning could be a viable option to predict fuel consumption. This thesis is part of the AEROFLEX project and was done in collaboration with TNO, which provided all the data-sets required for the study.
The idea was to explore the regime of machine learning for one time step ahead prediction of fuel consumption. Furthermore, this study also focused on the development of another model by not using any variables affected by the driver as input into the training model. This exclusion was necessary to make sure the model remained adaptive to new routes and new trucks, especially because large scale on-road testing of the newly developed trucks is impossible and also because this way would help predict the fuel consumed by a truck without the necessity of it driving on a road. The study concludes with a comparison with an existing simulation model at TNO and provide an alternative machine learning solution. It also provides a comparison between different machine learning techniques and suggest the most accurate one.
It was found that machine learning could potentially be used to predict the amount of fuel consumed by a long haul heavy duty truck driving on a motorway. It was also found that engine torque was the variable that affected the fuel consumption of the truck the most. Furthermore, Neural Network was the most potent algorithm among all the other learning techniques for both the models developed in this study with it performing better than the simulation tool by a factor of approximately 3.8 in the model where the driver/drive influenced inputs were not considered in the training data-set. The results obtained from this work at a sampling frequency of 10 Hz. (i.e., 0.1 seconds) are comparable to the ones reported by other sources at a sampling rate of 0.016 Hz. (i.e., 1 minute) or 0.0016 Hz. (i.e., 10 minutes). This goes on to say that the machine learning algorithms are also potent at much higher sampling frequencies.
...
This study focuses specifically on the first part i.e., estimating the amount of fuel consumed by heavy duty trucks in the European Union and thereby determine the emissions being produced. The main objective is to examine whether an approach of machine learning could be a viable option to predict fuel consumption. This thesis is part of the AEROFLEX project and was done in collaboration with TNO, which provided all the data-sets required for the study.
The idea was to explore the regime of machine learning for one time step ahead prediction of fuel consumption. Furthermore, this study also focused on the development of another model by not using any variables affected by the driver as input into the training model. This exclusion was necessary to make sure the model remained adaptive to new routes and new trucks, especially because large scale on-road testing of the newly developed trucks is impossible and also because this way would help predict the fuel consumed by a truck without the necessity of it driving on a road. The study concludes with a comparison with an existing simulation model at TNO and provide an alternative machine learning solution. It also provides a comparison between different machine learning techniques and suggest the most accurate one.
It was found that machine learning could potentially be used to predict the amount of fuel consumed by a long haul heavy duty truck driving on a motorway. It was also found that engine torque was the variable that affected the fuel consumption of the truck the most. Furthermore, Neural Network was the most potent algorithm among all the other learning techniques for both the models developed in this study with it performing better than the simulation tool by a factor of approximately 3.8 in the model where the driver/drive influenced inputs were not considered in the training data-set. The results obtained from this work at a sampling frequency of 10 Hz. (i.e., 0.1 seconds) are comparable to the ones reported by other sources at a sampling rate of 0.016 Hz. (i.e., 1 minute) or 0.0016 Hz. (i.e., 10 minutes). This goes on to say that the machine learning algorithms are also potent at much higher sampling frequencies.
New Intersection Control for Conventional and Automated Vehicles without Traffic Lights
A combination of individual control and self-regulation
How to calibrate a pedestrian simulation model
An investigation into how the choices of scenarios and metrics influence the calibration
Car-Following Model using Machine Learning Techniques
Approach at Urban Signalized Intersections with Traffic Radar Detection