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

10th International Conference on Swarm Intelligence (ICSI)

作者： Saramud, Mikhail, V Kovalevi, Igor, V Losevl, Vasiliy V. Voroshilova, Anna A. Reshetnev Siberian State Univ Sci & Technol Krasnoyarsky Rabochy Av 31 Krasnoyarsk 660037 Russia Siberian Fed Univ 79 Svobodny Ave Krasnoyarsk 660041 Russia

ISBN: (纸本)9783030263683;9783030263690

The paper discusses the use of an optimization algorithm based on the behaviour of the ant colony to solve the problem of forming the composition of a multiversion fault-tolerant software package. A model for constructing a graph for the implementation of the ant algorithm for the selected task is proposed. The modifications of the basic algorithm for both the ascending and the descending design styles of software systems are given. When optimizing for downstream design, cost, reliability, and evaluation of the successful implementation of each version with the specified characteristics are taken into account. When optimizing for up-stream design, reliability and resource intensity indicators are taken into account, as there is a selection from already implemented software modules. A method is proposed for increasing the efficiency of the ant algorithm, which consists in launching a group of "test" ants, choosing the best solution from this group and further calculating on the basis of it. A software system that implements both modifications of the basic ant algorithm for both design styles, as well as the possibility of applying the proposed multiple start technique to both modifications, is considered. The results of calculations obtained using the proposed software tool are considered. The results confirm the applicability of ant algorithms to the problem of forming a multiversion software package, and show the effectiveness of the proposed method.

关键词： ant algorithm Multiversion programming Reliability Optimization Software design Architecture

来源：评论

学校读者我要写书评

暂无评论

Data Fusion for Wireless Sensor Networks Based on Hybrid ant Colony algorithm 2019

Data Fusion for Wireless Sensor Networks Based on Hybrid Ant...

引用

2nd International Conference on Geoinformatics and Data Analysis (ICGDA) / 2nd International Conference on Software and Services Engineering (ICSSE)

作者： Wang, Lihong Han, Xue Heihe Univ Heihe Heilongjiang Peoples R China

ISBN: (纸本)9781450362450

A hybrid ant algorithm is proposed for wireless sensor networks data fusion, which to improve the efficiency of data integration and rextend the network lifetime. Not only the energy consumption is considered, but also the data transmission delay is considered. First, Making use of the advantages of ant algorithm in searching for the shortest path, the algorithm construct the shortest path. To overcome the disadvantages of prematurity and slow the rate of convergence in ant algorithm, At the same time, a variable neighborhood search mutation operator is applied to optimize search results. when iterrations number is achieved. Experiment results show that the algorithm which reduce energy consumption and network delay, is more stable and has better perfoming.

关键词： Wireless Sensor Network Data Fusion ant algorithm

来源：评论

学校读者我要写书评

暂无评论

An Improvement in ant algorithm Method for Optimizing a Transport Route with Regard to Traffic Flow 10th

An Improvement in ant Algorithm Method for Optimizing a Tran...

引用

10th International Scientific Conference on Transportation Science and Technology (TRANSBALTICA)

作者： Danchuk, Viktor Bakulich, Olena Svatko, Vitaliy Natl Transport Univ Fac Transport & Informat Technol Kiev Ukraine Natl Transport Univ Fac Management Logist & Tourism Kiev Ukraine

The modification of ant algorithm method for optimizing the transportation route with regard to traffic flow in the street network has been developed in this paper. It was also made possible to confirm the results of optimization of partly covered distance for calculating a further route when changing the length of links while ant agents traveling on the links of a two-way graph. Besides, the procedure of ant agents' traffic in the graph was improved so that ant agents can travel both synchronously and asynchronously. The proposed modification of ant algorithm for optimizing the goods delivery route when changing the speed of traffic flow in specific sections of the street network has been approbated, using the example of Kyiv's specific street network within traveling salesman problem. We conducted the quantitative and comparative analysis of solving the problem of optimization of the goods delivery route in the street network, applying ant algorithm method and the respective findings of other existing classical methods. The obtained results of the study show the prospects of applying the proposed modification of ant algorithm for solving routing problems, particularly for transport networks which are characterized by high dimensionality and dynamism of functional parameters. (C) 2017 The Authors. Published by Elsevier Ltd.

关键词： transport methods for transport route optimization ant algorithm performance analysis

来源：评论

学校读者我要写书评

暂无评论

The Assumptions to the ant algorithm in the Assignment of Vehicles to Tasks in the Production Companies 21

The Assumptions to the ant Algorithm in the Assignment of Ve...

引用

21st International Scientific Conference on Transport Means (Transport Means)

作者： Jacyna-Golda, I Izdebski, M. Murawski, J. Warsaw Univ Technol Fac Prod Engn Narbutta 85 PL-02524 Warsaw Poland Warsaw Univ Technol Fac Transport Koszykowa 75 PL-00662 Warsaw Poland

The paper discusses the problem of the assignment of vehicles to tasks in the production companies. In order to solve this problem in the production companies at first the tasks must be determined. Generally the task can be defined in following way: the vehicles collect the cargo from the suppliers or the supplier and transport it to the warehouses or production companies. One can say that the task is defined as the route which is realized by the vehicle, the starting and ending point of this route is always the company or the warehouse. The assignment is interpreted as assigning a vehicle to the designated route that consists of tasks taking into account the constraints e.g. the range of time in which the collect of cargo must be realized. This paper presents the mathematical model of the assignment problem. The input data for the model, decision variables, constraints and the criterion function from which the final solution is determined were defined. In order to solve this problem the ant algorithm was described. The main assumptions in the construction of this algorithm was presented.

关键词： assignment problem ant algorithm production company

来源：评论

学校读者我要写书评

暂无评论

Data Fusion for Wireless Sensor Networks Based on Hybrid ant Colony algorithm

Data Fusion for Wireless Sensor Networks Based on Hybrid Ant...

引用

作者： Lihong WANG Xue HAN Heihe University

A hybrid ant algorithm is proposed for wireless sensor networks data fusion, which to improve the efficiency of data integration and rextend the network lifetime. Not only the energy consumption is considered,but also the data transmission delay is considered. First, Making use of the advantages of ant algorithm in searching for the shortest path, the algorithm construct the shortest *** overcome the disadvantages of prematurity and slow the rate of convergence in ant algorithm, At the same time, a variable neighborhood search mutation operator is applied to optimize search *** iterrations number is achieved. Experiment results show that the algorithm which reduce energy consumption and network delay,is more stable and has better perfoming.

关键词： Wireless Sensor Network Data Fusion ant algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Optimization Problem of Routing about Parking Guidance Based on Improved ant Colony algorithm

Research on Optimization Problem of Routing about Parking Gu...

引用

IEEE International Conference on Civil Aviation Safety and Information Technology (ICCASIT)

作者： Juan Li Zi Li Tao Sun Meijuan Jia Haitao Yu Computer Science and Information Technology Daqing Normal University College Daqing China Guilin University of Technology Institute for Tourism Studies Guilin China

ISBN: (纸本)9781728125992

According to the layout characteristics of parking in the parking lot, the problem of converting the path choice of parking is raised to seek the optimal path and generate the optimal parking guiding line. This paper proposed the concept of node busy factor, and a mathematical model of the optimal path with constraints. The state transition rules of basic ant colony algorithm is improved as well as updating rules of pheromone. After that, the taboo strategy is introduced for further optimization. At last, the experimental results and Matlab simulation verify the effectiveness of the algorithm.

关键词： ant-colony algorithm Path optimization Taboo strategy Parking guidance Parking ant algorithm optimal path Network routing State Change

来源：评论

学校读者我要写书评

暂无评论

Path Planning for Multi-Rotors UAVs Formation Based on ant Colony algorithm

Path Planning for Multi-Rotors UAVs Formation Based on Ant C...

引用

International Conference on Intelligent Computing, Automation and Systems (ICICAS)

作者： Guoliang Liu Xinhua Wang Bing Liu Chunyan Wei Jiahuan Li Science and Technology on Avionics Integration Laboratory Shanghai China Nanjing University of Aeronautics and Astronautics Automation College Nanjing China Nanjing University of Aeronautics and Astronautics Nanjing China

ISBN: (数字)9781728161068

ISBN: (纸本)9781728161075

Multiple unmanned aerial vehicles (UAVs) formation has a broad application prospects, which will be used widely in the civilian and military fields. An improved ant colony algorithm method is proposed to solve the problem of path planning in formation transformation. Firstly, we designed a location assignment based on ant colony optimization algorithm. Then a new node selection strategy is proposed to improve the optimization results. At the end, the simulation results show the effectiveness and progress of the method. The improved method proposed in this paper can avoid the results into the local optimization and the algorithm optimization speed has increased.

关键词： ant colony optimisation autonomous aerial vehicles path planning remotely operated vehicles Path planning Unmanned vehicles ant algorithm ant colony optimization Unmanned Aerial Vehicle local optimization Simulation results

来源：评论

学校读者我要写书评

暂无评论

A Path Planning Method of Robot Arm Obstacle Avoidance Based on Dynamic Recursive ant Colony algorithm

A Path Planning Method of Robot Arm Obstacle Avoidance Based...

引用

IEEE International Conference on Power, Intelligent Computing and Systems

作者： Zhao Huadong Lei Chaofan Jiang Nan School of Mechanical Engineering Zhengzhou University

ISBN: (纸本)9781728137216

In order to improve the efficiency and accuracy of obstacle avoidance path planning, the characteristics of obstacle avoidance path planning are analyzed. Based on the traditional ant colony algorithm, sliding window and forgetting factor are introduced. By adjusting the correlation parameters and pheromone rules, the fixed value ant colony parameters cannot meet the performance of the whole calculation process. Through the cooperation of ants, an optimal path was established to avoid obstacles. An optimal moving path of manipulator based on dynamic recursive ant colony algorithm was proposed, and the practicability and validity of the method were verified by an example. It provides a reference for finding the optimal solution to the manipulator path planning in the shortest time.

关键词： ant colony algorithm Robot arm Obstacle avoidance path planning ant algorithm Path planning robotic arm Obstacle avoidance Collision avoidance correlation parameter computational procedure optimal solution Recursive

来源：评论

学校读者我要写书评

暂无评论

An Improvement in ant algorithm Method for Optimizing a Transport Route with Regard to Traffic Flow

引用

Procedia Engineering 2017年 187卷 425-434页

作者： Viktor Danchuk Olena Bakulich Vitaliy Svatko Faculty of Transport and Information Technologies National Transport University Kyiv Ukraine Faculty of Management Logistics and Tourism National Transport University Kyiv Ukraine

The modification of ant algorithm method for optimizing the transportation route with regard to traffic flow in the street network has been developed in this paper. It was also made possible to confirm the results of optimization of partly covered distance for calculating a further route when changing the length of links while ant agents traveling on the links of a two-way graph. Besides, the procedure of ant agents’ traffic in the graph was improved so that ant agents can travel both synchronously and asynchronously. The proposed modification of ant algorithm for optimizing the goods delivery route when changing the speed of traffic flow in specific sections of the street network has been approbated, using the example of Kyiv's specific street network within traveling salesman problem. We conducted the quantitative and comparative analysis of solving the problem of optimization of the goods delivery route in the street network, applying ant algorithm method and the respective findings of other existing classical methods. The obtained results of the study show the prospects of applying the proposed modification of ant algorithm for solving routing problems, particularly for transport networks which are characterized by high dimensionality and dynamism of functional parameters.

关键词： transport methods for transport route optimization ant algorithm performance analysis

来源：评论

学校读者我要写书评

暂无评论

ant algorithm for modifying an inconsistent pairwise weighting matrix in an analytic hierarchy process

引用

NEURAL COMPUTING & APPLICATIONS 2015年第2期26卷 313-327页

作者： Girsang, Abba Suganda Tsai, Chun-Wei Yang, Chu-Sing Natl Cheng Kung Univ Dept Elect Engn Inst Comp & Commun Engn Tainan 70101 Taiwan Chia Nan Univ Pharm & Sci Dept Appl Informat & Multimedia Tainan Taiwan

One important issue in the analytic hierarchy process (AHP) is confirming the consistency of comparison matrix to verify the logical respondent opinion. As inconsistent comparison matrix cannot be used as reference to make decisions, this paper proposes a method using an ant algorithm to modify an inconsistent pairwise weight matrix to be consistent in AHP, called antAHP. This method employs the matrix element as the path in an ant colony optimization to construct the tour. By laying pheromone information on their path, the ants can find the optimal matrix (or tour), which satisfies the consistency and closer to the original judgment of the decision makers. The experimental results demonstrate that the proposed algorithm is able to make consistent matrices, as well as minimize the difference index.

关键词： ant algorithm Inconsistent matrix Pairwise weight matrix Consistent ratio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：