Road Intersection Improvement – Main Step for Emission Reduction and Fuel Economy

This article demonstrates the changes made in the intersection model using PTV Vissim have an impact on reducing an amount of GHG and fuel consumption. One of the most problematic intersections in Namangan, Uzbekistan, was selected and traffic flow during peak hours was studied in order to prepare the simulation of the intersection. The article offers two types of solution as so to lessen the amount of toxic gases and fuel consumption. In the first solution, the situation was improved by optimizing the phase of the traffic light and by changing the cycle duration. The second solution was to reduce the amount of toxic gases and fuel consumption from vehicles by changing the geometric dimensions of the intersection. After the implementation of both solutions, the current state of LOS was raised from D to A level.

On the Helly Property of Some Intersection Graphs

An EPG graph G is an edge-intersection graph of paths on a grid. In this thesis, we analyze structural characterizations and complexity aspects regarding EPG graphs. Our main focus is on the class of B1-EPG graphs whose intersection model satisfies well-known the Helly property, called Helly-B1-EPG. We show that the problem of recognizing Helly-B1-EPG graphs is NP-complete. Besides, other intersection graph classes such as VPG, EPT, and VPT were also studied. We completely solve the problem of determining the Helly and strong Helly numbers of Bk-EPG graphs and Bk-VPG graphs for each non-negative integer k. Finally, we show that every Chordal B1-EPG graph is at the intersection of VPT and EPT.

Representation and Reasoning of Three-Dimensional Spatial Relationships Based on R5DOS-Intersection Model Representation and Reasoning Based on R5DOS Model

This paper aims to disclose the compound topological and directional relationships of three simple regions in the three-dimensional (3D) space. For this purpose, the directional model and the 8-intersection model were coupled into an R5DOS-intersection model and used to represent three simple regions in the 3D space. The matrices represented by the model were found to be complete and mutually exclusive. Then, a self-designed algorithm was adopted to solve the model, yielding 11,038 achievable topological and directional relationships. Compared with the minimum bounding rectangle (MBR) model, the proposed model boasts strong expressive power. Finally, our model was applied to derive the topological and directional relationships between simple regions A and C from the known relationships between simple regions A and B and those between B and C. Based on the results, a compound relationship reasoning table was established for A and C. The research results shed new light on the representation and reasoning of 3D spatial relationships.

Cellular Automata Intersection Model

This paper introduces a cellular automaton design of intersections and defines rules to model traffic flow through them, so that urban traffic can be simulated. The model is able to simulate an intersection of up to four streets crossing. Each street can have a variable number of lanes. Furthermore, each lane can serve multiple purposes at the same time, like allowing vehicles to keep going straight or turn left and/or right. The model also allows the simulation of intersections with or without traffic lights and slip lanes. A comparison to multiple empirical intersection traffic data shows that the model is able to realistically reproduce traffic flow through an intersection. In particular, car following times in free flow and the required time value for drivers that turn within the intersection or go straight through it are reproduced. At the same time, important empirical jam characteristics are retained.