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 Dynamic Evacuation Planning on Cruise Ships Based on an Improved Ant Colony System (IACS)

2021 ◽  
Vol 9 (2) ◽  
pp. 220
Author(s):  
Linfan Liu ◽  
Huajun Zhang ◽  
Jupeng Xie ◽  
Qin Zhao
Keyword(s):  
Route Planning ◽  
Emergency Evacuation ◽  
Ant Colony ◽  
Ant Colony System ◽  
Planning Problem ◽  
Cruise Ships ◽  
Crowd Density ◽  
Passenger Ships ◽  
Evacuation Route Planning ◽  
Evacuation Route

The emergency evacuation route planning of cruise ships directly affects the safety of all crew members and passengers during emergencies. Research on the planning of emergency evacuation routes for cruise ships is a frontier subject of maritime safety. This study proposes an improved ant colony system (IACS) to solve the evacuation route planning of crowds on cruise ships. The IACS, which is different from common single-path ant colony system (ACS) evacuation algorithms, is used to solve the multipath planning problem of crowd evacuation from cruise ships by considering crowd density and speed in the model. An increasing flow method is introduced into the IACS to improve the efficiency of the proposed algorithm. Numerical experiments show that this method meets the requirements of evacuation analysis guidelines for new and existing passenger ships (MSC.1/Circ.1533)and can effectively and efficiently plan the emergency evacuation path for cruise ship crowd.

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 An Adaptive Route Planning Method of Connected Vehicles for Improving the Transport Efficiency

2022 ◽  
Vol 11 (1) ◽  
pp. 39
Author(s):  
Baoju Liu ◽  
Jun Long ◽  
Min Deng ◽  
Xuexi Yang ◽  
Yan Shi
Keyword(s):  
Urban Areas ◽  
Large Scale ◽  
Route Planning ◽  
Planning Method ◽  
Planning Problem ◽  
Transport Efficiency ◽  
Bidding Price ◽  
Bidding Mechanism ◽  
Dynamic Route ◽  
Bidding Process

In recent years, the route-planning problem has gained increased interest due to the development of intelligent transportation systems (ITSs) and increasing traffic congestion especially in urban areas. An independent route-planning strategy for each in-vehicle terminal improves its individual travel efficiency. However, individual optimal routes pursue the maximization of individual benefit and may contradict the global benefit, thereby reducing the overall transport efficiency of the road network. To improve traffic efficiency while considering the travel time of individual vehicles, we propose a new dynamic route-planning method by innovatively introducing a bidding mechanism in the connected vehicle scenario for the first time. First, a novel bidding-based dynamic route planning is proposed to formulate vehicle routing schemes for vehicles affected by congestion via the bidding process. Correspondingly, a bidding price incorporating individual and global travel times was designed to balance the travel benefits of both objectives. Then, in the bidding process, a new local search algorithm was designed to select the winning routing scheme set with the minimum bidding price. Finally, the proposed method was tested and validated through case studies of simulated and actual driving scenarios to demonstrate that the bidding mechanism would be conducive to improving the transport efficiency of road networks in large-scale traffic flow scenarios. This study positively contributes to the research and development of traffic management in ITSs.

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

Multi-Objective Path Planning Model and Algorithm for Warship Evacuation

2012 ◽  
Vol 479-481 ◽  
pp. 1936-1941
Author(s):  
Chong Liu ◽  
Chang Hua Qiu
Keyword(s):  
Route Planning ◽  
Emergency Evacuation ◽  
Planning Problem ◽  
Program Model ◽  
Escape Route ◽  
Multi Objective ◽  
Objective Time ◽  
Naval Ship ◽  
Total Travel Time ◽  
Single Objective

The aim of naval ship evacuation is to direct crewmembers form the dangerous cabins to mustering station or action station as quickly as possible, when the ship is likely to be attacked or on fire. While evacuating, the crew’s escape routes have to open various watertight doors or airtight doors, which will speed evacuation but it may also degrade the ship’s post-evacuation integrity. In the proposed the multi-objective path program model for warship emergency evacuation, in consideration of the conflict between the minimization of total travel time and the minimization of ship’s integrity. The multi-objective problem was converted into single objective problem by weighted method. The crew speed on each arc depends on the total number of evacuees traversing the arc at roughly the same time. We proposed a heuristic algorithm to solve the multi-objective time-varied escape route planning problem. Finally, a numerical example is presented to show the effectiveness and feasibility of this algorithm.

Route planning of intelligent bridge cranes based on an improved artificial potential field method

2021 ◽  
pp. 1-8
Author(s):  
Zhengyan Chang ◽  
Zhengwei Zhang ◽  
Qiang Deng ◽  
Zheren Li
Keyword(s):  
Potential Field ◽  
Autonomous Navigation ◽  
Route Planning ◽  
Simple Algorithm ◽  
Field Method ◽  
Artificial Potential Field ◽  
Planning Problem ◽  
Operating Characteristics ◽  
Potential Field Method ◽  
Artificial Potential Field Method

The artificial potential field method is usually applied to the path planning problem of driverless cars or mobile robots. For example, it has been applied for the obstacle avoidance problem of intelligent cars and the autonomous navigation system of storage robots. However, there have been few studies on its application to intelligent bridge cranes. The artificial potential field method has the advantages of being a simple algorithm with short operation times. However, it is also prone to problems of unreachable targets and local minima. Based on the analysis of the operating characteristics of bridge cranes, a two-dimensional intelligent running environment model of a bridge crane was constructed in MATLAB. According to the basic theory of the artificial potential field method, the double-layer artificial potential field method was deduced, and the path and track fuzzy processing method was proposed. These two methods were implemented in MATLAB simulations. The results showed that the improved artificial potential field method could avoid static obstacles efficiently.

Dynamic route planning with uncertain information

1996 ◽  
Vol 9 (4) ◽  
pp. 223-232 ◽  
Author(s):  
Forouzan Golsahni ◽  
Enrique Cortes-Rello ◽  
Thomas H. Howell
Keyword(s):  
Route Planning ◽  
Uncertain Information ◽  
Dynamic Route
Sign in / Sign up

Export Citation Format

Share Document