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 construc...
详细信息
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.
According to the Gauss Curvature of each node on 3-D basic body surface, the indexes such as pheromone and volatilization coefficient are determined The ant Colony algorithm is designed and used. In the algorithm the ...
详细信息
ISBN:
(纸本)9780769535166
According to the Gauss Curvature of each node on 3-D basic body surface, the indexes such as pheromone and volatilization coefficient are determined The ant Colony algorithm is designed and used. In the algorithm the selected nodes collection are changed every time. The circle times are determined based on the percent of desired nodes account for different areas. At last the basic body surface is divided into two parts that are developable surface and undevelopable one.
Color management for the printer is one of the key techniques in the color image reproduction. A New color management model is presented based on analyzing the printer color rendering principle. First, the paper takes...
详细信息
ISBN:
(纸本)9780769533346
Color management for the printer is one of the key techniques in the color image reproduction. A New color management model is presented based on analyzing the printer color rendering principle. First, the paper takes standard color target for experimental sample, and substitutes color blocks in color shade district for complete color space to decrease calculation and improve process speed. Second, data collecting method is introduced and some data bases for deducing the model are created Then, ant colony algorithm is corrected to speed up model's convergence and a new model for printer color management based on improved ant colony algorithm is deduced and analyzed. Finally the experimental results show that the model can improve printer color management accuracy and can be used in its color management practically.
Resource performance prediction is the basis of dynamic load balance in distributed computing. A model for resource performance prediction named ARPP is introduced and carried out. ARPP model monitors key parameters o...
详细信息
ISBN:
(纸本)9783642148217
Resource performance prediction is the basis of dynamic load balance in distributed computing. A model for resource performance prediction named ARPP is introduced and carried out. ARPP model monitors key parameters of resources and estimates the directions using ant algorithm. The implement and analysis of ARPP is based on GridSim simulator and the process of astronomical image mosaicking application. The experiment result shows the efficiency of the model and the determination of optimized parameters.
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 als...
详细信息
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.
In this paper we show how an ant colony optimisation algorithm may be. used to enumerate knight's tours for variously sized chessboards. We have used the algorithm to enumerate all tours on 5x5 and 6x6 boards, and...
详细信息
ISBN:
(纸本)0780393635
In this paper we show how an ant colony optimisation algorithm may be. used to enumerate knight's tours for variously sized chessboards. We have used the algorithm to enumerate all tours on 5x5 and 6x6 boards, and, while the number of tours on an 8x8 board is too large for a full enumeration, our experiments suggest that the algorithm is able to uniformly sample tours at a constant, fast rate for as long as is desired.
Collaborative ant colony algorithm (ACA) was presented for Railway Optimal Stowage Problem with Category Restriction (ROSPCR). Having distinguished the differences of specific volume between the used loading capacity ...
详细信息
ISBN:
(纸本)9781424451944
Collaborative ant colony algorithm (ACA) was presented for Railway Optimal Stowage Problem with Category Restriction (ROSPCR). Having distinguished the differences of specific volume between the used loading capacity and the remained, a new ACA is devised. Then improvement concerning the rules of route construction and pheromone updating is adopted on the basis of former algorithm to optimize the loading capacity and volume of vehicles, besides the least number of vehicles needed in various conditions, thus making the algorithm a more practical one. Finally an example is put forward and analyzed, proving that the ACA designed in this paper is feasible and efficient in determining the optimal loading plan with ROSPCR.
The multicast routing problem with QoS constraints such as delay, delay jitter, bandwidth and packet loss metrics is discussed. A network model that is suitable to study such routing problems is described. A combinati...
详细信息
The multicast routing problem with QoS constraints such as delay, delay jitter, bandwidth and packet loss metrics is discussed. A network model that is suitable to study such routing problems is described. A combination of genetic algorithm and ant algorithm (GAAA) is given for multiple constrained QoS multicast routing. It adopts genetic algorithm to solve and to give information pheromone, to distribute and make use of its ability of quickness and randomness on a globally searching. At the same time, it gives a well solution making use of the characteristics of ant algorithm, converges on optimization pass information pheromone quickly. Simulation results show that the algorithm is valid and effective.
In this paper we first analyze the theory of ant algorithm and its math model,then we put forward a novel approach to solve the shortest-path-routing problem that uses the ant *** we set up an experiment to testify th...
详细信息
In this paper we first analyze the theory of ant algorithm and its math model,then we put forward a novel approach to solve the shortest-path-routing problem that uses the ant *** we set up an experiment to testify the validity and efficiency of our approach.
暂无评论