scholarly journals Towards Alleviating Traffic Congestion: Optimal Route Planning for Massive-Scale Trips

2020 ◽  
Author(s):  
Ke Li ◽  
Lisi Chen ◽  
Shuo Shang
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Route Planning ◽  
Exact Algorithm ◽  
Optimal Route ◽  
Time Cost ◽  
Traffic Flow Management ◽  
Massive Scale ◽  
Global Travel ◽  
Insight Into

We investigate the problem of optimal route planning for massive-scale trips: Given a traffic-aware road network and a set of trip queries Q, we aim to find a route for each trip such that the global travel time cost for all queries in Q is minimized. Our problem is designed for a range of applications such as traffic-flow management, route planning and congestion prevention in rush hours. The exact algorithm bears exponential time complexity and is computationally prohibitive for application scenarios in dynamic traffic networks. To address the challenge, we propose a greedy algorithm and an epsilon-refining algorithm. Extensive experiments offer insight into the accuracy and efficiency of our proposed algorithms.

scholarly journals Traffic Congestion Alleviation over Dynamic Road Networks: Continuous Optimal Route Combination for Trip Query Streams

2021 ◽  
Author(s):  
Ke Li ◽  
Lisi Chen ◽  
Shuo Shang ◽  
Panos Kalnis ◽  
Bin Yao
Keyword(s):  
Traffic Congestion ◽  
Road Network ◽  
Route Planning ◽  
Exact Algorithm ◽  
Optimal Route ◽  
Traffic Flow Management ◽  
Total Travel Time ◽  
Query Streams ◽  
Dynamic Road Networks ◽  
Insight Into

Route planning and recommendation have attracted much attention for decades. In this paper, we study a continuous optimal route combination problem: Given a dynamic road network and a stream of trip queries, we continuously find an optimal route combination for each new query batch over the query stream such that the total travel time for all routes is minimized. Each route corresponds to a planning result for a particular trip query in the current query batch. Our problem targets a variety of applications, including traffic-flow management, real-time route planning and continuous congestion prevention. The exact algorithm bears exponential time complexity and is computationally prohibitive for application scenarios in dynamic traffic networks. To address this problem, a self-aware batch processing algorithm is developed in this paper. Extensive experiments offer insight into the accuracy and efficiency of our proposed algorithms.

scholarly journals An Air Route Network Planning Model of Logistics UAV Terminal Distribution in Urban Low Altitude Airspace

2021 ◽  
Vol 13 (23) ◽  
pp. 13079
Author(s):  
Shan Li ◽  
Honghai Zhang ◽  
Zhuolun Li ◽  
Hao Liu
Keyword(s):  
Traffic Congestion ◽  
Urban Areas ◽  
Network Planning ◽  
Search Time ◽  
Route Planning ◽  
Planning Model ◽  
Optimal Route ◽  
Logistics Distribution ◽  
Route Network ◽  
Low Altitude

Traditional terminal logistics distribution in urban areas is mainly concentrated on the ground, which leads to increasingly serious air pollution and traffic congestion. With the popularization of unmanned aerial vehicle (UAV) techniques and the reform of low altitude airspace, terminal logistics distribution is expected to be carried out by drones. Therefore, it is of great significance to construct a reasonable air route network for logistics UAV to ensure the safety and efficiency of operations. In this paper, a single route planning model and an air route network planning model for UAV were constructed by fully considering the complex urban low altitude environment, the flight performance of UAV and the characteristics of logistics tasks to regulate the flights of drones. Then, taking Jiangjun Road Campus of Nanjing University of Aeronautics and Astronautics as an example, the improved cellular automata (CA) was adopted to search for the optimal route between different waypoints, and the optimal spanning tree algorithm was used to construct the route network. The experimental results demonstrated that the improved CA could greatly reduce search time and obtain the optimal route while enhancing safety. With the satisfaction of the voyage, the needs of logistics and distribution constraints, a network that had smaller intersection points and redundancy was generated. The models and core ideas proposed in this paper can not only regulate operation of drones but also provide a solid foundation for the distribution of logistics UAV in the future.

scholarly journals Route planning on orienteering maps with least-cost path analysis

2021 ◽  
Vol 4 ◽  
pp. 1-7
Author(s):  
Gáspár Albert ◽  
Zsófia Sárközy
Keyword(s):  
Land Cover ◽  
Linear Function ◽  
Road Network ◽  
Route Planning ◽  
Time Cost ◽  
Least Cost Path ◽  
Setting Process ◽  
Cost Surface ◽  
Least Cost Path Analysis ◽  
The Ideal

Abstract. The feature categories of an orienteering map are prepared to allow the map reader to estimate the travel time between any two points on the map with a good approximation. This requires not only an accurate map, but also a key that adapts to the speed of travel. Such map key is developed and maintained by the IOF (International Orienteering Federation), and technically all the orienteering maps are compiled by using it. Estimated time also plays an important role in planning the courses of orienteering races. The course setter estimates time based on a route he thinks is ideal, but the speed of travel is basically a non-linear function of terrain, road network and land cover. Because of this, the easiest (ideal) route between the two points and its time cost can be calculated using the least-cost path (LCP) GIS method, which can be prepared to take into account these three map feature categories. This method is based on the calculation of a cost surface, then the analysis of the ideal path from a given point to the destination. The automation can be adapted to any orienteering map due to the similarities of the map keys. This study shows that if the weight corresponding to the different feature categories is given properly, the ideal path between two points on orienteering maps can be calculated. The ideal path, however is still a subjective category, which may depend on the capabilities and preferences of the orienteer. In this study the routes calculated with the LCP method were compared with the suggestions of the ideal routes by orienteering runners of different ages. The results show that the routes given by sportsmen can be simulated with the LCP method and even the time cost of the calculated routes can be calculated. This study can lay the groundwork for a GIS tool helping the course setting process on standard orienteering maps.

scholarly journals Personalized Route Planning System Based on Driver Preference

Sensors ◽  
2021 ◽  
Vol 22 (1) ◽  
pp. 11
Author(s):  
Ren Wang ◽  
Mengchu Zhou ◽  
Kaizhou Gao ◽  
Ahmed Alabdulwahab ◽  
Muhyaddin J. Rawa
Keyword(s):  
Road Network ◽  
Route Planning ◽  
Multiple Objectives ◽  
Experimental Results ◽  
Planning System ◽  
Search Process ◽  
Navigation Systems ◽  
Optimal Route ◽  
Computation Cost ◽  
Route Navigation

At present, most popular route navigation systems only use a few sensed or measured attributes to recommend a route. Yet the optimal route considered by drivers needs be based on multiple objectives and multiple attributes. As a result, these existing systems based on a single or few attributes may fail to meet such drivers’ needs. This work proposes a driver preference-based route planning (DPRP) model. It can recommend an optimal route by considering driver preference. We collect drivers’ preferences, and then provide a set of routes for their choice when they need. Next, we present an integrated algorithm to solve DPRP, which speeds up the search process for recommending the best routes. Its computation cost can be reduced by simplifying a road network and removing invalid sub-routes. Experimental results demonstrate its effectiveness.

Impact of the urban construction solutions on the safety population

2020 ◽  
Vol 17 (2) ◽  
pp. 66-73
Author(s):  
R. D. Oktyabrskiy
Keyword(s):  
Traffic Congestion ◽  
Urban Population ◽  
Road Network ◽  
Residential Development ◽  
Emergency Situations ◽  
Urban Construction ◽  
Safety Population ◽  
Peace And War ◽  
The City

The article is devoted to the justification of the need to reduce the population density in the residential development of cities. The analysis of vulnerability of the urban population from threats of emergency situations of peace and war time, and also an assessment of provision of the city by a road network is given. Proposals have been formulated to reduce the vulnerability of the urban population in the long term and to eliminate traffic congestion and congestion — jams.

Recent advances on urban taxi sharing systems with the path arrival probability

2020 ◽  
Vol 13 ◽  
Author(s):  
Dui Hongyan ◽  
Zhang Chi
Keyword(s):  
Failure Probability ◽  
Traffic Congestion ◽  
Optimal Strategy ◽  
Time Windows ◽  
Optimal Path ◽  
Route Planning ◽  
Driving Time ◽  
Load Rate ◽  
Travel Efficiency ◽  
Arrival Probability

Background : Taxi sharing is an emerging transportation arrangement that helps improve the passengers’ travel efficiency and reduce costs. This study proposes an urban taxi sharing system. Methods: Considering each side congestion of the transport network, their corresponding reliability and failure probability are analyzed. Under the constraints of the number of passengers and their own time windows, the analysis is performed on passengers whose optimal path is inclusive. Results: According to the optimal strategy, the different passengers can be arranged into the same taxi to realize the taxi sharing. Then the shared taxi route can be optimized. Conclusion: Due to the reasonable vehicle route planning and passenger combination, these can effectively alleviate the traffic congestion, save the driving time, reduce the taxi no-load rate, and save the driving distance. At last, a numerical example is used to demonstrate the proposed method.

scholarly journals Large-Scale Road Network Congestion Pattern Analysis and Prediction Using Deep Convolutional Autoencoder

2021 ◽  
Vol 13 (9) ◽  
pp. 5108
Author(s):  
Navin Ranjan ◽  
Sovit Bhandari ◽  
Pervez Khan ◽  
Youn-Sik Hong ◽  
Hoon Kim
Keyword(s):  
Traffic Congestion ◽  
Network Architecture ◽  
Road Network ◽  
Large Scale ◽  
Pattern Analysis ◽  
Image Data ◽  
Urban Life ◽  
Prediction Algorithm ◽  
Rapid Urbanization ◽  
Convolutional Autoencoder

The transportation system, especially the road network, is the backbone of any modern economy. However, with rapid urbanization, the congestion level has surged drastically, causing a direct effect on the quality of urban life, the environment, and the economy. In this paper, we propose (i) an inexpensive and efficient Traffic Congestion Pattern Analysis algorithm based on Image Processing, which identifies the group of roads in a network that suffers from reoccurring congestion; (ii) deep neural network architecture, formed from Convolutional Autoencoder, which learns both spatial and temporal relationships from the sequence of image data to predict the city-wide grid congestion index. Our experiment shows that both algorithms are efficient because the pattern analysis is based on the basic operations of arithmetic, whereas the prediction algorithm outperforms two other deep neural networks (Convolutional Recurrent Autoencoder and ConvLSTM) in terms of large-scale traffic network prediction performance. A case study was conducted on the dataset from Seoul city.

Sign in / Sign up

Export Citation Format

Share Document