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 Perencanaan Jaringan Trayek Ranting Angkutan Umum Perkotaan Jember (Feeder Route Planning of Public Transportation in Jember)

2016 ◽  
Vol 1 (01) ◽  
pp. 73
Author(s):  
Dewi Sri Asmoro Wulan ◽  
Sonya Sulistyono ◽  
Dwi Nurtanto
Keyword(s):  
Public Transport ◽  
Public Transportation ◽  
Urban Areas ◽  
Network Planning ◽  
Route Planning ◽  
Motor Vehicles ◽  
Land Use Patterns ◽  
Use Patterns ◽  
Route Network ◽  
Urban Public Transport

AbstractThe Reduce performance of urban public transport in Jember can not separated from several factors, among other are less convenient conditions in terms of service, overlapping route, no improvement for route network made by local authority, and cheap moator loans which cause many poeple use motor vehicles. The Worst effect if this thing continous increase population of motor vehicles. At the same time nowdays, new land-use patterns have grown in urban areas which potentially have large demand but still unserved by public transport. Seeing these problems, public branch route network planning is needed as well as the requirment of public transportation fleets in accordance with the legislation. From the planning conducted, it was found 8 plan branch routes and the fleet needs.From such palnning it was expected that it can reduce the overlapping route and accomodate all urban areas in order to served by public transport. Keyword: branch route network planning, legislation AbstrakMenurunnya kinerja angkutan umum perkotaan jember tidak lepas dari beberapa faktor antara lain kondisi kurang nyaman dalam segi pelayanan, overlapping trayek, belum dilakukan perbaikan jaringan trayek oleh pihak berwenang, dan kredit motor yang murah sehingga masyarakat banyak yang menggunakan kendaraan bermotor. Dampak terburuk bila hal ini terus berlanjut, populasi kendaraan bermotor akan meningkat tiap tahunnya. Kemacetan lalu lintas, pemborosan BBM serta polusi udara juga akan meningkat. Disaat yang sama saat ini mulai tumbuh pola tata guna lahan baru di wilayah perkotaan yang berpotensi demand besar namun belum terlayani angktan umum. Melihat masalah tersebut perlu dilakukan sebuah perencanaan jaringan trayek angkutan umum ranting dan kebutuhan armadanya yang sesuai dengan konsep perundang-undangan. Dari perencanaan yang dilakukan didapatkan 8 rute rencana serta kebutuhan armadanya. Diharapakan dari perencanaan tersebut dapat mengurangi overlapping dan mengakomodasi seluruh wilayah perkotaan agar terlayani oleh angkutan umum.Kata kunci: Perencanaan jarigan trayek ranting, Konsep peraturan perundang-undangan

scholarly journals Real-time urban regional route planning model for connected vehicles based on V2X communication

2020 ◽  
Vol 13 (1) ◽  
pp. 517-538 ◽  
Author(s):  
Pangwei Wang ◽  
Hui Deng ◽  
Juan Zhang ◽  
Mingfang Zhang
Keyword(s):  
Land Use ◽  
Travel Time ◽  
Real Time ◽  
Land Use Planning ◽  
Route Planning ◽  
Urban Traffic ◽  
Urban Transport ◽  
Connected Vehicles ◽  
Planning Model ◽  
Optimal Route

Advancement in the novel technology of connected vehicles has presented opportunities and challenges for smart urban transport and land use. To improve the capacity of urban transport and optimize land-use planning, a novel real-time regional route planning model based on vehicle to X communication (V2X) is presented in this paper. First, considering the traffic signal timing and phase information collected by V2X, road section resistance values are calculated dynamically based on real-time vehicular driving data. Second, according to the topology structure of the current regional road network, all predicted routes are listed based on the Dijkstra algorithm. Third, the predicted travel time of each alternative route is calculated, while the predicted route with the least travel time is selected as the optimal route. Finally, we design the test scenario with different traffic saturation levels and collect 150 sets of data to analyze the feasibility of the proposed method. The numerical results have shown that the average travel times calculated by the proposed optimal route are 8.97 seconds, 12.54 seconds, and 21.85 seconds, which are much shorter than the results of traditional navigation routes. This proposed model can be further applied to the whole urban traffic network and contribute to a greater transport and land-use efficiency in the future.

scholarly journals Accident Management System Based on Vehicular Network for an Intelligent Transportation System in Urban Environments

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Yusor Rafid Bahar Al-Mayouf ◽  
Omar Adil Mahdi ◽  
Namar A. Taha ◽  
Nor Fadzilah Abdullah ◽  
Suleman Khan ◽  
...  
Keyword(s):  
Real Time ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Traffic Management ◽  
Management System ◽  
Vehicular Ad Hoc Networks ◽  
Road Traffic ◽  
Route Planning ◽  
Accident Management ◽  
Planning Algorithm

As cities across the world grow and the mobility of populations increases, there has also been a corresponding increase in the number of vehicles on roads. The result of this has been a proliferation of challenges for authorities with regard to road traffic management. A consequence of this has been congestion of traffic, more accidents, and pollution. Accidents are a still major cause of death, despite the development of sophisticated systems for traffic management and other technologies linked with vehicles. Hence, it is necessary that a common system for accident management is developed. For instance, traffic congestion in most urban areas can be alleviated by the real-time planning of routes. However, the designing of an efficient route planning algorithm to attain a globally optimal vehicle control is still a challenge that needs to be solved, especially when the unique preferences of drivers are considered. The aim of this paper is to establish an accident management system that makes use of vehicular ad hoc networks coupled with systems that employ cellular technology in public transport. This system ensures the possibility of real-time communication among vehicles, ambulances, hospitals, roadside units, and central servers. In addition, the accident management system is able to lessen the amount of time required to alert an ambulance that it is required at an accident scene by using a multihop optimal forwarding algorithm. Moreover, an optimal route planning algorithm (ORPA) is proposed in this system to improve the aggregate spatial use of a road network, at the same time bringing down the travel cost of operating a vehicle. This can reduce the incidence of vehicles being stuck on congested roads. Simulations are performed to evaluate ORPA, and the results are compared with existing algorithms. The evaluation results provided evidence that ORPA outperformed others in terms of average ambulance speed and travelling time. Finally, our system makes it easier for ambulance to quickly make their way through traffic congestion so that the chance of saving lives is increased.

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 Dynamic Route Network Planning Problem for Emergency Evacuation in Restricted-Space Scenarios

2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Yi Hong ◽  
Deying Li ◽  
Qiang Wu ◽  
Hua Xu
Keyword(s):  
Graph Transformation ◽  
Network Planning ◽  
Classical Problem ◽  
Route Planning ◽  
Emergency Evacuation ◽  
Set Cover ◽  
Planning Problem ◽  
Geographic Space ◽  
Route Network ◽  
Dynamic Route

We investigate a dynamic route planning problem in restricted-space evacuation, namely, the Multiobjective Dynamic Route Network Planning (MODRNP) problem. It models the multisource to multidestination evacuation in restricted-space scenarios, with the objectives of minimizing the whole evacuation delay and maximizing the evacuation efficiency. We study the problem in 3D scenarios, which can provide intuition vision for the geographic space and contribute to the evacuation plan and implementation. Based on the auxiliary graph transformation, we propose a heuristic algorithm referred to the classical problem, Minimum Weighted Set Cover. We finally conduct extensive experiments to evaluate the performance of the proposed algorithm and give an application instance on a typical kind of restricted-space scenarios. The results indicate that the proposed algorithm outperforms the existing alternatives in terms of the utilization as well as timeliness.

scholarly journals Network Planning Method for Capacitated Metro-Based Underground Logistics System

2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Jianjun Dong ◽  
Wanjie Hu ◽  
Shen Yan ◽  
Rui Ren ◽  
Xiaojing Zhao
Keyword(s):  
Traffic Congestion ◽  
Urban Areas ◽  
Programming Model ◽  
Evaluation Model ◽  
Network Planning ◽  
Exact Algorithm ◽  
Planning Method ◽  
Mixed Integer ◽  
Logistics System ◽  
Metro System

Underground logistics system (ULS) tends to alleviate traffic congestion, increase city logistics efficiency, mitigate the negative effects of traditional logistics processes, and improve the sustainability of urban areas. However, the relatively high cost and risk of underground construction are serious obstacles to implementing ULS. Integrating ULS into modern metro system (M-ULS) is considered to be feasible and efficient to solve this problem. This paper aims at developing a metro system-based ULS network planning method. First, an evaluation model of underground freight volume was proposed considering service capacity, freight flow, and regional accessibility. Second, a set of mixed integer programming model was developed to solve the problem of optimal nodes’ location-allocation (LAP) in the network. Then, a hybrid algorithm was designed with a combination of E-TOPSIS, exact algorithm, and heuristic algorithm. Finally, two lines of Nanjing Metro were selected as a case to validate the proposed planning method. The results showed that the new system can significantly reduce the construction costs of ULS and alleviate traffic congestion. Moreover, the potential of metro stations and underground tunnels can be fully exploited to achieve higher logistics benefits.

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.

Smart Driving System for Improving Traffic Flow

2017 ◽  
Vol 7 (7) ◽  
pp. 236
Author(s):  
Rajesh Kumar Gupta ◽  
L. N. Padhy ◽  
Sanjay Kumar Padhi
Keyword(s):  
Traffic Flow ◽  
Traffic Congestion ◽  
Urban Areas ◽  
Adaptive Cruise Control ◽  
Human Perception ◽  
Cruise Control ◽  
Driving System ◽  
V2v Communication ◽  
Traffic Conditions ◽  
Cooperative Adaptive Cruise Control

Traffic congestion on road networks is one of the most significant problems that is faced in almost all urban areas. Driving under traffic congestion compels frequent idling, acceleration, and braking, which increase energy consumption and wear and tear on vehicles. By efficiently maneuvering vehicles, traffic flow can be improved. An Adaptive Cruise Control (ACC) system in a car automatically detects its leading vehicle and adjusts the headway by using both the throttle and the brake. Conventional ACC systems are not suitable in congested traffic conditions due to their response delay.  For this purpose, development of smart technologies that contribute to improved traffic flow, throughput and safety is needed. In today’s traffic, to achieve the safe inter-vehicle distance, improve safety, avoid congestion and the limited human perception of traffic conditions and human reaction characteristics constrains should be analyzed. In addition, erroneous human driving conditions may generate shockwaves in addition which causes traffic flow instabilities. In this paper to achieve inter-vehicle distance and improved throughput, we consider Cooperative Adaptive Cruise Control (CACC) system. CACC is then implemented in Smart Driving System. For better Performance, wireless communication is used to exchange Information of individual vehicle. By introducing vehicle to vehicle (V2V) communication and vehicle to roadside infrastructure (V2R) communications, the vehicle gets information not only from its previous and following vehicle but also from the vehicles in front of the previous Vehicle and following vehicle. This enables a vehicle to follow its predecessor at a closer distance under tighter control.

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.

Sign in / Sign up

Export Citation Format

Share Document