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

Research on the optimal escape path algorithm in mine water bursting disaster

JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2018年第1期18卷 229-246页

作者： Dong, Lili Zhang, Honglei Zhang, Xiang Ye, Na Xian Univ Architecture & Technol Sch Informat & Control Engn Xian Shaanxi Peoples R China

To find the optimal escape path in mine water bursting disaster, present researches have proposed the dijkstra iterative algorithm. The optimal escape route should be chosen according to the extent of the disaster development and its impact scope. However, the traditional algorithm does not have a real-time analysis on the water flow and the escaping process, thus its solution is not or even far from optimal. Based on the traditional algorithm, this paper puts forward an algorithm with real-time analysis of escaping and water bursting processes. It analyzes water bursting range in real time according to the time of passing through each roadway on a path, and then finds an optimal escape path which is most secure and least time-consuming through comparison. The experiments show that the algorithmis able to find the optimal escape path more effectively compared with other algorithms.

关键词： Water bursting disasters dijkstra algorithm shortest path optimal escape path

来源：评论

学校读者我要写书评

暂无评论

Evolution of conformational changes in the dynamics of small biological molecules: a hybrid MD/RRK approach

引用

PHYSICAL CHEMISTRY CHEMICAL PHYSICS 2006年第42期8卷 4915-4923页

作者： Segev, Elad Grumbach, Mikael Gerber, Robert Benny Hebrew Univ Jerusalem Dept Chem Phys IL-91904 Jerusalem Israel Hebrew Univ Jerusalem Fritz Haber Inst IL-91904 Jerusalem Israel Univ Calif Irvine Dept Chem Irvine CA 92697 USA

The dynamics of long timescale evolution of conformational changes in small biological molecules is described by a hybrid molecular dynamics/RRK algorithm. The approach employs classical trajectories for transitions between adjacent structures separated by a low barrier, and the classical statistical RRK approximation when the barrier involved is high. In determining the long-time dynamics from an initial structure to a final structure of interest, an algorithm is introduced for determining the most efficient pathways (sequence of the intermediate conformers). This method uses the dijkstra algorithm for finding optimal paths on networks. Three applications of the method using an AMBER force field are presented: a detailed study of conformational transitions in a blocked valine dipeptide;a multiple reaction path study of the blocked valine tripeptide;and the evolution in time from the beta hairpin to alpha helix structure of a blocked alanine hexapeptide. Advantages and limitations of the method are discussed in light of the results.

关键词： .hairpin dipeptide paths Reaction path timescale RRK dijkstra algorithm small biological molecules blocked valine tripeptide blocked alanine hexapeptide

来源：评论

学校读者我要写书评

暂无评论

Towards an agent based traffic regulation and recommendation system for the on-road air quality control

引用

SPRINGERPLUS 2016年第1期5卷 1页

作者： Sadiq, Abderrahmane El Fazziki, Abdelaziz Ouarzazi, Jamal Sadgal, Mohamed Cadi Ayyad Univ Comp Syst Engn Lab Fac Sci Marrakech 4000 Morocco Cadi Ayyad Univ Fac Sci URAC 20 LPCME Marrakech 4000 Morocco

This paper presents an integrated and adaptive problem-solving approach to control the on-road air quality by modeling the road infrastructure, managing traffic based on pollution level and generating recommendations for road users. The aim is to reduce vehicle emissions in the most polluted road segments and optimizing the pollution levels. For this we propose the use of historical and real time pollution records and contextual data to calculate the air quality index on road networks and generate recommendations for reassigning traffic flow in order to improve the on-road air quality. The resulting air quality indexes are used in the system's traffic network generation, which the cartography is represented by a weighted graph. The weights evolve according to the pollution indexes and path properties and the graph is therefore dynamic. Furthermore, the systems use the available pollution data and meteorological records in order to predict the on-road pollutant levels by using an artificial neural network based prediction model. The proposed approach combines the benefits of multi-agent systems, Big data technology, machine learning tools and the available data sources. For the shortest path searching in the road network, we use the dijkstra algorithm over Hadoop MapReduce framework. The use Hadoop framework in the data retrieve and analysis process has significantly improved the performance of the proposed system. Also, the agent technology allowed proposing a suitable solution in terms of robustness and agility.

关键词： Air quality management Multi-agent systems Traffic regulation and recommendation dijkstra algorithm Hadoop Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal path in weak and strong disorder

引用

PHYSICA A 1999年第1-4期266卷 317-321页

作者： Schwartz, N Porto, M Havlin, S Bunde, A Bar Ilan Univ Minerva Ctr IL-52900 Ramat Gan Israel Bar Ilan Univ Dept Phys IL-52900 Ramat Gan Israel Univ Giessen Inst Theoret Phys 3 D-35392 Giessen Germany

We generate optimal paths between two given sites on a lattice representing a disordered energy landscape by applying the dijkstra algorithm. We study the geometrical and energetic scaling properties of the optimal path under two different energy distributions that yield the weak and strong disorder limits. Our numerical results, for both two and three dimensions, suggest that the optimal paths in weak disorder are in the same universality class as the directed polymers and in the strong disorder limit are fractals with exponents similar to that found by Cieplak et al. (Phys. Rev. Lett. 72 (1994) 2320;76 (1996) 3754). (C) 1999 Published by Elsevier Science B.V. All rights reserved.

关键词： optimal path dijkstra algorithm directed polymer

来源：评论

学校读者我要写书评

暂无评论

Distributed geographical packet forwarding in wireless sensor and actuator networks - a stochastic optimal control approach

引用

IET WIRELESS SENSOR SYSTEMS 2012年第1期2卷 63-74页

作者： Yu, R. Zhang, Y. Yang, K. Xie, S. Chen, H. -H. Guangdong Univ Technol Fac Automat Guangzhou 510640 Guangdong Peoples R China Simula Res Lab Baerum Norway Univ Oslo N-1325 Lysaker Norway Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England Natl Cheng Kung Univ Dept Engn Sci Tainan 70101 Taiwan

The authors study the issues on distributed geographical packet forwarding in wireless sensor and actuator networks (WSANs) using a stochastic optimal control approach. First, a distributed geographic-informed forwarding (DGIF) scheme is proposed that defines a set of distributed routing policies. Then, the distributed WSAN packet forwarding problem is modelled and analysed from the perspective of stochastic optimal control. The WSAN is viewed as a controlled stochastic system. The routing procedure is determined by the routing policy and system disturbance (e. g. the position uncertainty of remote nodes) jointly. An improved value iteration method is presented to accelerate the convergence of the optimal routing strategy. The reliability-driven routing algorithm (called DGIF-RRP) for emergency applications and the quality-of-serviceaware routing algorithm (called DGIF-QRP) for real-time applications are proposed. Simulations are carried out to evaluate the proposed routing algorithms. The results show that DGIF-RRP and DGIF-QRP significantly outperform two enhanced versions of the dijkstra's algorithm in emergency and real-time applications, respectively.

关键词： Optimal control dijkstra algorithm Communication network design, planning and routing Transducers and sensing devices real-time application telecommunication network routing value iteration method Actuating and final control devices quality-of-service-aware routing algorithm Wireless sensor networks distributed routing policies wireless actuator networks optimal routing strategy stochastic optimal control approach distributed geographical packet forwarding reliability-driven routing algorithm wireless sensor networks actuators distributed geographic-informed forwarding optimal control distributed WSAN packet forwarding problem

来源：评论

学校读者我要写书评

暂无评论

Custom Bus optimization of docking stations based on partition path selection

引用

ADVANCES IN MECHANICAL ENGINEERING 2017年第10期9卷 1-6页

作者： Li, Wenyong Yu, Ziwei Wei, Shuo Lu, Xiayun Zhang, Yuanqing Wang, Tao Guilin Univ Elect Technol Sch Architecture & Transportat Guilin 541004 Peoples R China Jiangxi Coll Appl Technol Ganzhou Peoples R China

The Custom Bus has advantages on punctuality, direct arrival, and economic benefits. It has a good effect on attracting passengers from private cars commuting in city. Due to the unscientific docking stations, the Custom Bus is always ineffective. There are little studies about the optimization of docking stations. Based on the reference to minimum cost maximum flow problem, using the chain of minimum cost increase flow and the dijkstra algorithm, choosing points by 0-1 planning model, studying the docking forms on multi-origin to multi-destination. Guaranteeing the attendance rate and limited docking stations, to achieve the goals that shortest single path and the highest service rate by arranging the docking stations reasonably. This algorithm has been demonstrated during the process of optimizing Custom Bus docking stations between Guilin's new and old urban districts.

关键词： Custom Bus optimization of docking stations minimum cost maximum flow chain of minimum cost increase flow dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

The path planning for mobile robot based on bat algorithm

引用

INTERNATIONAL JOURNAL OF AUTOMATION AND CONTROL 2015年第1期9卷 50-60页

作者： Guo, Jinchao Gao, Yu Cui, Guangzhao Zhengzhou Univ Light Ind Dept Elect & Informat Engn Zhengzhou 450002 Henan Peoples R China

This article presents a novel method of global optimal path planning based on the dijkstra algorithm and bat algorithm. This method consists of three steps: the first step is establishing the working space of mobile robot by adopting the MAKLINK graph theory, the second step is utilising the dijkstra algorithm to obtain the sub-optimal path from the start point to the goal point, and the third step is adopting the bat algorithm to optimise the sub-optimal path so as to get the global optimal path of the robot. The result of the simulation experiment shows the proposed method is effective and can meet the real-time requirements of mobile robot. At the same time, the experiment also proves the optimal path planning of mobile robot based on bat algorithm is superior to particle swarm optimisation algorithm.

关键词： MAKLINK graph theory dijkstra algorithm path planning bat algorithm

来源：评论

学校读者我要写书评

暂无评论

DEVELOPING CO-OPERATIVE TRANSPORT SYSTEM AND ROUTE PLANNING

引用

TRANSPORT 2009年第1期24卷 21-25页

作者： Szucs, Gabor Budapest Univ Technol & Econ Dept Telecommun & Media Informat H-1117 Budapest Hungary

This paper consists of two parts: planning Co-operative Transport Systems (CTS) with general rules (communication is a new idea in this system) and an investigation into route planning as a part of services provided in CTS. Part one reveals developing new systems for cooperative sensing and predicting flow, infrastructure and environmental conditions surrounding traffic, with a view to improve the safety and efficiency of road transport operations. Part two introduces the enhancement of the performance of the route planning algorithms. The key issues of these parts are communication and co-operation between the elements of the whole Co-operative Transport System.

关键词： eSafety intelligent transport system communication co-operation dijkstra algorithm speed-up techniques

来源：评论

学校读者我要写书评

暂无评论

A comparative analysis of meta-heuristic methods on disassembly line balancing problem with stochastic time

引用

ANNALS OF OPERATIONS RESEARCH 2023年第1-2期321卷 371-408页

作者： Mete, Suleyman Serin, Faruk Cil, Zeynel Abidin Celik, Erkan Ozceylan, Eren Gaziantep Univ Dept Ind Engn Gaziantep Turkey Mersin Univ Dept Comp Engn Mersin Turkey Izmir Democracy Univ Dept Ind Engn Izmir Turkey Istanbul Univ Dept Transportat & Logist Istanbul Turkey

The balancing of the disassembly line directly affects the productivity of the disassembly process. The disassembly line balancing (DLB) problem can be determined as assigning the tasks to serial workstations to optimize some performance measures like number of workstations, cycle time, removing hazardous parts earlier, etc. The aim of the paper is to develop an efficient heuristic algorithm to minimize the number of workstations under a pre-known cycle time. In this paper, a genetic algorithm (GA) and a constructive heuristic based on the dijkstra algorithm is proposed to solve the DLB problem with stochastic task times that is caused by the nature of disassembly operation. The proposed algorithms are tested on benchmark problems and compared with the results of the piecewise-linear model (PLM) and simulated annealing (SA). The average relative percentage deviation is applied to transfer the obtained number of workstations. The results obtained by GA are clearly superior in all tests problem according to average relative percentage deviation. Moreover, the proposed constructive heuristic based on the dijkstra algorithm is also superior to PLM and SA algorithm with respect to number of workstations and the computational times. The proposed approaches can be a very competitive and promising tool for further research in DLB literature and real cases in industries according to test results. Disassembly lines which need less time or number of workstations for balancing may be simply designed by the proposed techniques.

关键词： Genetic algorithm dijkstra algorithm Disassembly line balancing Piecewise linear Simulated annealing Stochastic task times

来源：评论

学校读者我要写书评

暂无评论

Retrieval of tree branch architecture attributes from terrestrial laser scan data using a Laplacian algorithm

引用

AGRICULTURAL AND FOREST METEOROLOGY 2020年第0期284卷 107874-000页

作者： Li, Yumei Su, Yanjun Zhao, Xiaoxia Yang, Mohan Hu, Tianyu Zhang, Jing Liu, Jin Liu, Min Guo, Qinghua Chinese Acad Sci Inst Bot State Key Lab Vegetat & Environm Change Beijing 100093 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Univ Calif Merced Sch Engn Sierra Nevada Res Inst Merced CA 95343 USA Natl Forestry & Grassland Adm China Natl Forestry Econ & Dev Res Ctr Beijing 100714 Peoples R China

Tree architecture, defined as the three-dimensional arrangement of tree above-ground elements, directly influences the biological and physical processes of vegetation such as photosynthesis and evapotranspiration. Accurate description of tree architecture is of central importance to understand the above biophysical processes. Terrestrial laser scanning (TLS) has been proved to be a promising tool to quantitatively describe tree architecture parameters. However, previous studies using TLS usually focused on architectural parameter measurements at individual tree, crown scale and leaf scales. Very few studies have achieved a comprehensive quantitative description of branch architecture (including angle, diameter, length and volume). In this study, we improved the Laplacian-Based Contraction skeletonization algorithm using the dijkstra algorithm, developed a new path discrimination method to identify and encode branch orders, and retrieved branch architecture parameters based on branch order and topology information. To assess the influence of branching complexity and branching pattern on the estimation accuracy, we scanned 15 different sized magnolia trees without a leading stem and simulated 10 different sized trees with a leading stem. Results showed the overall branch order identification and parameters retrieval accuracy of trees with a leading stem was obviously higher than trees without a leading stem. The identification accuracy of branch order decreased with the increase in the number of branch and tree branching complexity. The estimated branch architecture parameters agreed well with ground truth measurements (R-2 up to 0.99), except for the second- and third-order branch volume. Compared with branch angle and diameter, branch length showed the best correlations with manually measured values (0.14 vs 0.002, 8.48 in RMSE;0.99 vs 0.99, 0.78 in R-2). The second-and third-order branch volume estimations were highly underestimated compared with the ground truth v

关键词： Trunk architecture Laplacian algorithm dijkstra algorithm Terrestrial laser scan data Simulated data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：