检索结果-内蒙古大学图书馆

Analysis of influence of seismic impact on evacuability in subway stations

DEVELOPMENTS IN THE BUILT ENVIRONMENT 2025年 21卷

作者： Yoo, Mintaek Park, Jeongjun Jeong, Jiwon Ahn, Seungjun Gachon Univ Dept Civil & Environm Engn Seongnam Gyeonggi Do South Korea Korea Railway Res Inst Adv Railroad Civil Engn Div Euiwang Si Gyeonggi Do South Korea Hongik Univ Dept Civil & Environm Engn Seoul South Korea

Disasters in subway systems pose significant threats to urban safety, particularly as urban transportation increasingly relies on underground public transport networks. This study aims to assess the impacts of seismic events on subway station structures and their evacuation routes, focusing on a human-centric approach to disaster preparedness. Using PLAXIS 2D for dynamic numerical simulations and the dijkstra algorithm for evacuation modeling, this research investigates how structural damage from earthquakes affects the evacuability of subway stations. The findings highlight that as earthquake magnitude increases, evacuation routes become significantly more constrained, leading to a sharp rise in evacuation difficulty and potential bottlenecks, thereby exacerbating the risk of casualties. Additionally, the analysis found that structural sections located on softer ground are more susceptible to severe damage, further impeding evacuation efforts. By addressing the practical implications of seismic impacts on evacuation routes, this work provides comprehensive insights into the risks faced by subway station occupants during seismic events. The study offers insights for enhancing emergency response strategies and underscores the necessity for a multidisciplinary approach to disaster preparedness, integrating structural engineering and evacuation route design to ensure the safety and resilience of urban subway systems during emergencies.

关键词： Seismic impact Evacuation routes Subway systems Structural damage Disaster preparedness PLAXIS 2D dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Multicast routing in BMSNs through Greedy, Weighted Greedy and dijkstra algorithms: a comparative analysis

Multicast routing in BMSNs through Greedy, Weighted Greedy a...

引用

EUROPTO Symposium on Broadband European Networks (SYBEN 98)

作者： Borella, A Chiaraluce, F Univ Ancona Dipartimento Elettron & Automat I-60131 Ancona Italy

ISBN: (纸本)0819428604

The performances of some popular routing algorithms used for multicast communications are extensively simulated and analyzed in comparative terms, assuming the Bidirectional Manhattan Street Network as a valued test-bed. Multicast traffic is inserted over a substrate of point-to-point communications, contributing to increase the value of some cost parameters, suitably defined to express the routing efficiency. Both the cases of uncorrelated and bursty traffic are considered. The analysis confirms that the superiority of an algorithm over the others cannot be claimed since it depends on the input variables and on the criterion used for performance evaluation. Anyway conclusions can be drawn under specific assumptions, and they are usable in the framework of the network design.

关键词： routing multicasting Greedy algorithm dijkstra algorithm Manhattan street networks

来源：评论

学校读者我要写书评

暂无评论

Emergency evacuation paths for tank farm fires based on bi-objective dynamic planning

引用

SCIENTIFIC REPORTS 2025年第1期15卷 1-19页

作者： Chou, Guanbo Duo, Yili Liu, Jie Sun, Lin Zhang, Yuyuan Sun, Tie Liaoning Petrochem Univ Sch Mech Engn Fushun 113001 Peoples R China Liaoning Petrochem Univ Sch Environm & Safety Engn Fushun 113001 Peoples R China Liaoning Petrochem Univ Coll Petr Engn Fushun 113001 Peoples R China

Current static evacuation path planning methods are unable to meet the demands of real-time changes in fire scenarios. Therefore, a bi-objective dynamic planning (BODP) method for fire evacuation paths is proposed not only to minimize evacuation time but also reduce the thermal radiation dose received by personnel during the evacuation process. The BODP method includes both an equivalent rule proposed for the first time based on the linear weighting method, and an improved dijkstra algorithm designed in this paper. Because of them, the BODP method can normalize evacuation time and thermal radiation dose to the same degree and perform multi-sink dynamic planning on a hexagonal grid map, in order to find the optimal evacuation path with the lowest equivalent cost in the event of a tank farm fire. This method accounts for changing fire scenarios and avoids potentially high-risk paths. Finally, a case study of a chemical plant tank farm is conducted to demonstrate the effectiveness of the method. The results indicate that the BODP method is better suited for evacuation path planning in complex and dynamic fire scenarios. The BODP method resolves the issue found in static path planning: the first-degree burn probabilities derived from estimated thermal radiation doses are 34% lower than those derived from actual thermal radiation doses, potentially resulting in unnecessary casualties. Additionally, the BODP method is also applicable to scenarios involving domino effects triggered by fire incidents. This method provides scientific and reliable technical support for emergency evacuation in tank farm fires, greatly contributing to the safety and protection of personnel.

关键词： Tank farm fire Emergency evacuation Dynamic path planning Thermal radiation dijkstra algorithm Bi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

Towards more granular choice set building in location choice models: A graph-structured meta-topology as an alternative to matrices in agent-based travel demand models

引用

Procedia Computer Science 2025年 257卷 1002-1007页

作者： Alain Schengen Institute of Transport Research German Aerospace Center Rudower Chaussee 7 12489 Berlin Germany

Microscopic and agent-based travel demand models frequently rely on precomputed matrices describing travel times, distances, costs, or interchange counts between traffic analysis zones (TAZ). While these matrices simplify computational efforts, their reliance on spatial aggregation means that finer-grained, more behaviorally realistic insights are sacrificed. To achieve a more accurate microscopic view, one would need to divide large TAZs into smaller ones. However, this solution quickly becomes problematic, as it leads to a growth in matrix size, increasing both the memory footprint and the amount of precomputation necessary to maintain these matrices. To address these limitations, we present a method that employs a precomputed meta topology, a graph structure where each node can be annotated with additional information. As a case study, we implement a constrained dijkstra-based graph traversal algorithm on this meta topology to generate location choice sets for agent-based models. This approach significantly reduces memory requirements while introducing additional computational overhead, as it involves constructing multiple subgraphs. Although it enhances granularity and offers a more behaviorally nuanced perspective than matrix-based methods, certain trade-offs and performance considerations must be acknowledged. In the final section, we discuss how the meta topology can be further leveraged, as well as strategies for improving the efficiency and robustness of the proposed solution.

关键词： agent-based model travel demand open data dijkstra algorithm location choice modeling

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimization and Simulation of the Shortest Path Based on algorithm of dijkstra

引用

Journal of Measurement Science and Instrumentation 2010年第S1期1卷 199-201,37页

作者： Chuan-xiang REN,Xin-gang HAO,Ying-rui WANG, Guang-hui PAN (College of Information and Electrical Engineering,Shandong University of Science and Technology,Qingdao 266510,China) College of Information and Electrical Engineering Shandong University of Science and Technology

dijkstra algorithm is a theoretical basis to solve transportation network problems of the shortest path, which has a wide range of application in path optimization. Through analyzing traditional dijkstra algorithm,on account of the insufficiency of this algorithm in path optimization,this paper uses adjacency list and circular linked list with combination to store date,and through the improved quick sorting algorithm for weight sorting, accomplish a quick search to the adjacent node,and so an improved dijkstra algorithm is *** apply it to the optimal path search,and make simulation analysis for this algorithm through the example,also verify the effectiveness of the proposed algorithm.

关键词： route optimization dijkstra algorithm fast sorting algorithm adjacency list and circular linked list

来源：评论

学校读者我要写书评

暂无评论

Optimal path planning in a real-world radioactive environment: A comparative study of A-star and dijkstra algorithms

引用

NUCLEAR ENGINEERING AND DESIGN 2024年 420卷

作者： Miyombo, Miyombo Ernest Liu, Yong-kuo Mulenga, Chishinga Milton Siamulonga, Anthony Kabanda, Martin Chihango Shaba, Phillimon Xi, Chunli Ayodeji, Abiodun Harbin Engn Univ Fundamental Sci Nucl Safety & Simulat Technol Lab Harbin 150001 Peoples R China Radiat Protect Author Explorat HousePOB 50002 Lusaka Zambia Natl Inst Sci & Ind Res PO BOX 310158 Int Airport Rd Lusaka Zambia Northeast Forestry Univ Transportat Coll Harbin 150040 Peoples R China Brunel Univ London Brunel Innovat Ctr Uxbridge UB8 3PH England

Navigating complex radioactive environments while minimizing radiation exposure to workers is a critical challenge faced by the nuclear industry. Although various shortest-path algorithms and radiation dose calculation techniques have been employed for optimal path finding, most existing models are based on simulations that do not accurately represent real-world environments. To address this limitation, this study presents a pathplanning experiment conducted on a naturally radioactive slag dump, Slag Dump No. 48, also known as Black Mountain, in Zambia. The experiment utilizes the Radiation Detection Backpack System (RDBS) and Geolocation Application for Radiation Monitoring (GARM) in conjunction with the dijkstra and A -star algorithms to search for an optimal walking path on the slag dump. The distances between neighboring nodes and heuristic values, derived from gamma dose rates, are experimentally obtained from the GARM software. This research contributes to the field by: (1) performing a real-world path planning experiment on a radioactive slag dump, (2) applying RDBS for measuring gamma radiation from a naturally radioactive slag, (3) investigating the combined use of RDBS, GARM, dijkstra, and A -star algorithms for optimal pathfinding, (4) generating heuristic values and node distances experimentally for path planning in an actual radioactive environment, and (5) comparing the performance of state-of-the-art minimum dose walking path algorithms on dose rate-based and node distance-based weighted graphs. The results of this study and the proposed future work provide valuable insights for enhancing radiation protection and optimizing path planning in radioactive environments.

关键词： Optimal path planning Radiation dose assessment Gamma radiation A-star algorithm dijkstra algorithm Nuclear decommissioning

来源：评论

学校读者我要写书评

暂无评论

Determination of patient-specific trajectory for biaxially rotational dynamic-radiation therapy using a new O-ring-shaped image guided radiotherapy system

引用

PHYSICS & IMAGING IN RADIATION ONCOLOGY 2025年 33卷 100698-100698页

作者： Hirashima, Hideaki Adachi, Hiroki Ono, Tomohiro Nakamura, Mitsuhiro Ono, Yuka Iwai, Takahiro Yoshimura, Michio Mizowaki, Takashi Kyoto Univ Grad Sch Med Dept Radiat Oncol & Image Appl Therapy 54 Kawahara choSakyo ku Kyoto 6068507 Japan Hitachi High Tech Corp X ray Therapy Div Healthcare Business Grp Therapy Syst Business Tokyo Japan Shiga Gen Hosp Dept Radiat Oncol Shiga Japan Kyoto Univ Grad Sch Med Dept Adv Med Phys 53 Kawahara choSakyo ku Kyoto 6068507 Japan

Background and purpose: This study developed a trajectory search method for biaxially rotational dynamic- radiation therapy (BROAD-RT) using a new O-ring-shaped linac, aimed at identifying a patient-specific trajectory in a commercial treatment planning system. Subsequently, its efficacy in the treatment of pancreatic cancer was assessed. Materials and methods: BROAD-RT is a beam delivery technique in which the gantry and O-ring are simultaneously rotated around two axes. A beam's eye view-based structure map was generated, and the dijkstra algorithm was then applied to explore the BROAD-RT for minimizing radiation doses to critical organs in RayStation. This procedure was evaluated in 10 patients with pancreatic cancer. For each patient, two different plans were created: volumetric modulated arc therapy (VMAT) plan with coplanar and BROAD-RT trajectory. The effects of different trajectories on the plan and dosimetric indices were assessed for each delivery technique. Results: The mean modulation complexity score for VMAT (MCSv) and aperture area (AA) (x103 cm2) were 0.3 f 0.0 and 24.8 f 3.9 for the coplanar trajectory and 0.4 f 0.1 and 35.2 f 7.1 for the BROAD-RT trajectory, respectively, with both MCSv (p = 5 x 10- 5) and AA (p = 0.0002) values significantly higher for the BROAD-RT trajectory. Dose difference between the coplanar and BROAD-RT trajectories reduced the dose to the stomach and duodenum. Conclusions: Our study conducted an automated search for patient-specific BROAD-RT trajectory using a new Oring-shaped linac and implemented these trajectories in RayStation. Dose distributions were reduced in the intermediate-dose regions with BROAD-RT trajectory.

关键词： Patient-specific trajectory search dijkstra algorithm Pancreatic cancer BROAT-RT

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Discrete Evidence Fusion Based on dijkstra Shortest Path algorithm

A Novel Method for Discrete Evidence Fusion Based on Dijkstr...

引用

第32届中国控制与决策会议

作者： Bo Liu Yang Yang Xinyang Deng Science and Technology on Avionics Integration Laboratory School of Electronics and Information Northwestern Polytechnical University

Discrete evidence generally exists in the fields of expert systems,pattern recognition,and decision *** to solve the fusion of discrete evidence is an open *** order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences,a method for calculating the shortest path based on dijkstra is ***,the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible,and then the Jousselme distance between the two pairs of evidence between the evidence groups is *** Jousselme distance is designed to measure the conflict between the *** the dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme *** path here indicates the discrete evidence group with the largest fusion distance and smallest fusion *** use Dempster combination to fuse the evidence after weighted average and give the interval value of ***,two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.

关键词： Discrete evidence dijkstra algorithm Jousselme distance Dempster combination

来源：评论

学校读者我要写书评

暂无评论

New Optimal Dynamic Route Guidance algorithm Based on dijkstra

New Optimal Dynamic Route Guidance Algorithm Based on Dijkst...

引用

2009 International Conference on Modeling, Simulation and Optimization

作者： Chongchen Xiang,Hailong Li,Dan Ma,Quan Lin,Shuopeng Wang,Yuansi Zhang School of Science China University of Mining & Technology Xuzhou 221008,China

Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rational has become a research which highlights in today's academic world. With regard to this issue,Beijing ring road traffic system is taken as the model in this paper,what's more,a new dynamic route guidance algorithm is proposed to provide the humanized"optimal route"for the *** study builds a graph theory model of road network for Beijing ring road traffic system,and realizes the optimal route of calculation by classic dijkstra ***,based on the particularity of ring road traffic city,the study improves the calculation priority of ring road node in dijkstra algorithm. Compared with traditional dijkstra algorithm,the time complexity of this new algorithm decreases to 1/16k（k equals to the number of ring road in the road network）.In addition, when referring to control the middle and long distance of route guidance,the extra miles is less than 5%,which effectively promotes the algorithm practicability on large-scale ring road network.

关键词： Dynamic route guidance humanized route searching ring road priority algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

QS-dijkstra: A Safety-Enhanced Routing algorithm on SDN Framework 2021

QS-Dijkstra: A Safety-Enhanced Routing Algorithm on SDN Fram...

引用

2021 10th International Conference on Internet Computing for Science and Engineering

作者： Jinjing Zhao Ling Pang Zibin Wang Wenjing Zhong Qin Xin National Key Laboratory of Science and Technology on Information System Security China China Electro-Mechanical Engineering Xidian University China and National Key Laboratory of Science and Technology on Information System Security China China Faculty of Science and Technology University of the Faroe Islands Denmark

ISBN: (纸本)9781450384957

We consider the security problems in dijkstra caused by routing on the vulnerable communication links. This work employs a SDN framework to mitigate the vulnerable links while maintaining satisfactory QoS request. SDN is able to maintain an overall network awareness, through which a controller is capable of optimizing routing based on metrics of safety interest. A lot of useful link information, like link type, link ownership, interface bandwidth, transition delay and historical record, can be collected and computed by the SDN controller to enable more safe, reliable and efficient paths. In this way, we can consider the varying delay status of the communication network along with other network security parameters and get a presence of a passive/active adversary in the network routing area. The implement and experiment indicate that QS-dijkstra algorithm is able to minimize traffic routing through vulnerable links while satisfying the QoS constraints of the network.

关键词： routing protocol QoS network security dijkstra algorithm SDN

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：