ant algorithm has been applied in combination with the simple negative factor counting (NFC) method and the inverse iteration method (IIM) to the designing of Type-II staggered model ternary copolymers. Two types of c...
详细信息
ant algorithm has been applied in combination with the simple negative factor counting (NFC) method and the inverse iteration method (IIM) to the designing of Type-II staggered model ternary copolymers. Two types of copolymers have been studied, one in which the band widths of the homopolymers were identical and their band-gaps were different and vice versa. On the basis of the optimized results obtained in both the cases it has been found that (i) the band-gap of the copolymer is closest to that of the lowest band-gap component and (ii) the component having the lowest ionization potential has the maximum amount in the optimum solution. Further, the optimized results are found to be nearly independent of the seed used. The density of states has also been investigated for all the copolymers. The results obtained are expected to be important guidelines for molecular designing of copolymers with tailor-made conduction properties. (C) 2010 Elsevier B.V. All rights reserved.
Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of c...
详细信息
Originally, the ant system was developed for optimization in discrete search spaces such as the traveling salesman problem. We detail our adaptation of the algorithm to optimization in the continuous search space of conformational analysis. The parameters of the algorithm were tuned using a simple test molecule, undecane, and a drug molecule, imatinib. The algorithm is further tested on four more drug or drug-like molecules, on vitamin A and on alanine tetrapeptide. (C) 2007 Wiley Periodicals, Inc.
A survey of existing algorithms used in the analysis of hyperlinks in the Web, such as PageRank, HITS, and modified variants of these algorithms, is presented. Particular attention is devoted to the quality and accele...
详细信息
A survey of existing algorithms used in the analysis of hyperlinks in the Web, such as PageRank, HITS, and modified variants of these algorithms, is presented. Particular attention is devoted to the quality and acceleration of the ranking of the results of a search. An "ant algorithm" is proposed as a means of accelerating the computation of the ranks of Web pages.
Multiple automated guided vehicle (multi-AGV) path planning in manufacturing workshops has always been technically difficult for industrial applications. This paper presents a multi-AGV path planning method based on p...
详细信息
Multiple automated guided vehicle (multi-AGV) path planning in manufacturing workshops has always been technically difficult for industrial applications. This paper presents a multi-AGV path planning method based on prioritized planning and improved ant colony algorithms. Firstly, in dealing with the problem of path coordination between AGVs, an improved priority algorithm is introduced, where priority is assigned based on the remaining battery charge of the AGVs, which improves the power usage efficiency of the AGVs. Secondly, an improved ant colony algorithm (IAC) is proposed to calculate the optimal path for the AGVs. In the algorithm, a random amount of pheromone is distributed in the map and the amount of pheromone is updated according to a fitness value. As a result, the computational efficiency of the ant colony algorithm is improved. Moreover, a mutation operation is introduced to mutate the amount of pheromone in randomly selected locations of the map, by which the problem of local optimum is well overcome. Simulation results and a comparative analysis showed the validity of the proposed method.
Application of the ant algorithm for ensuring the cyber resilience of a distributed system in conditions of various types of cyber attacks is considered. The principle of operation of the ant algorithm is described, a...
详细信息
Application of the ant algorithm for ensuring the cyber resilience of a distributed system in conditions of various types of cyber attacks is considered. The principle of operation of the ant algorithm is described, a mathematical model of the network infrastructure is developed, and possible types of cyberattacks are determined within the framework of the model. The results of the experimental studies demonstrated the applicability of the ant algorithm for ensuring the cyber resilience of large-scale networks.
This study addresses a capacitated facility location and task allocation problem of a multi-echelon supply chain against risky demands. Two and three-echelon networks are considered to maximize profit. The study repre...
详细信息
This study addresses a capacitated facility location and task allocation problem of a multi-echelon supply chain against risky demands. Two and three-echelon networks are considered to maximize profit. The study represents the problem by a bi-level stochastic programming model. The revised ant algorithm proposed in the study improves the existing ant algorithm by using new design of heuristic desirability and efficient greedy heuristics to solve the problem. A set of computational experiments is reported to not only allow to fine-tune the parameters of the algorithm but also to evaluate its performance for solving the problem proposed. Experiments reveal that the proposed solution algorithm can reach 95-99% of the optimal solution against risky demands while consuming only 1000th of the computational time for large-sized problems as compared to an optimization-based tool. (C) 2015 Elsevier B.V. All rights reserved.
A problem related to energy consumption of a mobile robot involves finding out what route the robot can take that uses the least energy. An ant colony optimization algorithm (ACO) can solve this problem. However, it i...
详细信息
A problem related to energy consumption of a mobile robot involves finding out what route the robot can take that uses the least energy. An ant colony optimization algorithm (ACO) can solve this problem. However, it is applicable only for route on a flat terrain. This paper proposes an adapted ant colony optimization (adapted ACO) algorithm that is applicable for route on a rough terrain as well. This adaptation introduces a weight that is the energy expended on a route that may have upward slopes, downward slopes, and flat surfaces. Experiments were conducted to test the algorithm. The experimental results show that our adapted ACO did successfully find a route that expended the least energy, though it was not the shortest one. We also found the following interesting facts: an energy-efficient route has more downward slopes than upward ones;the energy expended increases with the steepness of the slopes along a route;and the energy expended is likely to be lower if the robot's velocity is not constrained to be constant throughout the route.
The purpose of this paper is to propose an improved algorithm to overcome the premature deficiency of the basic ant algorithm, which is a novel simulated evolutionary algorithm, also a newly stochastic and intellectua...
详细信息
ISBN:
(纸本)9781424423873
The purpose of this paper is to propose an improved algorithm to overcome the premature deficiency of the basic ant algorithm, which is a novel simulated evolutionary algorithm, also a newly stochastic and intellectual searching optimization. After systematically analyzing the basic knowledge of the basic ant algorithm-ant System algorithm, an improved ant algorithm with a strategy of changing index self-adaptively which based on information is proposed. The information entropy was introduced to measure the uncertainty of the selection which is related to the parameter of the algorithm. Then, the improved algorithm was introduced into the traveling salesman problem and its ability for optimizing is discussed. This study provides an effective method for solving the premature problem of the similar algorithms.
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 ...
详细信息
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.
Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algor...
详细信息
Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.
暂无评论