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

第15届创新与管理国际学术会议（ICIM2018）

作者： Zhou Yunfeng Xiao Di School of Management Wuhan University of Technology Xiaonan Electric Power Supply Company

Emergency logistics is an important task for post-disaster emergencyManagement, which plays a key role in ensuring emergency supplies transported in time and reducing casualties and property losses in the disaster area. After proposing the problem of site selection and path optimization for urban emergency logistics, we establish an urban emergency logistics center location model and use floyd algorithm to solve it. Then we develop a path optimization model and solve it by shortest expected delivery time network model. At the end, a case is showed to demonstrate floyd algorithm has a certain of feasibility and practicality to solve this problem.

关键词： Urban emergency logistics floyd algorithm Site selection model Path optimization model

来源：评论

学校读者我要写书评

暂无评论

A floyd-like algorithm for Optimization of Mix-Valued Logical Control Networks

A Floyd-like Algorithm for Optimization of Mix-Valued Logica...

引用

第三十届中国控制会议

作者： ZHAO Yin Key Lab.of Systems and Control,AMSS,Chinese Academy of Sciences,Beijing 100190,P.R.China

＜正＞The optimization of mix-valued logical dynamic networks is *** the input-state incidence matrix of mix-valued logical control networks and some known properties of optimal control of such networks,a floyd-like algorithm is *** with existing methods,new algorithm can largely reduce the computational complexity in finding optimal *** theoretical analysis and numerical example are *** result has also been extended to higher order mix-valued control networks.

关键词： Mix-Valued Logical Control Network Input-State Incidence Matrix floyd algorithm Optimal Control

来源：评论

学校读者我要写书评

暂无评论

Research on MDS-MAP Location algorithm Based on floyd's Shortest Path

Research on MDS-MAP Location Algorithm Based on Floyd's Shor...

引用

Chinese Automation Congress (CAC)

作者： Wen, Tao Zhang, Bin Hu, Yongpan Long, Zhiqiang Natl Univ Def Technol Coll Intelligence Sci & Technol Changsha 410073 Hunan Peoples R China Hunan Prov Key Lab Electromagnet Levitat & Prop T Changsha 410073 Hunan Peoples R China Jiangxi Agr Univ Infrastruct Dept Nanchang 330045 Jiangxi Peoples R China

ISBN: (纸本)9781728176871

With the rapid development of the Internet of Things and artificial intelligence, the market has higher and higher demands and expectations for positioning technology. For the management of indoor materials and equipment, it is very important to be able to accurately obtain the location information of each material and equipment. However, to install equipment based on GPS or Beidou satellite positioning technology for each material and equipment requires high costs, and indoor buildings will block Satellite signals reduce the accuracy of indoor positioning. In this paper, combined with floyd's shortest path finding algorithm, an indoor positioning algorithm based on multi-dimensional scaling analysis is used to locate materials and equipment. The simulation experiment results show that the multidimensional scaling analysis (MDS)MAP positioning algorithm based on floyd shortest path proposed in this paper has better positioning accuracy than the positioning algorithm based on APIT and the positioning algorithm based on DV-Hop.

关键词： Indoor positioning floyd algorithm MDS-MAP positioning algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improved A ^∗ algorithm Based on Simulated Annealing and Multidistance Heuristic Function

引用

INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS 2025年第1期2025卷

作者： Chen, Yuandong Pang, Jinhao Huang, Zeyang Gou, Yuchen Jiang, Zhen Chen, Dewang Fujian Univ Technol Sch Transportat Fuzhou Fujian Peoples R China Fujian Univ Technol Fujian Collaborat Innovat Ctr Beidou Nav & Intelli Fuzhou Fujian Peoples R China

The traditional A (& lowast;) algorithm has problems such as low search speed and huge expansion nodes, resulting in low algorithm efficiency. This article proposes a circular arc distance calculation method in the heuristic function, which combines the Euclidean distance and the Manhattan distance as radius, uses a deviation distance as the correction, and assignes dynamic weights to the combined distance to make the overall heuristic function cost close to reality. Furthermore, the repulsive potential field function and turning cost are introduced into the heuristic function, to consider the relative position of obstacles while minimizing turns in the path. In order to reduce the comparison of nodes with similar cost values, the bounded suboptimal method is used, and the idea of simulated annealing is introduced to overcome the local optima trapped by node expansion. Simulation experiments show that the average running time of the improved algorithm has decreased by about 70%, the number of extended nodes has decreased by 92%, and the path has also been shortened, proving the effectiveness of the algorithm improvement.

关键词： A(& lowast ) algorithm arc distance floyd algorithm heuristic function path planning repulsive potential field simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Self-Healing Fault Reconstruction Strategy for Island Emergency Power Grid Based on floyd-MPSO

Self-Healing Fault Reconstruction Strategy for Island Emerge...

引用

58th IEEE/IAS Industrial and Commercial Power Systems Technical Conference Asia (IEEE I and CPS Asia)

作者： Li, Binghong Li, Weibo Pan, Junfeng Luo, Ji Wuhan Univ Technol Wuhan Peoples R China

ISBN: (数字)9781665450669

ISBN: (纸本)9781665450669

In the island power system, due to the special geographical location of the island, variable and unpredictable weather, power outages occur from time to time and power cannot be reliably guaranteed, so it is necessary to establish an emergency power grid to ensure the power supply of important loads in case of faults, and distributed power supplies (DGs) can play an important role with their characteristics of rapid response, simple structure and flexibility. In the fault reconstruction recovery, firstly, the structural characteristics of the distribution network are reasonably optimized to reduce the complexity of the solution;secondly, the key influence of the DG start-up sequence on the recovery path is discussed based on the start-up and operation characteristics of the DG. In order to ensure fast and stable recovery of more important loads, the floyd-MPSO algorithm is combined with the minimum path cost and the maximum recovery of important loads as the objective, and the power balance and other constraints, in which the floyd algorithm is used to search in advance to obtain the shortest path matrix among DGs with the optimized distribution network as the base, and then the inertia factor of the standard particle swarm optimization algorithm is adjusted adaptively to improve the defect that the particle is easy to fall into the local optimal and cannot jump *** results verify that the combination of the two can improve the effectiveness and speed of fault reconstruction.

关键词： floyd algorithm MPSO algorithm distributed generation start-up sequence fault reconstruction

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Deployment of Water Quality Sensor Networks

引用

Computers, Materials & Continua 2021年第9期68卷 3967-3977页

作者： Qian Sun Zhiping Shen Jinglin Liang Xiaoyi Wang Jiping Xu Li Wang Huiyan Zhang Jiabin Yu Ning Cao Ruichao Wang School of Artificial Intelligence Beijing Technology and Business UniversityBeijing100048China Beijing Laboratory for Intelligent Environmental Protection Beijing100048China Shandong Chengxiang Information Technology Co.Ltd. Dezhou253000China University College Dublin Dublin4Ireland

Water quality sensor networks are promising tools for the exploration of *** key areas need to be monitored *** quality sensors are deployed randomly or uniformly,however,and understanding how to deploy sensor nodes reasonably and realize effective monitoring of key areas on the basis of monitoring the whole area is an urgent problem to be ***,energy is limited in water quality sensor *** moving sensor nodes,we should extend the life cycle of the sensor networks as much as *** this study,sensor nodes in non-key monitored areas are moved to key ***,we used the concentric circle method to determine the mobile sensor nodes and the target ***,we determined the relationship between the mobile sensor nodes and the target locations according to the energy ***,we calculated the shortest moving path according to the floyd algorithm,which realizes the redeployment of the key monitored *** simulation results showed that,compared with the method of direct movement,the proposed method can effectively reduce the energy consumption and save the network adjustment time based on the effective coverage of key areas.

关键词： Concentric circle method cascaded movement floyd algorithm network coverage energy

来源：评论

学校读者我要写书评

暂无评论

ON THE OPTIMAL CONTROL OF BOOLEAN CONTROL NETWORKS

引用

SIAM JOURNAL ON CONTROL AND OPTIMIZATION 2018年第2期56卷 1321-1341页

作者： Zhu, Qunxi Liu, Yang Lu, Jianquan Cao, Jinde Zhejiang Normal Univ Coll Math Phys & Informat Engn Jinhua 321004 Peoples R China Fudan Univ Coll Math Sci Shanghai 200433 Peoples R China Southeast Univ Sch Math Nanjing 210096 Jiangsu Peoples R China Nantong Univ Sch Elect Engn Nantong 226000 Peoples R China Shandong Normal Univ Sch Math Sci Jinan 250014 Shandong Peoples R China

In this paper, we study the optimal control problem of Boolean control networks (BCNs). An optimal input-state transfer graph (OISTG) is defined for BCNs with cost in every stage. Optimal controllers are designed to minimize (or maximize) a given cost (or payoff) function over finite and/or infinite time horizon. In finite time horizon, a sufficient condition is derived for the optimal control problem, and an algorithm with the method of binary decomposition is proposed. Moreover, we prove the existence of optimal control for discounted problems over an infinite time horizon, and a new algorithm is presented to design corresponding optimal controllers. Compared with some existing methods, the new algorithm with OISTG can be used to reduce both space complexity and computational complexity in finding optimal controllers. Numerical examples are presented to illustrate the efficiency of the obtained results.

关键词： Boolean control networks floyd algorithm input-state transfer graph optimal control semitensor product

来源：评论

学校读者我要写书评

暂无评论

Efficient hybrid multicast approach in wireless data center network

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2018年 83卷 27-36页

作者： Zhu, Longting Wu, Jigang Jiang, Guiyuan Chen, Long Lam, Siew-Kei Guangdong Univ Technol Sch Comp Sci & Technol Guangzhou Guangdong Peoples R China Nanyang Technol Univ Sch Comp Sci & Engn Singapore Singapore

Large-scale data center suffers from overload of data traffic on some bottleneck links, due to the fact that cloud-based services are mostly accomplished by group communications with multicast traffic. This paper investigates techniques of wireless transmission using multiple channels, instead of single available communication channel as reported in existing works, to enhance the flexibility of congestion control, and at the same time, considers load balance of different links. The objective is to meet the communication demands with as little as possible total data traffic, while simultaneously optimizes the load balancing among different links. The proposed two-stage framework jointly optimizes the transmission paths for both wireless and wired communications. The first stage models the interference relation via contradiction graph such that each node of the graph represents an alternative of a wireless link, and an edge indicates that two wireless links cannot coexist due to interference. As a result, the problem of finding the optimal arrangement for wireless communication without interference is transformed into the problem of finding the maximum independent set on the obtained contradiction graph. Also, an efficient strategy is proposed in this paper to construct contradiction graph from the wireless data center network, and to find the maximum independent set (MIS) whose elements indicates the destination nodes to be served by wireless links. The second stage develops a load balance aware routing algorithm to serve the remaining traffic demands that have not been served by wireless links. Experimental results show that, the proposed approach can significantly minimize total data traffic while simultaneously balancing the traffic loads of different links. The maximum load is reduced by up to 58.97%, 56.15% and 25.62% on Fat-Tree, VL2 and BCube based wireless DCNs, in comparison to the state-of-the-art. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Wireless data center networks Multi-channel Hybrid Multicast communication Contradiction graph floyd algorithm

来源：评论

学校读者我要写书评

暂无评论

A systematic framework of vulnerability analysis of a natural gas pipeline network

引用

RELIABILITY ENGINEERING & SYSTEM SAFETY 2018年 175卷 79-91页

作者： Su, Huai Zio, Enrico Zhang, Jinjun Li, Xueyi China Univ Petr Natl Engn Lab Pipeline Safety MOE Key Lab Petr Engn Beijing Key Lab Urban Oil & Gas Distribut Technol Beijing 102249 Peoples R China Politecn Milan Dipartimento Energia Via La Masa 34 I-20156 Milan Italy Univ Paris Saclay Chair Syst Sci & Energy Challenge Fdn Elect France EDF Lab LGICent Supelec Batiment Bouygues2eme Etage 3 Rue Joliot Curie F-91192 Gif Sur Yvette France

A systematic framework is developed to assess the vulnerability of natural gas pipeline networks. To measure the impact of accidents on gas supply service, a consequence model is developed based on a flow algorithm embedded into an optimization scheme, with the consideration of physical constraints. The vulnerability analysis is performed from three viewpoints: global vulnerability analysis, demand robustness and critical pipeline analysis. The global vulnerability analysis is performed considering hazards and threats in gas sources, demand and transmission system. The analysis of demand robustness evaluates the capacities of demand sites to withstand the strains imposed on the pipeline network system and further explains the differences in capacities, from a graph theory perspective. In the critical pipeline analysis, criticalities of pipelines are evaluated by considering direct attacks and using a physical flow-based method. The analyses are performed on a relatively complex gas pipeline network taken from literature. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Complex natural gas pipeline network Vulnerability analysis Supply service Mart-flow algorithm floyd algorithm Criticality analysis

来源：评论

学校读者我要写书评

暂无评论

Grid-Based coverage path planning with NFZ avoidance for UAV using parallel self-adaptive ant colony optimization algorithm in cloud IoT

引用

JOURNAL OF CLOUD COMPUTING-ADVANCES SYSTEMS AND APPLICATIONS 2022年第1期11卷 1-28页

作者： Gong, Yiguang Chen, Kai Niu, Tianyu Liu, Yunping Nanjing Univ Informat Sci & Technol Sch Automat Nanjing Peoples R China

In recent years, with the development of Unmanned Aerial Vehicle (UAV) and Cloud Internet-of-Things (Cloud IoT) technology, data collection using UAVs has become a new technology hotspot for many Cloud IoT applications. Due to constraints such as the limited power life, weak computing power of UAV and no-fly zones restrictions in the environment, it is necessary to use cloud server with powerful computing power in the Internet of Things to plan the path for UAV. This paper proposes a coverage path planning algorithm called Parallel Self-Adaptive Ant Colony Optimization algorithm (PSAACO). In the proposed algorithm, we apply grid technique to map the area, adopt inversion and insertion operators to modify paths, use self-adaptive parameter setting to tune the pattern, and employ parallel computing to improve performance. This work also addresses an additional challenge of using the dynamic floyd algorithm to avoid no-fly zones. The proposal is extensively evaluated. Some experiments show that the performance of the PSAACO algorithm is significantly improved by using parallel computing and self-adaptive parameter configuration. Especially, the algorithm has greater advantages when the areas are large or the no-fly zones are complex. Other experiments, in comparison with other algorithms and existing works, show that the path planned by PSAACO has the least energy consumption and the shortest completion time.

关键词： Unmanned aerial vehicle Coverage path planning Ant colony algorithm floyd algorithm No-fly zone Grid-based technique

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：