Towards Intelligent Road Traffic Management over Weighted Large Graphs Hybrid Meta-heuristic-Based Approach

This paper introduces a new approach of hybrid meta-heuristics based optimization technique for decreasing the computation time of the shortest paths algorithm. The problem of finding the shortest paths is a combinatorial optimization problem which has been well studied from various fields. The number of vehicles on the road has increased incredibly. Therefore, traffic management has become a major problem. We study the traffic network in large scale routing problems as a field of application. The meta-heuristic we propose introduces new hybrid genetic algorithm named IOGA. The problem consists of finding the k optimal paths that minimizes a metric such as distance, time, etc. Testing was performed using an exact algorithm and meta-heuristic algorithm on random generated network instances. Experimental analyses demonstrate the efficiency of our proposed approach in terms of runtime and quality of the result. Empirical results obtained show that the proposed algorithm outperforms some of the existing technique in term of the optimal solution in every generation.

Towards Intelligent Road Traffic Management Over a Weighted Large Graphs Hybrid Meta-Heuristic-Based Approach

This paper introduces a new approach of hybrid meta-heuristics based optimization technique for decreasing the computation time of the shortest paths algorithm. The problem of finding the shortest paths is a combinatorial optimization problem which has been well studied from various fields. The number of vehicles on the road has increased incredibly. Therefore, traffic management has become a major problem. We study the traffic network in large scale routing problems as a field of application. The meta-heuristic we propose introduces new hybrid genetic algorithm named IOGA. The problem consists of finding the k optimal paths that minimizes a metric such as distance, time, etc. Testing was performed using an exact algorithm and meta-heuristic algorithm on random generated network instances. Experimental analyses demonstrate the efficiency of our proposed approach in terms of runtime and quality of the result. Empirical results obtained show that the proposed algorithm outperforms some of the existing technique in term of the optimal solution in every generation.

Optimizing Public Passenger Transport in Bucharest and the Metropolitan Area

The paper aims to be a model of analysis on passenger transport management for Bucharest and the metropolitan area, in order to stimulate the economic development of the city by supporting economic activities of local interest, by increasing the mobility of the transport system, economic activities that benefit local communities and that do not adversely affect people's health or the environment. The analysis presented proposes the use of geospatial information systems for urban traffic management and the construction of traffic simulation models.

Research on the Intelligent Assignment Model of Urban Traffic Planning Based on Optimal Path Optimization Algorithm

Congestion and complexity in the field of highway transportation have risen steadily in recent years, particularly because the growth rate of vehicles has far outpaced the growth rate of roads and other transportation facilities. To ensure smooth traffic, reduce traffic congestion, improve road safety, and reduce the negative impact of air pollution on the environment, an increasing number of traffic management departments are turning to new scientifically developed technology. The urban road traffic is simulated by nodes and sidelines in this study, which is combined with graph theory, and the information of real-time changes of road traffic is added to display and calculate the relevant data and parameters in the road. On this foundation, the dynamic path optimization algorithm model is discussed in the context of high informationization. Although the improved algorithm’s optimal path may not be the conventional shortest path, its actual travel time is the shortest, which is more in line with users’ actual travel needs to a large extent.

Data collection protocols for VANETs: a survey

We live in the era of Intelligent Transport Systems (ITS), which is an extension of Vehicular AdHoc Networks (VANETs). In VANETs, vehicles act as nodes connected with each other and sometimes with a public station. Vehicles continuously exchange and collect information to provide innovative transportation services; for example, traffic management, navigation, autonomous driving, and the generation of alerts. However, VANETs are extremely challenging for data collection, due to their high mobility and dynamic network topologies that cause frequent link disruptions and make path discovery difficult. In this survey, various state-of-the-art data collection protocols for VANETs are discussed, based on three broad categories, i.e., delay-tolerant, best-effort, and real-time protocols. A taxonomy is designed for data collection protocols for VANETs that is essential to add precision and ease of understandability. A detailed comparative analysis among various data collection protocols is provided to highlight their functionalities and features. Protocols are evaluated based on three parametric phases. First, protocols investigation based on six necessary parameters, including delivery and drop ratio, efficiency, and recovery strategy. Second, a 4-D functional framework is designed to fit most data collection protocols for quick classification and mobility model identification, thus eradicating the need to read extensive literature. In the last, in-depth categorical mapping is performed to deep dive for better and targeted interpretation. In addition, some open research challenges for ITS and VANETs are discussed to highlight research gaps. Our work can thus be employed as a quick guide for researchers to identify the technical relevance of data collection protocols of VANETs.