WorldWideScience

Sample records for ant colony optimization

  1. ACO - Ant Colony Optimization

    OpenAIRE

    Žumer, Viljem; Brest, Janez; Pešl, Ivan

    2015-01-01

    Ant colony optimization is a relatively new approach to solving NP-Hard problems. It is based on the behavior of real ants, which always find the shortest path between their nest and a food source. Such behavior can be transferred into the discrcte world, were real ants are replaced by simple agents. Such simple agents are placed into the environment where different combinatorial problems can be solved In this paper we describe an artificial ant colony capable of solving the travelling salesm...

  2. Ant Colony Optimization

    OpenAIRE

    Zahálka, Jaroslav

    2007-01-01

    This diploma thesis deals with Ant Colony algorithms and their usage for solving Travelling Salesman Problems and Vehicle Routing Problems. These algorithms are metaheuristics offering new approach to solving NP-hard problems. Work begins with a description of the forementioned tasks including ways to tackle them. Next chapter analyses Ant Colony metaheuristic and its possible usage and variations. The most important part of the thesis is practical and is represented by application Ant Colony...

  3. Ant Colony Optimization: A Review and Comparison

    OpenAIRE

    Sundus Shaukat; Riaz Ahmed Bhatti; Khalid Ibrahim Qureshi; Shafqat Ali Shad

    2014-01-01

    Many optmization algorithms are developed over period of time, among these most famous and widely used is Ant Colony systems (ACA). Ant Colony Systems (ACS) are the collection of different ant colony optimization algorithms. Different algorithms are used for solve the Travelling salesmen Problem (TCP) but ant colony algorithm is more preferred to solve the travelling salesmen problem. In ant colony best solution is found with the help of cooperating agents called ants. Ants cooperate with eac...

  4. Ant colony optimization in continuous problem

    Institute of Scientific and Technical Information of China (English)

    YU Ling; LIU Kang; LI Kaishi

    2007-01-01

    Based on the analysis of the basic ant colony optimization and optimum problem in a continuous space,an ant colony optimization (ACO) for continuous problem is constructed and discussed. The algorithm is efficient and beneficial to the study of the ant colony optimization in a continuous space.

  5. Ant Colony Optimization for Control

    NARCIS (Netherlands)

    Van Ast, J.M.

    2010-01-01

    The very basis of this thesis is the collective behavior of ants in colonies. Ants are an excellent example of how rather simple behavior on a local level can lead to complex behavior on a global level that is beneficial for the individuals. The key in the self-organization of ants is communication

  6. Towards a multilevel ant colony optimization

    OpenAIRE

    Lian, Thomas Andreé; Llave, Marilex Rea

    2014-01-01

    Ant colony optimization is a metaheuristic approach for solving combinatorial optimization problems which belongs to swarm intelligence techniques. Ant colony optimization algorithms are one of the most successful strands of swarm intelligence which has already shown very good performance in many combinatorial problems and for some real applications. This thesis introduces a new multilevel approach for ant colony optimization to solve the NP-hard problems shortest path and traveling salesman....

  7. Ant Colony Optimization Algorithm for Continuous Domains Based on Position Distribution Model of Ant Colony Foraging

    OpenAIRE

    Liqiang Liu; Yuntao Dai; Jinyu Gao

    2014-01-01

    Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model and give the form of solution for the algorithm, the distribution model of pheromone, the update rules...

  8. Optic disc detection using ant colony optimization

    OpenAIRE

    Dias, Marcy; Monteiro, Fernando C.

    2012-01-01

    The retinal fundus images are used in the treatment and diagnosis of several eye diseases, such as diabetic retinopathy and glaucoma. This paper proposes a new method to detect the optic disc (OD) automatically, due to the fact that the knowledge of the OD location is essential to the automatic analysis of retinal images. Ant Colony Optimization (ACO) is an optimization algorithm inspired by the foraging behaviour of some ant species that has been applied in image processing for edge detectio...

  9. Ant colony optimization and constraint programming

    CERN Document Server

    Solnon, Christine

    2013-01-01

    Ant colony optimization is a metaheuristic which has been successfully applied to a wide range of combinatorial optimization problems. The author describes this metaheuristic and studies its efficiency for solving some hard combinatorial problems, with a specific focus on constraint programming. The text is organized into three parts. The first part introduces constraint programming, which provides high level features to declaratively model problems by means of constraints. It describes the main existing approaches for solving constraint satisfaction problems, including complete tree search

  10. Optimized Ant Colony Algorithm by Local Pheromone Update

    OpenAIRE

    Hui Yu

    2013-01-01

    Ant colony algorithm, a heuristic simulated algorithm, provides better solutions for non-convex, non-linear and discontinuous optimization problems. For ant colony algorithm, it is frequently to be trapped into local optimum, which might lead to stagnation. This article presents the  city-select strategy, local pheromone update strategy, optimum solution prediction strategy and local optimization strategy to optimize ant colony algorithm, provides ant colony algorithm based on local pheromone...

  11. Enhanced ant colony optimization for multiscale problems

    Science.gov (United States)

    Hu, Nan; Fish, Jacob

    2016-03-01

    The present manuscript addresses the issue of computational complexity of optimizing nonlinear composite materials and structures at multiple scales. Several solutions are detailed to meet the enormous computational challenge of optimizing nonlinear structures at multiple scales including: (i) enhanced sampling procedure that provides superior performance of the well-known ant colony optimization algorithm, (ii) a mapping-based meshing of a representative volume element that unlike unstructured meshing permits sensitivity analysis on coarse meshes, and (iii) a multilevel optimization procedure that takes advantage of possible weak coupling of certain scales. We demonstrate the proposed optimization procedure on elastic and inelastic laminated plates involving three scales.

  12. Ant Colony Optimization and Hypergraph Covering Problems

    CERN Document Server

    Pat, Ankit

    2011-01-01

    Ant Colony Optimization (ACO) is a very popular metaheuristic for solving computationally hard combinatorial optimization problems. Runtime analysis of ACO with respect to various pseudo-boolean functions and different graph based combinatorial optimization problems has been taken up in recent years. In this paper, we investigate the runtime behavior of an MMAS*(Max-Min Ant System) ACO algorithm on some well known hypergraph covering problems that are NP-Hard. In particular, we have addressed the Minimum Edge Cover problem, the Minimum Vertex Cover problem and the Maximum Weak- Independent Set problem. The influence of pheromone values and heuristic information on the running time is analysed. The results indicate that the heuristic information has greater impact towards improving the expected optimization time as compared to pheromone values. For certain instances of hypergraphs, we show that the MMAS* algorithm gives a constant order expected optimization time when the dominance of heuristic information is ...

  13. Ant colony optimization algorithm for continuous domains based on position distribution model of ant colony foraging.

    Science.gov (United States)

    Liu, Liqiang; Dai, Yuntao; Gao, Jinyu

    2014-01-01

    Ant colony optimization algorithm for continuous domains is a major research direction for ant colony optimization algorithm. In this paper, we propose a distribution model of ant colony foraging, through analysis of the relationship between the position distribution and food source in the process of ant colony foraging. We design a continuous domain optimization algorithm based on the model and give the form of solution for the algorithm, the distribution model of pheromone, the update rules of ant colony position, and the processing method of constraint condition. Algorithm performance against a set of test trials was unconstrained optimization test functions and a set of optimization test functions, and test results of other algorithms are compared and analyzed to verify the correctness and effectiveness of the proposed algorithm. PMID:24955402

  14. Optic disc detection using ant colony optimization

    Science.gov (United States)

    Dias, Marcy A.; Monteiro, Fernando C.

    2012-09-01

    The retinal fundus images are used in the treatment and diagnosis of several eye diseases, such as diabetic retinopathy and glaucoma. This paper proposes a new method to detect the optic disc (OD) automatically, due to the fact that the knowledge of the OD location is essential to the automatic analysis of retinal images. Ant Colony Optimization (ACO) is an optimization algorithm inspired by the foraging behaviour of some ant species that has been applied in image processing for edge detection. Recently, the ACO was used in fundus images to detect edges, and therefore, to segment the OD and other anatomical retinal structures. We present an algorithm for the detection of OD in the retina which takes advantage of the Gabor wavelet transform, entropy and ACO algorithm. Forty images of the retina from DRIVE database were used to evaluate the performance of our method.

  15. Model Specification Searches Using Ant Colony Optimization Algorithms

    Science.gov (United States)

    Marcoulides, George A.; Drezner, Zvi

    2003-01-01

    Ant colony optimization is a recently proposed heuristic procedure inspired by the behavior of real ants. This article applies the procedure to model specification searches in structural equation modeling and reports the results. The results demonstrate the capabilities of ant colony optimization algorithms for conducting automated searches.

  16. Ant Colony Optimization for Capacity Problems

    Directory of Open Access Journals (Sweden)

    Tad Gonsalves

    2015-01-01

    Full Text Available This paper deals with the optimization of the capac ity of a terminal railway station using the Ant Colony Optimization algorithm. The capacity of the terminal station is defined as the number of trains that depart from the station in un it interval of time. The railway capacity optimization problem is framed as a typical symmetr ical Travelling Salesman Problem (TSP, with the TSP nodes representing the train arrival / departure events and the TSP total cost representing the total time-interval of the schedul e. The application problem is then optimized using the ACO algorithm. The simulation experiments validate the formulation of the railway capacity problem as a TSP and the ACO algorithm pro duces optimal solutions superior to those produced by the domain experts.

  17. Runtime analysis of the 1-ANT ant colony optimizer

    DEFF Research Database (Denmark)

    Doerr, Benjamin; Neumann, Frank; Sudholt, Dirk;

    2011-01-01

    The runtime analysis of randomized search heuristics is a growing field where, in the last two decades, many rigorous results have been obtained. First runtime analyses of ant colony optimization (ACO) have been conducted only recently. In these studies simple ACO algorithms such as the 1-ANT are...... investigated. The influence of the evaporation factor in the pheromone update mechanism and the robustness of this parameter w.r.t. the runtime behavior have been determined for the example function OneMax.This work puts forward the rigorous runtime analysis of the 1-ANT on the example functions Leading......Ones and BinVal. With respect to Evolutionary Algorithms (EAs), such analyses were essential to develop methods for the analysis on more complicated problems. The proof techniques required for the 1-ANT, unfortunately, differ significantly from those for EAs, which means that a new reservoir of methods has...

  18. Loading pattern optimization using ant colony algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Hoareau, Fabrice [EDF R and D, Clamart (France)

    2008-07-01

    Electricite de France (EDF) operates 58 nuclear power plants (NPP), of the Pressurized Water Reactor type. The loading pattern optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R and D has developed automatic optimization tools that assist the experts. LOOP is an industrial tool, developed by EDF R and D and based on a simulated annealing algorithm. In order to improve the results of such automatic tools, new optimization methods have to be tested. Ant Colony Optimization (ACO) algorithms are recent methods that have given very good results on combinatorial optimization problems. In order to evaluate the performance of such methods on loading pattern optimization, direct comparisons between LOOP and a mock-up based on the Max-Min Ant System algorithm (a particular variant of ACO algorithms) were made on realistic test-cases. It is shown that the results obtained by the ACO mock-up are very similar to those of LOOP. Future research will consist in improving these encouraging results by using parallelization and by hybridizing the ACO algorithm with local search procedures. (author)

  19. Loading pattern optimization using ant colony algorithm

    International Nuclear Information System (INIS)

    Electricite de France (EDF) operates 58 nuclear power plants (NPP), of the Pressurized Water Reactor type. The loading pattern optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R and D has developed automatic optimization tools that assist the experts. LOOP is an industrial tool, developed by EDF R and D and based on a simulated annealing algorithm. In order to improve the results of such automatic tools, new optimization methods have to be tested. Ant Colony Optimization (ACO) algorithms are recent methods that have given very good results on combinatorial optimization problems. In order to evaluate the performance of such methods on loading pattern optimization, direct comparisons between LOOP and a mock-up based on the Max-Min Ant System algorithm (a particular variant of ACO algorithms) were made on realistic test-cases. It is shown that the results obtained by the ACO mock-up are very similar to those of LOOP. Future research will consist in improving these encouraging results by using parallelization and by hybridizing the ACO algorithm with local search procedures. (author)

  20. Automatic Programming with Ant Colony Optimization

    OpenAIRE

    Green, Jennifer; Jacqueline L. Whalley; Johnson, Colin G.

    2004-01-01

    Automatic programming is the use of search techniques to find programs that solve a problem. The most commonly explored automatic programming technique is genetic programming, which uses genetic algorithms to carry out the search. In this paper we introduce a new technique called Ant Colony Programming (ACP) which uses an ant colony based search in place of genetic algorithms. This algorithm is described and compared with other approaches in the literature.

  1. Electricity Consumption Prediction Based on SVR with Ant Colony Optimization

    OpenAIRE

    Haijiang Wang; Shanlin Yang

    2013-01-01

    Accurate forecasting of electric load has always been the most important issues in the electricity industry, particularly for developing countries. Due to the various influences, electric load forecasting reveals highly nonlinear characteristics. This paper creates a system for power load forecasting using support vector machine and ant colony optimization. The method of colony optimization is employed to process large amount of data and eliminate. The SVR model with ant colony optimization i...

  2. Robustness of Ant Colony Optimization to Noise.

    Science.gov (United States)

    Friedrich, Tobias; Kötzing, Timo; Krejca, Martin S; Sutton, Andrew M

    2016-01-01

    Recently, ant colony optimization (ACO) algorithms have proven to be efficient in uncertain environments, such as noisy or dynamically changing fitness functions. Most of these analyses have focused on combinatorial problems such as path finding. We rigorously analyze an ACO algorithm optimizing linear pseudo-Boolean functions under additive posterior noise. We study noise distributions whose tails decay exponentially fast, including the classical case of additive Gaussian noise. Without noise, the classical [Formula: see text] EA outperforms any ACO algorithm, with smaller [Formula: see text] being better; however, in the case of large noise, the [Formula: see text] EA fails, even for high values of [Formula: see text] (which are known to help against small noise). In this article, we show that ACO is able to deal with arbitrarily large noise in a graceful manner; that is, as long as the evaporation factor [Formula: see text] is small enough, dependent on the variance [Formula: see text] of the noise and the dimension n of the search space, optimization will be successful. We also briefly consider the case of prior noise and prove that ACO can also efficiently optimize linear functions under this noise model. PMID:26928850

  3. Tuning PID Controller Using Multiobjective Ant Colony Optimization

    OpenAIRE

    Pierre Borne; Noureddine Liouane; Ibtissem Chiha

    2012-01-01

    This paper treats a tuning of PID controllers method using multiobjective ant colony optimization. The design objective was to apply the ant colony algorithm in the aim of tuning the optimum solution of the PID controllers (Kp, Ki, and Kd) by minimizing the multiobjective function. The potential of using multiobjective ant algorithms is to identify the Pareto optimal solution. The other methods are applied to make comparisons between a classic approach based on the “Ziegler-Nichols” method an...

  4. Optimization Planning based on Improved Ant Colony Algorithm for Robot

    OpenAIRE

    Xin Zhang; Zhanwen Wu

    2014-01-01

    As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result shows that the algorithm of this paper make the optimization planning of robot more reasonable

  5. Ant Colony Optimization for Inferring Key Gene Interactions

    OpenAIRE

    Raza, Khalid; Kohli, Mahish

    2014-01-01

    Inferring gene interaction network from gene expression data is an important task in systems biology research. The gene interaction network, especially key interactions, plays an important role in identifying biomarkers for disease that further helps in drug design. Ant colony optimization is an optimization algorithm based on natural evolution and has been used in many optimization problems. In this paper, we applied ant colony optimization algorithm for inferring the key gene interactions f...

  6. Protein structure optimization with a "Lamarckian" ant colony algorithm.

    Science.gov (United States)

    Oakley, Mark T; Richardson, E Grace; Carr, Harriet; Johnston, Roy L

    2013-01-01

    We describe the LamarckiAnt algorithm: a search algorithm that combines the features of a "Lamarckian" genetic algorithm and ant colony optimization. We have implemented this algorithm for the optimization of BLN model proteins, which have frustrated energy landscapes and represent a challenge for global optimization algorithms. We demonstrate that LamarckiAnt performs competitively with other state-of-the-art optimization algorithms. PMID:24407312

  7. Determining the Optimum Section of Tunnels Using Ant Colony Optimization

    OpenAIRE

    S. Talatahari

    2013-01-01

    Ant colony optimization is developed to determine optimum cross sections of tunnel structures. Tunnel structures are expensive infrastructures in terms of material, construction, and maintenance and the application of optimization methods has a great role in minimizing their costs. This paper presents the formulation of objective function and constraints of the problem for the first time, and the ant colony optimization, as a developed metaheuristic approach, has been used to solve the proble...

  8. Experiment Study of Entropy Convergence of Ant Colony Optimization

    OpenAIRE

    Pang, Chao-Yang; Wang, Chong-Bao; Hu, Ben-Qiong

    2009-01-01

    Ant colony optimization (ACO) has been applied to the field of combinatorial optimization widely. But the study of convergence theory of ACO is rare under general condition. In this paper, the authors try to find the evidence to prove that entropy is related to the convergence of ACO, especially to the estimation of the minimum iteration number of convergence. Entropy is a new view point possibly to studying the ACO convergence under general condition. Key Words: Ant Colony Optimization, Conv...

  9. A critical analysis of parameter adaptation in ant colony optimization

    OpenAIRE

    PELLEGRINI, Paola; Stützle, Thomas; Birattari, Mauro

    2012-01-01

    Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have been proposed. In the literature, these methods have been shown to improve the quality of the results achieved in some particular contexts. In particular, they proved to be successful when applied to novel ant colony optimization algorithms for tackling problems that are not a classical testbed for optimization alg...

  10. Data transmission optimal routing in WSN using ant colony algorithm

    OpenAIRE

    Jun, Su; Yatskiv, Vasyl; Sachenko, Anatoly; Yatskiv, Nataliya

    2012-01-01

    Ant colony algorithm to search an optimal route of data transmission in Wireless Sensor Network was explored. Correspondent software was designed and the dynamics and the decision search time was investigated for the given network topology.

  11. Ant Colony Optimization for Train Scheduling: An Analysis

    OpenAIRE

    Sudip Kumar Sahana; Aruna Jain; Prabhat Kumar Mahanti

    2014-01-01

    This paper deals on cargo train scheduling between source station and destination station in Indian railways scenario. It uses Ant Colony Optimization (ACO) technique which is based on ant’s food finding behavior. Iteration wise convergence process and the convergence time for the algorithm are studied and analyzed. Finally, the run time analysis of Ant Colony Optimization Train Scheduling (ACOTS) and Standard Train Scheduling (STS) algorithm has been performed.

  12. Generating and prioritizing optimal paths using ant colony optimization

    Directory of Open Access Journals (Sweden)

    Mukesh Mann

    2015-03-01

    Full Text Available The assurance of software reliability partially depends on testing. Numbers of approaches for software testing are available with their proclaimed advantages and limitations, but accessibility of any one of them is a subject dependent. Time is a critical factor in deciding cost of any project. A deep insight has shown that executing test cases are time consuming and tedious activity. Thus stress has been given to develop algorithms which can suggest better pathways for testing. One such algorithm called Path Prioritization -Ant Colony Optimization (PP-ACO has been suggested in this paper which is inspired by real Ant's foraging behavior to generate optimal paths sequence of a decision to decision (DD path of a graph. The algorithm does full path coverage and suggests the best optimal sequences of path in path testing and prioritizes them according to path strength.

  13. An ant colony optimization algorithm for job shop scheduling problem

    OpenAIRE

    Edson Flórez; Wilfredo Gómez; MSc. Lola Bautista

    2013-01-01

    The nature has inspired several metaheuristics, outstanding among these is Ant Colony Optimization (ACO), which have proved to be very effective and efficient in problems of high complexity (NP-hard) in combinatorial optimization. This paper describes the implementation of an ACO model algorithm known as Elitist Ant System (EAS), applied to a combinatorial optimization problem called Job Shop Scheduling Problem (JSSP). We propose a method that seeks to reduce delays designating th...

  14. Optimization of PID Controllers Using Ant Colony and Genetic Algorithms

    CERN Document Server

    Ünal, Muhammet; Topuz, Vedat; Erdal, Hasan

    2013-01-01

    Artificial neural networks, genetic algorithms and the ant colony optimization algorithm have become a highly effective tool for solving hard optimization problems. As their popularity has increased, applications of these algorithms have grown in more than equal measure. While many of the books available on these subjects only provide a cursory discussion of theory, the present book gives special emphasis to the theoretical background that is behind these algorithms and their applications. Moreover, this book introduces a novel real time control algorithm, that uses genetic algorithm and ant colony optimization algorithms for optimizing PID controller parameters. In general, the present book represents a solid survey on artificial neural networks, genetic algorithms and the ant colony optimization algorithm and introduces novel practical elements related to the application of these methods to  process system control.

  15. Heuristic Ant Colony Optimization with Applications in Communication Systems

    Directory of Open Access Journals (Sweden)

    Mateus de P. Marques

    2014-05-01

    Full Text Available This work explores the heuristic optimization algorithm based on ant colonies (ACO, deployed on complex optimization problems, aiming to achieve an iterative and feasible method which is able to solve NP and NP-Hard problems related to wireless networks. Furthermore, the convergence and performance of the Ant Colony Optimization algorithm for continuous domains are addressed through dozens of benchmark functions, which in turn, differ on each other regarding the number of dimensions and the difficulty w.r.t. the optimization (number of local optima. Finally, the applicability of the ACO is depicted in an minimum power control problem for CDMA networks.

  16. Determining the Optimum Section of Tunnels Using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    S. Talatahari

    2013-01-01

    Full Text Available Ant colony optimization is developed to determine optimum cross sections of tunnel structures. Tunnel structures are expensive infrastructures in terms of material, construction, and maintenance and the application of optimization methods has a great role in minimizing their costs. This paper presents the formulation of objective function and constraints of the problem for the first time, and the ant colony optimization, as a developed metaheuristic approach, has been used to solve the problem. The results and comparisons based on numerical examples show the efficiency of the algorithm.

  17. Application of ant colony optimization in NPP classification fault location

    International Nuclear Information System (INIS)

    Nuclear Power Plant is a highly complex structural system with high safety requirements. Fault location appears to be particularly important to enhance its safety. Ant Colony Optimization is a new type of optimization algorithm, which is used in the fault location and classification of nuclear power plants in this paper. Taking the main coolant system of the first loop as the study object, using VB6.0 programming technology, the NPP fault location system is designed, and is tested against the related data in the literature. Test results show that the ant colony optimization can be used in the accurate classification fault location in the nuclear power plants. (authors)

  18. Ant Colony Optimization and the Minimum Cut Problem

    DEFF Research Database (Denmark)

    Kötzing, Timo; Lehre, Per Kristian; Neumann, Frank;

    2010-01-01

    Ant Colony Optimization (ACO) is a powerful metaheuristic for solving combinatorial optimization problems. With this paper we contribute to the theoretical understanding of this kind of algorithm by investigating the classical minimum cut problem. An ACO algorithm similar to the one that was proved...

  19. PARAMETER ESTIMATION OF VALVE STICTION USING ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    S. Kalaivani

    2012-07-01

    Full Text Available In this paper, a procedure for quantifying valve stiction in control loops based on ant colony optimization has been proposed. Pneumatic control valves are widely used in the process industry. The control valve contains non-linearities such as stiction, backlash, and deadband that in turn cause oscillations in the process output. Stiction is one of the long-standing problems and it is the most severe problem in the control valves. Thus the measurement data from an oscillating control loop can be used as a possible diagnostic signal to provide an estimate of the stiction magnitude. Quantification of control valve stiction is still a challenging issue. Prior to doing stiction detection and quantification, it is necessary to choose a suitable model structure to describe control-valve stiction. To understand the stiction phenomenon, the Stenman model is used. Ant Colony Optimization (ACO, an intelligent swarm algorithm, proves effective in various fields. The ACO algorithm is inspired from the natural trail following behaviour of ants. The parameters of the Stenman model are estimated using ant colony optimization, from the input-output data by minimizing the error between the actual stiction model output and the simulated stiction model output. Using ant colony optimization, Stenman model with known nonlinear structure and unknown parameters can be estimated.

  20. Response Ant Colony Optimization of End Milling Surface Roughness

    OpenAIRE

    Ahmed N. Abd Alla; M. M. Noor; K. Kadirgama

    2010-01-01

    Metal cutting processes are important due to increased consumer demands for quality metal cutting related products (more precise tolerances and better product surface roughness) that has driven the metal cutting industry to continuously improve quality control of metal cutting processes. This paper presents optimum surface roughness by using milling mould aluminium alloys (AA6061-T6) with Response Ant Colony Optimization (RACO). The approach is based on Response Surface Method (RSM) and Ant C...

  1. Tasks Scheduling using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    A. P. Shanthi

    2012-01-01

    Full Text Available Problem statement: Efficient scheduling of the tasks to heterogeneous processors for any application is critical in order to achieve high performance. Finding a feasible schedule for a given task set to a set of heterogeneous processors without exceeding the capacity of the processors, in general, is NP-Hard. Even if there are many conventional approaches available, people have been looking at unconventional approaches for solving this problem. This study uses a paradigm using Ant Colony Optimisation (ACO for arriving at a schedule. Approach: An attempt is made to arrive at a feasible schedule of a task set on heterogeneous processors ensuring load balancing across the processors. The heterogeneity of the processors is modelled by assuming different utilisation times for the same task on different processors. ACO, a bio-inspired computing paradigm, is used for generating the schedule. Results: For a given instance of the problem, ten runs are conducted based on an ACO algorithm and the average wait time of all tasks is computed. Also the average utilisation of each processor is calculated. For the same instance, the two parameters: average wait time of tasks and utilisation of processors are computed using the First Come First Served (FCFS. The results are tabulated and compared and it is found that ACO performs better than the FCFS with respect to the wait time. Although the processor utilisation is more for some processors using FCFS algorithm, it is found that the load is better balanced among the processors in ACO. There is a marginal increase in the time for arriving at a schedule in ACO compared to FCFS algorithm. Conclusion: This approach to the tasks assignment problem using ACO performs better with respect to the two parameters used compared to the FCFS algorithm but the time taken to come up with the schedule using ACO is slightly more than that of FCFS.

  2. AN IMPROVED ANT COLONY ALGORITHM IN CONTINUOUS OPTIMIZATION

    Institute of Scientific and Technical Information of China (English)

    Ling CHEN; Jie SHEN; Ling QIN; Hongjian CHEN

    2003-01-01

    A modified ant colony algorithm for solving optimization problem with continuous parameters is presented. In the method, groups of candidate values of the components are constructed, and each value in the group has its trail information. In each iteration of the ant colony algorithm, the method first chooses initial values of the components using the trail information. Then GA operations of crossover and mutation can determine the values of the components in the solution. Our experimental results on the problem of nonlinear programming show that our method has a much higher convergence speed and stability than those of simulated annealing (SA) and GA.

  3. All-Optical Implementation of the Ant Colony Optimization Algorithm

    Science.gov (United States)

    Hu, Wenchao; Wu, Kan; Shum, Perry Ping; Zheludev, Nikolay I.; Soci, Cesare

    2016-05-01

    We report all-optical implementation of the optimization algorithm for the famous “ant colony” problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems.

  4. Global path planning approach based on ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    WEN Zhi-qiang; CAI Zi-xing

    2006-01-01

    Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted,the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.

  5. PRACTICAL APPLICATION OF POPULATION BASED ANT COLONY OPTIMIZATION ALGORITHM

    OpenAIRE

    Valeeva, A.; Goncharova, Yu

    2013-01-01

    In this paper we consider the Split Delivery Vehicle Routing Problem, which has a wide practical application. The SDVRP is NP-hard problem. We propose a population based ant colony optimization algorithm for solving the SDVRP. Computational experiments for developed algorithm are reported.

  6. A Hybrid Optimization Algorithm based on Genetic Algorithm and Ant Colony Optimization

    OpenAIRE

    Zainudin Zukhri; Irving Vitra Paputungan

    2013-01-01

    In optimization problem, Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO) have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP), called Genetic Ant Colony Optimization (GACO). In this method, GA will observe and preserve the fittest ant in each cycle in every generation and on...

  7. Apriori and Ant Colony Optimization of Association Rules

    OpenAIRE

    Anshuman Singh Sadh; Nitin Shukla

    2013-01-01

    Association Rule mining is one of the important and most popular data mining technique. Association rule mining can be efficiently used in any decision making processor decision based rule generation. In this paper we present an efficient mining based optimization techniques for rule generation. By using apriori algorithm we find the positive and negative association rules. Then we apply ant colony optimization algorithm (ACO) for optimizing the association rules. Our results show the effecti...

  8. SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    O. Deepa

    2016-03-01

    Full Text Available Successful applications coming from biologically inspired algorithm like Ant Colony Optimization (ACO based on artificial swarm intelligence which is inspired by the collective behavior of social insects. ACO has been inspired from natural ants system, their behavior, team coordination, synchronization for the searching of optimal solution and also maintains information of each ant. At present, ACO has emerged as a leading metaheuristic technique for the solution of combinatorial optimization problems which can be used to find shortest path through construction graph. This paper describe about various behavior of ants, successfully used ACO algorithms, applications and current trends. In recent years, some researchers have also focused on the application of ACO algorithms to design of wireless communication network, bioinformatics problem, dynamic problem and multi-objective problem.

  9. DATA MINING UNTUK KLASIFIKASI PELANGGAN DENGAN ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Maulani Kapiudin

    2007-01-01

    Full Text Available In this research the system for potentially customer classification is designed by extracting rule based classification from raw data with certain criteria. The searching process uses customer database from a bank with data mining technic by using ant colony optimization. A test based on min_case_per_rule variety and phenomene updating were done on a certain period of time. The result are group of customer class which base on rules built by ant and by modifying the pheromone updating, the area of the case is getting bigger. Prototype of the software is coded with C++ 6 version. The customer database master is created by using Microsoft Access. This paper gives information about potential customer of bank that can be classified by prototype of the software. Abstract in Bahasa Indonesia : Pada penelitian untuk sistem klasifikasi potensial customer ini didesain dengan melakukan ekstrak rule berdasarkan klasifikasi dari data mentah dengan kriteria tertentu. Proses pencarian menggunakan database pelanggan dari suatu bank dengan teknik data mining dengan ant colony optimization. Dilakukan percobaan dengan min_case_per_rule variety dan phenomene updating pada periode waktu tertentu. Hasilnya adalah sekelompok class pelanggan yang didasarkan dari rules yang dibangun dengan ant dan dengan dimodifikasi dengan pheromone updating, area permasalahan menjadi lebih melebar. Prototype dari software ini menggunakan C++ versi 6. Database pelanggan dibangun dengan Microsoft Access. Paper ini memberikan informasi mengenai potensi pelanggan dari bank, sehingga dapat diklasifikasikan dengan prototype dari software. Kata kunci: ant colony optimization, classification, min_case_per_rule, term, pheromone updating

  10. Implementation of Travelling Salesman Problem Using ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Gaurav Singh,

    2014-04-01

    Full Text Available Within the Artificial Intelligence community, there is great need for fast and accurate traversal algorithms, specifically those that find a path from a start to goal with minimum cost. Cost can be distance, time, money, energy, etc. Travelling salesman problem (TSP is a combinatorial optimization problem. TSP is the most intensively studied problem in the area of optimization. Ant colony optimization (ACO is a population-based metaheuristic that can be used to find approximate solutions to difficult optimization problems. There have been many efforts in the past to provide time efficient solutions for the problem, both exact and approximate. This paper demonstrates the implementation of TSP using ant colony optimization(ACO.The solution to this problem enjoys wide applicability in a variety of practical fields.TSP in its purest form has several applications such as planning, logistics, and manufacture of microchips, military and traffic.

  11. Scheduling Optimization of Construction Engineering based on Ant Colony Optimized Hybrid Genetic Algorithm

    OpenAIRE

    Li Hui; Zhang Jingxiao; Ren Lieyan; Shi Zhen

    2013-01-01

    In this paper, the basic theory and procedure for working out solutions of ant colony genetic algorithm were first introduced; the optimization, constraints and objectives of construction project scheduling were described; then a basic model for optimization of construction project scheduling was established; and an improved ant colony genetic algorithm for solving the basic model was put forward. Performance of ant colony genetic algorithm was analyzed and evaluated from the aspect of schedu...

  12. A Hybrid Ant Colony Algorithm for Loading Pattern Optimization

    Science.gov (United States)

    Hoareau, F.

    2014-06-01

    Electricité de France (EDF) operates 58 nuclear power plant (NPP), of the Pressurized Water Reactor (PWR) type. The loading pattern (LP) optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF R&D has developed automatic optimization tools that assist the experts. The latter can resort, for instance, to a loading pattern optimization software based on ant colony algorithm. This paper presents an analysis of the search space of a few realistic loading pattern optimization problems. This analysis leads us to introduce a hybrid algorithm based on ant colony and a local search method. We then show that this new algorithm is able to generate loading patterns of good quality.

  13. Antenna synthesis based on the ant colony optimization algorithm

    OpenAIRE

    Slyusar, V. I.; Ermolaev, S. Y.

    2009-01-01

    This report are described the versions and the synthesis results of new designs of electrically small antenna based on ant colony optimization algorithms. To study the parameters of the frame and non-loopback vibrators MMANA package was used. Geometric forms that were obtained might be used as contour lines of printed, slot antenna or as forming surface of the crystal dielectric resonator antenna. A constructive meta-heuristic search algorithm for optimization of the antennas form...

  14. Response Ant Colony Optimization of End Milling Surface Roughness

    Directory of Open Access Journals (Sweden)

    Ahmed N. Abd Alla

    2010-03-01

    Full Text Available Metal cutting processes are important due to increased consumer demands for quality metal cutting related products (more precise tolerances and better product surface roughness that has driven the metal cutting industry to continuously improve quality control of metal cutting processes. This paper presents optimum surface roughness by using milling mould aluminium alloys (AA6061-T6 with Response Ant Colony Optimization (RACO. The approach is based on Response Surface Method (RSM and Ant Colony Optimization (ACO. The main objectives to find the optimized parameters and the most dominant variables (cutting speed, feedrate, axial depth and radial depth. The first order model indicates that the feedrate is the most significant factor affecting surface roughness.

  15. Ant Colony Optimization With Combining Gaussian Eliminations for Matrix Multiplication.

    Science.gov (United States)

    Zhou, Yuren; Lai, Xinsheng; Li, Yuanxiang; Dong, Wenyong

    2013-02-01

    One of the main unsolved problems in computer algebra is to determine the minimal number of multiplications which is necessary to compute the product of two matrices. For practical value, the small format is of special interest. This leads to a combinatorial optimization problem which is unlikely solved in polynomial time. In this paper, we present a method called combining Gaussian eliminations to reduce the number of variables in this optimization problem and use heuristic ant colony algorithm to solve the problem. The results of experiments on 2 × 2 case show that our algorithm achieves significant performance gains. Extending this algorithm from 2 × 2 case to 3 × 3 case is also discussed. Index Terms—Ant colony optimization (ACO), evolutionary algorithms, Gaussian eliminations, matrix multiplication, multiplicative complexity, Strassen's algorithm. PMID:22835561

  16. Multiple-Agent Task Allocation Algorithm Utilizing Ant Colony Optimization

    OpenAIRE

    Kai Zhao

    2013-01-01

    Task allocation in multiple agent system has been widely applied many application fields, such as unmanned aerial vehicle, multi-robot system and manufacturing system et al. Therefore, it becomes one of the hot topics in distributed artificial intelligence research field for several years. Therefore, in this paper, we propose a novel task allocation algorithm in multiple agent systems utilizing ant colony optimization. Firstly, the basic structure of agent organization is described, which inc...

  17. Ant colony optimization approach to estimate energy demand of Turkey

    International Nuclear Information System (INIS)

    This paper attempts to shed light on the determinants of energy demand in Turkey. Energy demand model is first proposed using the ant colony optimization (ACO) approach. It is multi-agent systems in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. ACO energy demand estimation (ACOEDE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear and quadratic. QuadraticACOEDE provided better-fit solution due to fluctuations of the economic indicators. The ACOEDE model plans the energy demand of Turkey until 2025 according to three scenarios. The relative estimation errors of the ACOEDE model are the lowest when they are compared with the Ministry of Energy and Natural Resources (MENR) projection

  18. An Ant Colony Optimization Algorithm for Microwave Corrugated Filters Design

    OpenAIRE

    Mantilla-Gaviria, Ivan A.; Alejandro Díaz-Morcillo; Balbastre-Tejedor, Juan V.

    2013-01-01

    A practical and useful application of the Ant Colony Optimization (ACO) method for microwave corrugated filter design is shown. The classical, general purpose ACO method is adapted to deal with the microwave filter design problem. The design strategy used in this paper is an iterative procedure based on the use of an optimization method along with an electromagnetic simulator. The designs of high-pass and band-pass microwave rectangular waveguide filters working in the C-band and X-band, res...

  19. Applying Data Clustering Feature to Speed Up Ant Colony Optimization

    OpenAIRE

    Chao-Yang Pang; Ben-Qiong Hu; Jie Zhang; Wei Hu; Zheng-Chao Shan

    2013-01-01

    Ant colony optimization (ACO) is often used to solve optimization problems, such as traveling salesman problem (TSP). When it is applied to TSP, its runtime is proportional to the squared size of problem $N$ so as to look less efficient. The following statistical feature is observed during the authors’ long-term gene data analysis using ACO: when the data size $N$ becomes big, local clustering appears frequently. That is, some data cluster tightly in a small area and form a class, and the cor...

  20. Binary-Coding-Based Ant Colony Optimization and Its Convergence

    Institute of Scientific and Technical Information of China (English)

    Tian-Ming Bu; Song-Nian Yu; Hui-Wei Guan

    2004-01-01

    Ant colony optimization(ACO for short)is a meta-heuristics for hard combinatorial optimization problems.It is a population-based approach that uses exploitation of positive feedback as well as greedy search.In this paper,genetic algorithm's(GA for short)ideas are introduced into ACO to present a new binary-coding based ant colony optimization.Compared with the typical ACO,the algorithm is intended to replace the problem's parameter-space with coding-space,which links ACO with GA so that the fruits of GA can be applied to ACO directly.Furthermore,it can not only solve general combinatorial optimization problems,but also other problems such as function optimization.Based on the algorithm,it is proved that if the pheromone remainder factor ρ is under the condition of ρ≥ 1,the algorithm can promise to converge at the optimal,whereas if 0 <ρ< 1,it does not.

  1. Operations planning for agricultural harvesters using ant colony optimization

    Directory of Open Access Journals (Sweden)

    A. Bakhtiari

    2013-07-01

    Full Text Available An approach based on ant colony optimization for the generation for optimal field coverage plans for the harvesting operations using the optimal track sequence principle B-patterns was presented. The case where the harvester unloads to a stationary facility located out of the field area, or in the field boundary, was examined. In this operation type there are capacity constraints to the load that a primary unit, or a harvester in this specific case, can carry and consequently, it is not able to complete the task of harvesting a field area and therefore it has to leave the field area, to unload, and return to continue the task one or more times. Results from comparing the optimal plans with conventional plans generated by operators show reductions in the in-field nonworking distance in the range of 19.3-42.1% while the savings in the total non-working distance were in the range of 18-43.8%. These savings provide a high potential for the implementation of the ant colony optimization approach for the case of harvesting operations that are not supported by transport carts for the out-of-the-field removal of the crops, a practice case that is normally followed in developing countries, due to lack of resources.

  2. A HYBRID OPTIMIZATION ALGORITHM BASED ON GENETIC ALGORITHM AND ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Zainudin Zukhri

    2013-09-01

    Full Text Available In optimization problem, Genetic Algorithm (GA and Ant Colony Optimization Algorithm (ACO have been known as good alternative techniques. GA is designed by adopting the natural evolution process, while ACO is inspired by the foraging behaviour of ant species. This paper presents a hybrid GA-ACO for Travelling Salesman Problem (TSP, called Genetic Ant Colony Optimization (GACO. In this method, GA will observe and preserve the fittest ant in each cycle in every generation and only unvisited cities will be assessed by ACO. From experimental result, GACO performance is significantly improved and its time complexity is fairly equal compared to the GA and ACO.

  3. Ant Colony Algorithm for the Weighted Item Layout Optimization Problem

    CERN Document Server

    Xu, Yi-Chun; Liu, Yong; Xiao, Ren-Bin; Amos, Martyn

    2010-01-01

    This paper discusses the problem of placing weighted items in a circular container in two-dimensional space. This problem is of great practical significance in various mechanical engineering domains, such as the design of communication satellites. Two constructive heuristics are proposed, one for packing circular items and the other for packing rectangular items. These work by first optimizing object placement order, and then optimizing object positioning. Based on these heuristics, an ant colony optimization (ACO) algorithm is described to search first for optimal positioning order, and then for the optimal layout. We describe the results of numerical experiments, in which we test two versions of our ACO algorithm alongside local search methods previously described in the literature. Our results show that the constructive heuristic-based ACO performs better than existing methods on larger problem instances.

  4. An ant colony optimization method for generalized TSP problem

    Institute of Scientific and Technical Information of China (English)

    Jinhui Yang; Xiaohu Shi; Maurizio Marchese; Yanchun Liang

    2008-01-01

    Focused on a variation of the euclidean traveling salesman problem (TSP), namely, the generalized traveling salesman problem (GTSP), this paper extends the ant colony optimization method from TSP to this field. By considering the group influence, an improved method is further improved. To avoid locking into local minima, a mutation process and a local searching technique are also introduced into this method. Numerical results show that the proposed method can deal with the GTSP problems fairly well, and the developed mutation process and local search technique are effective.

  5. Multiple-Agent Task Allocation Algorithm Utilizing Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Kai Zhao

    2013-11-01

    Full Text Available Task allocation in multiple agent system has been widely applied many application fields, such as unmanned aerial vehicle, multi-robot system and manufacturing system et al. Therefore, it becomes one of the hot topics in distributed artificial intelligence research field for several years. Therefore, in this paper, we propose a novel task allocation algorithm in multiple agent systems utilizing ant colony optimization. Firstly, the basic structure of agent organization is described, which include context-aware module, information processing module, the executing module, decision-making and intelligent control module, knowledge base and task table. Based the above agent structure, these module utilize the knowledge in the external environment to process the information in agent communicating. Secondly, we point out that task allocation process in multiple agent systems can be implement by creating the space to the mapping of the multi-agent organization. Thirdly, a modified multiple agent system oriented ant colony optimization algorithm is given, which contain pre-processing steps and the task allocation results are obtained by executing the trust region sqp algorithm in local solver. Finally, performance evaluation is conducted by experiments comparing with Random strategy and Instant optimal strategy, and very positive results are obtained

  6. Application of ant colony optimization to optimal foragaing theory: comparison of simulation and field results

    Science.gov (United States)

    Ant Colony Optimization (ACO) refers to the family of algorithms inspired by the behavior of real ants and used to solve combinatorial problems such as the Traveling Salesman Problem (TSP).Optimal Foraging Theory (OFT) is an evolutionary principle wherein foraging organisms or insect parasites seek ...

  7. Wavelet phase estimation using ant colony optimization algorithm

    Science.gov (United States)

    Wang, Shangxu; Yuan, Sanyi; Ma, Ming; Zhang, Rui; Luo, Chunmei

    2015-11-01

    Eliminating seismic wavelet is important in seismic high-resolution processing. However, artifacts may arise in seismic interpretation when the wavelet phase is inaccurately estimated. Therefore, we propose a frequency-dependent wavelet phase estimation method based on the ant colony optimization (ACO) algorithm with global optimization capacity. The wavelet phase can be optimized with the ACO algorithm by fitting nearby-well seismic traces with well-log data. Our proposed method can rapidly produce a frequency-dependent wavelet phase and optimize the seismic-to-well tie, particularly for weak signals. Synthetic examples demonstrate the effectiveness of the proposed ACO-based wavelet phase estimation method, even in the presence of a colored noise. Real data example illustrates that seismic deconvolution using an optimum mixed-phase wavelet can provide more information than that using an optimum constant-phase wavelet.

  8. A New Technique to Increase the Working Performance of the Ant Colony Optimization Algorithm

    OpenAIRE

    Reena Jindal; Dr.Samidha D.Sharma,; Prof.Manoj Sharma,

    2013-01-01

    The DBSCALE [1] algorithm is a popular algorithm in Data Mining field as it has the ability to mine the noiseless arbitrary shape Clusters in an elegant way. Such meta-heuristic algorithms include Ant Colony Optimization Algorithms, Particle Swarm Optimizations and Genetic Algorithm has received increasing attention in recent years. Ant Colony Optimization (ACO) is a technique that was introduced in the early 1990’s and it is inspired by the foraging behavior of ant colonies. .This paper pres...

  9. Using Ant Colony Optimization for Routing in VLSI Chips

    Science.gov (United States)

    Arora, Tamanna; Moses, Melanie

    2009-04-01

    Rapid advances in VLSI technology have increased the number of transistors that fit on a single chip to about two billion. A frequent problem in the design of such high performance and high density VLSI layouts is that of routing wires that connect such large numbers of components. Most wire-routing problems are computationally hard. The quality of any routing algorithm is judged by the extent to which it satisfies routing constraints and design objectives. Some of the broader design objectives include minimizing total routed wire length, and minimizing total capacitance induced in the chip, both of which serve to minimize power consumed by the chip. Ant Colony Optimization algorithms (ACO) provide a multi-agent framework for combinatorial optimization by combining memory, stochastic decision and strategies of collective and distributed learning by ant-like agents. This paper applies ACO to the NP-hard problem of finding optimal routes for interconnect routing on VLSI chips. The constraints on interconnect routing are used by ants as heuristics which guide their search process. We found that ACO algorithms were able to successfully incorporate multiple constraints and route interconnects on suite of benchmark chips. On an average, the algorithm routed with total wire length 5.5% less than other established routing algorithms.

  10. GrAnt: Inferring Best Forwarders from Complex Networks' Dynamics through a Greedy Ant Colony Optimization

    OpenAIRE

    Kochem Vendramin, Ana Cristina; Munaretto, Anelise; Regattieri Delgado, Myriam; Carneiro Viana, Aline

    2011-01-01

    This paper presents a new prediction-based forwarding protocol for the complex and dynamic Delay Tolerant Networks (DTN). The proposed protocol is called GrAnt (Greedy Ant) as it uses a greedy transition rule for the Ant Colony Optimization (ACO) metaheuristic to select the most promising forwarder nodes or to provide the exploitation of good paths previously found. The main motivation for the use of ACO is to take advantage of its population-based search and of the rapid adaptation of its le...

  11. Ant colony optimization as a method for strategic genotype sampling.

    Science.gov (United States)

    Spangler, M L; Robbins, K R; Bertrand, J K; Macneil, M; Rekaya, R

    2009-06-01

    A simulation study was carried out to develop an alternative method of selecting animals to be genotyped. Simulated pedigrees included 5000 animals, each assigned genotypes for a bi-allelic single nucleotide polymorphism (SNP) based on assumed allelic frequencies of 0.7/0.3 and 0.5/0.5. In addition to simulated pedigrees, two beef cattle pedigrees, one from field data and the other from a research population, were used to test selected methods using simulated genotypes. The proposed method of ant colony optimization (ACO) was evaluated based on the number of alleles correctly assigned to ungenotyped animals (AK(P)), the probability of assigning true alleles (AK(G)) and the probability of correctly assigning genotypes (APTG). The proposed animal selection method of ant colony optimization was compared to selection using the diagonal elements of the inverse of the relationship matrix (A(-1)). Comparisons of these two methods showed that ACO yielded an increase in AK(P) ranging from 4.98% to 5.16% and an increase in APTG from 1.6% to 1.8% using simulated pedigrees. Gains in field data and research pedigrees were slightly lower. These results suggest that ACO can provide a better genotyping strategy, when compared to A(-1), with different pedigree sizes and structures. PMID:19220227

  12. A hybrid ant colony algorithm for loading pattern optimization

    International Nuclear Information System (INIS)

    EDF (Electricity of France) operates 58 nuclear power plant (NPP), all of the Pressurized Water Reactor (PWR) type. The loading pattern (LP) optimization of these NPP is currently done by EDF expert engineers. Within this framework, EDF has developed automatic optimization tools that assist the experts. This paper presents firstly a description of the LP optimization problem listing its constraints. Secondly, a study of the search space is performed using the 'landscape fitness analysis' paradigm. Lastly, a hybrid algorithm based on ant colony and a local search method, is introduced to take advantage of the features of the problem. Tests have been performed on realistic cases. This hybrid algorithm has turned out to give very encouraging results when compared to a randomized local search method

  13. Mobile Anonymous Trust Based Routing Using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    R. Kalpana

    2012-01-01

    Full Text Available Problem statement: Ad hoc networks are susceptible to malicious attacks through denial of services, traffic analysis and spoofing. The security of the ad hoc routing protocol depends upon encryption, authentication, anonymity and trust factors. End-to-end security of data is provided by encryption and authentication, topology information of the nodes can be obtained by studying traffic and routing data. This security problem of ad hoc network is addressed by the use of anonymity mechanisms and trust levels. Identification information like traffic flow, network topology, paths from malicious attackers is hidden in anonymous networks. Similarly, trust plays a very important role in the intermediate node selection in ad hoc networks. Trust is essential as selfish and malicious nodes not only pose a security issue but also decreases the Quality of Service. Approach: In this study, a routing to address anonymous routing with a trust which improves the overall security of the ad hoc network was proposed. A new approach for an on demand ad-hoc routing algorithm, which was based on swarm intelligence. Ant colony algorithms were a subset of swarm intelligence and considered the ability of simple ants to solve complex problems by cooperation. The interesting point was, that the ants do not need any direct communication for the solution process, instead they communicate by stigmergy. The notion of stigmergy means the indirect communication of individuals through modifying their environment. Several algorithms which were based on ant colony problems were introduced in recent years to solve different problems, e.g., optimization problems. Results and Conclusion: It is observed that the overall security in the network improves when the trust factor is considered. It is seen that non performing nodes are not considered due to the proposed ACO technique.

  14. Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Boumediène ALLAOUA

    2008-12-01

    Full Text Available This paper presents the performance ant collective intelligence efficiency for electrical network. Solutions for Optimal Power Flow (OPF problem of a power system deliberate via an ant colony optimization metaheuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of transmission lines. Simulation results on the IEEE 30-bus electrical network show that the ant colony optimization method converges quickly to the global optimum.

  15. The analysis of the convergence of ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHU Qingbao; WANG Lingling

    2007-01-01

    The ant colony optimization algorithm has been widely studied and many important results have been obtained.Though this algorithm has been applied to many fields.the analysis about its convergence is much less,which will influence the improvement of this algorithm.Therefore,the convergence of this algorithm applied to the traveling salesman problem(TSP)was analyzed in detail.The conclusion that this algorithm will definitely converge to the optimal solution under the condition of 0<q0<1 was proved true.In addition,the influence on its convergence caused by the properties of the closed path,heuristic functions,the pheromone and q0 was analyzed.Based on the above-mentioned,some conclusions about how to improve the speed of its convergence are obtained.

  16. An Ant Colony Optimization Algorithm for Microwave Corrugated Filters Design

    Directory of Open Access Journals (Sweden)

    Ivan A. Mantilla-Gaviria

    2013-01-01

    Full Text Available A practical and useful application of the Ant Colony Optimization (ACO method for microwave corrugated filter design is shown. The classical, general purpose ACO method is adapted to deal with the microwave filter design problem. The design strategy used in this paper is an iterative procedure based on the use of an optimization method along with an electromagnetic simulator. The designs of high-pass and band-pass microwave rectangular waveguide filters working in the C-band and X-band, respectively, for communication applications, are shown. The average convergence performance of the ACO method is characterized by means of Monte Carlo simulations and compared with that obtained with the well-known Genetic Algorithm (GA. The overall performance, for the simulations presented herein, of the ACO is found to be better than that of the GA.

  17. Electromagnetic Wave Propagation Modeling Using the Ant Colony Optimization Algorithm

    Directory of Open Access Journals (Sweden)

    P. Pechac

    2002-09-01

    Full Text Available The Ant Colony Optimization algorithm - a multi-agent approach tocombinatorial optimization problems - is introduced for a simple raytracing performed on only an ordinary bitmap describing atwo-dimensional scenario. This bitmap can be obtained as a simple scanwhere different colors represent different mediums or obstacles. It isshown that using the presented algorithm a path minimizing the wavetraveling time can be found according to the Fermat's principle. Anexample of practical application is a simple ray tracing performed ononly an ordinary scanned bitmap of the city map. Together with theBerg's recursive model a non-line-of-sight path loss could becalculated without any need of building database. In this way thecoverage predictions for urban microcells could become extremely easyand fast to apply.

  18. Routing in Ad Hoc Network Using Ant Colony Optimization

    Science.gov (United States)

    Khanpara, Pimal; Valiveti, Sharada; Kotecha, K.

    The ad hoc networks have dynamic topology and are infrastructure less. So it is required to implement a new network protocol for providing efficient end to end communication based on TCP/IP structure. There is a need to re-define or modify the functions of each layer of TCP/IP model to provide end to end communication between nodes. The mobility of the nodes and the limited resources are the main reason for this change. The main challenge in ad hoc networks is routing. Due to the mobility of the nodes in the ad hoc networks, routing becomes very difficult. Ant based algorithms are suitable for routing in ad hoc networks due to its dynamic nature and adaptive behavior. There are number of routing algorithms based on the concept of ant colony optimizations. It is quite difficult to determine the best ant based algorithm for routing as these algorithms perform differently under various circumstances such as the traffic distribution and network topology. In this paper, the overview of such routing algorithms is given.

  19. DETECTION OF MASSES IN MAMMOGRAM IMAGES USING ANT COLONY OPTIMIZATION

    Directory of Open Access Journals (Sweden)

    Varsha Patankar

    2014-04-01

    Full Text Available This paper proposes the advances in edge detection techniques, which is used for the mammogram images for cancer diagnosis. It compares the evaluation of edge detection with the proposed method ant colony optimization. The study shows that the edge detection technique is applied on the mammogram images because it will clearly identify the masses in mammogram images. This will help to identify the type of cancer at the early stage. ACO edge detector is best in detecting the edges when compared to the other edge detectors. The quality of various edge detectors is calculated based on the parameters such as Peak signal to noise ratio (PSNR and Mean square error (MSE.

  20. A Survey Paper on Solving TSP using Ant Colony Optimization on GPU

    OpenAIRE

    Khushbu khatri; Vinit Kumar Gupta

    2014-01-01

    Ant Colony Optimization (ACO) is meta-heuristic algorithm inspired from nature to solve many combinatorial optimization problem such as Travelling Salesman Problem (TSP). There are many versions of ACO used to solve TSP like, Ant System, Elitist Ant System, Max-Min Ant System, Rank based Ant System algorithm. For improved performance, these methods can be implemented in parallel architecture like GPU, CUDA architecture. Graphics Processing Unit (GPU) provides highly parallel and f...

  1. CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET

    Science.gov (United States)

    Bajwa, Khalid Bashir; Khan, Salabat; Chaudary, Nadeem Majeed; Akram, Adeel

    2016-01-01

    A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO. PMID:27149517

  2. CACONET: Ant Colony Optimization (ACO) Based Clustering Algorithm for VANET.

    Science.gov (United States)

    Aadil, Farhan; Bajwa, Khalid Bashir; Khan, Salabat; Chaudary, Nadeem Majeed; Akram, Adeel

    2016-01-01

    A vehicular ad hoc network (VANET) is a wirelessly connected network of vehicular nodes. A number of techniques, such as message ferrying, data aggregation, and vehicular node clustering aim to improve communication efficiency in VANETs. Cluster heads (CHs), selected in the process of clustering, manage inter-cluster and intra-cluster communication. The lifetime of clusters and number of CHs determines the efficiency of network. In this paper a Clustering algorithm based on Ant Colony Optimization (ACO) for VANETs (CACONET) is proposed. CACONET forms optimized clusters for robust communication. CACONET is compared empirically with state-of-the-art baseline techniques like Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO). Experiments varying the grid size of the network, the transmission range of nodes, and number of nodes in the network were performed to evaluate the comparative effectiveness of these algorithms. For optimized clustering, the parameters considered are the transmission range, direction and speed of the nodes. The results indicate that CACONET significantly outperforms MOPSO and CLPSO. PMID:27149517

  3. CACO : Competitive Ant Colony Optimization, A Nature-Inspired Metaheuristic For Large-Scale Global Optimization

    OpenAIRE

    M. A. El-dosuky

    2013-01-01

    Large-scale problems are nonlinear problems that need metaheuristics, or global optimization algorithms. This paper reviews nature-inspired metaheuristics, then it introduces a framework named Competitive Ant Colony Optimization inspired by the chemical communications among insects. Then a case study is presented to investigate the proposed framework for large-scale global optimization.

  4. Optimal Power Flow of the Algerian Electrical Network using an Ant Colony Optimization Method

    Directory of Open Access Journals (Sweden)

    Tarek BOUKTIR

    2005-06-01

    Full Text Available This paper presents solution of optimal power flow (OPF problem of a power system via an Ant Colony Optimization Meta-heuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of transmission lines. Simulation results on the Algerian Electrical Network show that the Ant Colony Optimization method converges quickly to the global optimum.

  5. Collective Intelligence for Optimal Power Flow Solution Using Ant Colony Optimization

    OpenAIRE

    Boumediène ALLAOUA; Abdellah LAOUFI

    2008-01-01

    This paper presents the performance ant collective intelligence efficiency for electrical network. Solutions for Optimal Power Flow (OPF) problem of a power system deliberate via an ant colony optimization metaheuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power ...

  6. Reliability optimization using multiobjective ant colony system approaches

    International Nuclear Information System (INIS)

    The multiobjective ant colony system (ACS) meta-heuristic has been developed to provide solutions for the reliability optimization problem of series-parallel systems. This type of problems involves selection of components with multiple choices and redundancy levels that produce maximum benefits, and is subject to the cost and weight constraints at the system level. These are very common and realistic problems encountered in conceptual design of many engineering systems. It is becoming increasingly important to develop efficient solutions to these problems because many mechanical and electrical systems are becoming more complex, even as development schedules get shorter and reliability requirements become very stringent. The multiobjective ACS algorithm offers distinct advantages to these problems compared with alternative optimization methods, and can be applied to a more diverse problem domain with respect to the type or size of the problems. Through the combination of probabilistic search, multiobjective formulation of local moves and the dynamic penalty method, the multiobjective ACSRAP, allows us to obtain an optimal design solution very frequently and more quickly than with some other heuristic approaches. The proposed algorithm was successfully applied to an engineering design problem of gearbox with multiple stages

  7. Pixel-based ant colony algorithm for source mask optimization

    Science.gov (United States)

    Kuo, Hung-Fei; Wu, Wei-Chen; Li, Frederick

    2015-03-01

    Source mask optimization (SMO) was considered to be one of the key resolution enhancement techniques for node technology below 20 nm prior to the availability of extreme-ultraviolet tools. SMO has been shown to enlarge the process margins for the critical layer in SRAM and memory cells. In this study, a new illumination shape optimization approach was developed on the basis of the ant colony optimization (ACO) principle. The use of this heuristic pixel-based ACO method in the SMO process provides an advantage over the extant SMO method because of the gradient of the cost function associated with the rapid and stable searching capability of the proposed method. This study was conducted to provide lithographic engineers with references for the quick determination of the optimal illumination shape for complex mask patterns. The test pattern used in this study was a contact layer for SRAM design, with a critical dimension and a minimum pitch of 55 and 110 nm, respectively. The optimized freeform source shape obtained using the ACO method was numerically verified by performing an aerial image investigation, and the result showed that the optimized freeform source shape generated an aerial image profile different from the nominal image profile and with an overall error rate of 9.64%. Furthermore, the overall average critical shape difference was determined to be 1.41, which was lower than that for the other off-axis illumination exposure. The process window results showed an improvement in exposure latitude (EL) and depth of focus (DOF) for the ACO-based freeform source shape compared with those of the Quasar source shape. The maximum EL of the ACO-based freeform source shape reached 7.4% and the DOF was 56 nm at an EL of 5%.

  8. An Approximate Algorithm Combining P Systems and Ant Colony Optimization for Traveling Salesman Problems

    OpenAIRE

    Zhang, Gexiang; Cheng, Jixiang; Gheorghe, Marian; Research Group on Natural Computing (Universidad de Sevilla) (Coordinador)

    2010-01-01

    This paper proposes an approximate optimization algorithm combining P systems with ant colony optimization, called ACOPS, to solve traveling salesman prob- lems, which are well-known and extensively studied NP-complete combinatorial optimization problems. ACOPS uses the pheromone model and pheromone update rules defined by ant colony optimization algorithms, and the hierarchical membrane structure and transformation/communication rules of P systems. First, the parameter setting of...

  9. Ant colony Optimization: A Solution of Load balancing in Cloud

    Directory of Open Access Journals (Sweden)

    Ratan Mishra

    2012-05-01

    Full Text Available As the cloud computing is a new style of computing over internet. It has many advantages along with some crucial issues to be resolved in order to improve reliability of cloud environment. These issues are related with the load management, fault tolerance and different security issues in cloud environment. In this paper the main concern is load balancing in cloud computing. The load can be CPU load, memory capacity, delay or network load. Load balancing is the process of distributing the load among various nodes of adistributed system to improve both resource utilization and job response time while also avoiding a situation where some of the nodes are heavily loaded while other nodes are idle or doing very little work. Load balancing ensures that all the processor in the system or every node in the network does approximately the equal amount of work at any instant of time. Many methods to resolve this problem has been came into existence like Particle Swarm Optimization, hash method, genetic algorithms and severalscheduling based algorithms are there. In this paper we are proposing a method based on Ant Colony optimization to resolve the problem of load balancing in cloud environment.

  10. Applying Data Clustering Feature to Speed Up Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Chao-Yang Pang

    2014-01-01

    Full Text Available Ant colony optimization (ACO is often used to solve optimization problems, such as traveling salesman problem (TSP. When it is applied to TSP, its runtime is proportional to the squared size of problem N so as to look less efficient. The following statistical feature is observed during the authors’ long-term gene data analysis using ACO: when the data size N becomes big, local clustering appears frequently. That is, some data cluster tightly in a small area and form a class, and the correlation between different classes is weak. And this feature makes the idea of divide and rule feasible for the estimate of solution of TSP. In this paper an improved ACO algorithm is presented, which firstly divided all data into local clusters and calculated small TSP routes and then assembled a big TSP route with them. Simulation shows that the presented method improves the running speed of ACO by 200 factors under the condition that data set holds feature of local clustering.

  11. Study on ant colony optimization for fuel loading pattern problem

    International Nuclear Information System (INIS)

    Modified ant colony optimization (ACO) was applied to the in-core fuel loading pattern (LP) optimization problem to minimize the power peaking factor (PPF) in the modeled 1/4 symmetry PWR core. Loading order was found to be important in ACO. Three different loading orders with and without the adjacent effect between fuel assemblies (FAs) were compared, and it was found that the loading order from the central core is preferable because many selections of FAs to be inserted are available in the core center region. LPs were determined from pheromone trail and heuristic information, which is a priori knowledge based on the feature of the problem. Three types of heuristic information were compared to obtain the desirable performance of searching LPs with low PPF. Moreover, mutation operation, such as the genetic algorithm (GA), was introduced into the ACO algorithm to avoid searching similar LPs because heuristic information used in ACO tends to localize the searching space in the LP problem. The performance of ACO with some improvement was compared with those of simulated annealing and GA. In conclusion, good performance can be achieved by setting proper heuristic information and mutation operation parameter in ACO. (author)

  12. Data Mining using Advanced Ant Colony Optimization Algorithm and Application to Bankruptcy Prediction

    OpenAIRE

    Vishal Arora; Vadlamani Ravi

    2013-01-01

    Ant Colony Optimization (ACO) is gaining popularity as data mining technique in the domain of Swarm Intelligence for its simple, accurate and comprehensive nature of classification. In this paper the authors propose a novel advanced version of the original ant colony based miner (Ant-Miner) in order to extract classification rules from data. They call this Advanced ACO-Miner (ADACOM). The main goal of ADACOM is to explore the flexibility of using a different knowledge extraction heuristic app...

  13. Enhanced ant colony optimization for inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2015-10-01

    The inventory routing problem (IRP) integrates and coordinates two important components of supply chain management which are transportation and inventory management. We consider a one-to-many IRP network for a finite planning horizon. The demand for each product is deterministic and time varying as well as a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, delivers the products from the warehouse to meet the demand specified by the customers in each period. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount of inventory and to construct a delivery routing that minimizes both the total transportation and inventory holding cost while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer) for each instance considered. We propose an enhanced ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. The computational experiments demonstrating the effectiveness of our approach is presented.

  14. Improved Ant Colony Optimization Algorithm based Expert System on Nephrology

    Directory of Open Access Journals (Sweden)

    Sri.N.V.Ramana Murty

    2010-07-01

    Full Text Available Expert system Nephrology is a computer program that exhibits, within a specific domain, a degree of expertise in problem solving that is comparable to that of a human expert. The knowledge base consistsof information about a particular problem area. This information is collected from domain experts (doctors. This system mainly contains two modules one is Information System and the other is Expert Advisory system. The Information System contains the static information about different diseases and drugs in the field of Nephrology. This information system helps the patients /users to know about the problems related to kidneys. The Nephrology Advisory system helps the Patients /users to get the required and suitable advice depending on their queries. This medical expert system is developedusing Java Server Pages (JSP as front-end and MYSQL database as Backend in such a way that all the activities are carried out in a user-friendly manner. Improved Ant Colony Optimization Algorithm (ACO along with RETE algorithm is also used for better results.

  15. Ant colony optimization-based firewall anomaly mitigation engine.

    Science.gov (United States)

    Penmatsa, Ravi Kiran Varma; Vatsavayi, Valli Kumari; Samayamantula, Srinivas Kumar

    2016-01-01

    A firewall is the most essential component of network perimeter security. Due to human error and the involvement of multiple administrators in configuring firewall rules, there exist common anomalies in firewall rulesets such as Shadowing, Generalization, Correlation, and Redundancy. There is a need for research on efficient ways of resolving such anomalies. The challenge is also to see that the reordered or resolved ruleset conforms to the organization's framed security policy. This study proposes an ant colony optimization (ACO)-based anomaly resolution and reordering of firewall rules called ACO-based firewall anomaly mitigation engine. Modified strategies are also introduced to automatically detect these anomalies and to minimize manual intervention of the administrator. Furthermore, an adaptive reordering strategy is proposed to aid faster reordering when a new rule is appended. The proposed approach was tested with different firewall policy sets. The results were found to be promising in terms of the number of conflicts resolved, with minimal availability loss and marginal security risk. This work demonstrated the application of a metaheuristic search technique, ACO, in improving the performance of a packet-filter firewall with respect to mitigating anomalies in the rules, and at the same time demonstrated conformance to the security policy. PMID:27441151

  16. A Dynamic Algorithm for the Longest Common Subsequence Problem using Ant Colony Optimization Technique

    OpenAIRE

    Chaudhuri, Arindam

    2013-01-01

    We present a dynamic algorithm for solving the Longest Common Subsequence Problem using Ant Colony Optimization Technique. The Ant Colony Optimization Technique has been applied to solve many problems in Optimization Theory, Machine Learning and Telecommunication Networks etc. In particular, application of this theory in NP-Hard Problems has a remarkable significance. Given two strings, the traditional technique for finding Longest Common Subsequence is based on Dynamic Programming which cons...

  17. A Hybrid Monte Carlo Ant Colony Optimization Approach for Protein Structure Prediction in the HP Model

    OpenAIRE

    Giancarlo Mauri; Citrolo, Andrea G.

    2013-01-01

    The hydrophobic-polar (HP) model has been widely studied in the field of protein structure prediction (PSP) both for theoretical purposes and as a benchmark for new optimization strategies. In this work we introduce a new heuristics based on Ant Colony Optimization (ACO) and Markov Chain Monte Carlo (MCMC) that we called Hybrid Monte Carlo Ant Colony Optimization (HMCACO). We describe this method and compare results obtained on well known HP instances in the 3 dimensional cubic lattice to tho...

  18. Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO) Router Chip

    OpenAIRE

    Dervis Karaboga; Selcuk Okdem

    2009-01-01

    Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes. Illustrative examples, detailed descriptions a...

  19. Continuous function optimization using hybrid ant colony approach with orthogonal design scheme

    OpenAIRE

    Zhang, J.; Chen, W.; Zhong, J.; Tan, X.; Li, Y.

    2006-01-01

    A hybrid Orthogonal Scheme Ant Colony Optimization (OSACO) algorithm for continuous function optimization (CFO) is presented in this paper. The methodology integrates the advantages of Ant Colony Optimization (ACO) and Orthogonal Design Scheme (ODS). OSACO is based on the following principles: a) each independent variable space (IVS) of CFO is dispersed into a number of random and movable nodes; b) the carriers of pheromone of ACO are shifted to the nodes; c) solution path can be obtained by ...

  20. Optimization design of drilling string by screw coal miner based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qiang; MAO Jun; DING Fei

    2008-01-01

    It took that the weight minimum and drive efficiency maximal were as double optimizing target, the optimization model had built the drilling string, and the optimization solution was used of the ant colony algorithm to find in progress. Adopted a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strat-egy. The experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design, the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system re-search screw coal mine machine.

  1. Optimization design of drilling string by screw coal miner based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHANG Qiang; MAO Jun; DING Fei

    2008-01-01

    It took that the weight minimum and drive efficiency maximal were as double optimizing target,the optimization model had built the drilling string,and the optimization solution was used of the ant colony algorithm to find in progress.Adopted a two-layer search of the continuous space ant colony algorithm with overlapping or variation global ant search operation strategy and conjugated gradient partial ant search operation strategy.The experiment indicates that the spiral drill weight reduces 16.77% and transports the efficiency enhance 7.05% through the optimization design,the ant colony algorithm application on the spiral drill optimized design has provided the basis for the system research screw coal mine machine.

  2. Improved ant colony optimization for optimal crop and irrigation water allocation by incorporating domain knowledge

    Science.gov (United States)

    An improved ant colony optimization (ACO) formulation for the allocation of crops and water to different irrigation areas is developed. The formulation enables dynamic adjustment of decision variable options and makes use of visibility factors (VFs, the domain knowledge that can be used to identify ...

  3. Ant Colony Optimization ACO For The Traveling Salesman Problem TSP Using Partitioning

    OpenAIRE

    Alok Bajpai; Raghav Yadav

    2015-01-01

    Abstract An ant colony optimization is a technique which was introduced in 1990s and which can be applied to a variety of discrete combinatorial optimization problem and to continuous optimization. The ACO algorithm is simulated with the foraging behavior of the real ants to find the incremental solution constructions and to realize a pheromone laying-and-following mechanism. This pheromone is the indirect communication among the ants. In this paper we introduces the partitioning technique ba...

  4. Ant colony for TSP

    OpenAIRE

    Feng, Yinda

    2010-01-01

    The aim of this work is to investigate Ant Colony Algorithm for the traveling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. This paper is based on the ideas of ant colony algorithm and analysis the main parameters of the ant colony algorithm. Experimental results for solving TSP problems with ant colony algorithm show great...

  5. The optimal time-frequency atom search based on a modified ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    GUO Jun-feng; LI Yan-jun; YU Rui-xing; ZHANG Ke

    2008-01-01

    In this paper,a new optimal time-frequency atom search method based on a modified ant colony algorithm is proposed to improve the precision of the traditional methods.First,the discretization formula of finite length time-frequency atom is inferred at length.Second; a modified ant colony algorithm in continuous space is proposed.Finally,the optimal timefrequency atom search algorithm based on the modified ant colony algorithm is described in detail and the simulation experiment is carried on.The result indicates that the developed algorithm is valid and stable,and the precision of the method is higher than that of the traditional method.

  6. Novel Approach to Nonlinear PID Parameter Optimization Using Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    Duan Hai-bin; Wang Dao-bo; Yu Xiu-fen

    2006-01-01

    This paper presents an application of an Ant Colony Optimization (ACO) algorithm to optimize the parameters in the design of a type of nonlinear PID controller. The ACO algorithm is a novel heuristic bionic algorithm, which is based on the behaviour of real ants in nature searching for food. In order to optimize the parameters of the nonlinear PID controller using ACO algorithm,an objective function based on position tracing error was constructed, and elitist strategy was adopted in the improved ACO algorithm. Detailed simulation steps are presented. This nonlinear PID controller using the ACO algorithm has high precision of control and quick response.

  7. Using nonlinear optical networks for optimization: primer of the ant colony algorithm

    OpenAIRE

    Hu, W; Wu, K; Shum, P. P.; Zheludev, N. I.; Soci, C.; Adamo, G.

    2014-01-01

    Using nonlinear Erbium doped optical fiber network we have implemented an optimization algorithm for the famous problem of finding the shortest path on the map for the ant colony to travel to the foraging area.

  8. Ant Colony Optimization Analysis on Overall Stability of High Arch Dam Basis of Field Monitoring

    OpenAIRE

    Peng Lin; Xiaoli Liu; Hong-Xin Chen; Jinxie Kim

    2014-01-01

    A dam ant colony optimization (D-ACO) analysis of the overall stability of high arch dams on complicated foundations is presented in this paper. A modified ant colony optimization (ACO) model is proposed for obtaining dam concrete and rock mechanical parameters. A typical dam parameter feedback problem is proposed for nonlinear back-analysis numerical model based on field monitoring deformation and ACO. The basic principle of the proposed model is the establishment of the objective function o...

  9. Clarifying Cutting and Sewing Processes with Due Windows Using an Effective Ant Colony Optimization

    OpenAIRE

    Rong-Hwa Huang; Shun-Chi Yu

    2013-01-01

    The cutting and sewing process is a traditional flow shop scheduling problem in the real world. This two-stage flexible flow shop is often commonly associated with manufacturing in the fashion and textiles industry. Many investigations have demonstrated that the ant colony optimization (ACO) algorithm is effective and efficient for solving scheduling problems. This work applies a novel effective ant colony optimization (EACO) algorithm to solve two-stage flexible flow shop scheduling problems...

  10. A Survey Paper on Solving TSP using Ant Colony Optimization on GPU

    Directory of Open Access Journals (Sweden)

    Khushbu Khatri

    2014-12-01

    Full Text Available Ant Colony Optimization (ACO is meta-heuristic algorithm inspired from nature to solve many combinatorial optimization problem such as Travelling Salesman Problem (TSP. There are many versions of ACO used to solve TSP like, Ant System, Elitist Ant System, Max-Min Ant System, Rank based Ant System algorithm. For improved performance, these methods can be implemented in parallel architecture like GPU, CUDA architecture. Graphics Processing Unit (GPU provides highly parallel and fully programmable platform. GPUs which have many processing units with an off-chip global memory can be used for general purpose parallel computation. This paper presents a survey on different solving TSP using ACO on GPU.

  11. Finding a Maximum Clique using Ant Colony Optimization and Particle Swarm Optimization in Social Networks

    OpenAIRE

    Soleimani-Pouri, Mohammad; Rezvanian, Alireza; Meybodi, Mohammad Reza

    2013-01-01

    Interaction between users in online social networks plays a key role in social network analysis. One on important types of social group is full connected relation between some users, which known as clique structure. Therefore finding a maximum clique is essential for some analysis. In this paper, we proposed a new method using ant colony optimization algorithm and particle swarm optimization algorithm. In the proposed method, in order to attain better results, it is improved process of pherom...

  12. Optimal Power Flow of the Algerian Electrical Network using an Ant Colony Optimization Method

    OpenAIRE

    Tarek BOUKTIR; Linda SLIMANI

    2005-01-01

    This paper presents solution of optimal power flow (OPF) problem of a power system via an Ant Colony Optimization Meta-heuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of transmission lines. Simulation results on the Algerian Electrical Network show that...

  13. Optimal Reservoir Rule Curves Considering Conditional Ant Colony Optimization with Simulation Model

    OpenAIRE

    Chetthaphan Lokham; Anongrit Kangrang

    2013-01-01

    Reservoir rule curves are guideline for long term operation of multi-purpose reservoir that affected from severe flood and drought situations. This study proposed an alternative technique for searching optimal rule curves of multi-purpose reservoir. The proposed model consists of a Conditional Ant Colony Optimization (CACO) and a reservoir simulation model. Monthly rule curves of the Lampao Reservoir located in the northeast of Thailand was considered in this study. Four hundred samples of ge...

  14. Ant-Based Phylogenetic Reconstruction (ABPR): A new distance algorithm for phylogenetic estimation based on ant colony optimization

    OpenAIRE

    Karla Vittori; Alexandre C B Delbem; Pereira, Sérgio L

    2008-01-01

    We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO), named Ant-Based Phylogenetic Reconstruction (ABPR). ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenetic estimation, the algorithm allows exploration of a larger set of nearly optimal solutions. We appl...

  15. A Hybrid Ant Colony Optimization for the Prediction of Protein Secondary Structure

    Institute of Scientific and Technical Information of China (English)

    Chao CHEN; Yuan Xin TIAN; Xiao Yong ZOU; Pei Xiang CAI; Jin Yuan MO

    2005-01-01

    Based on the concept of ant colony optimization and the idea of population in genetic algorithm, a novel global optimization algorithm, called the hybrid ant colony optimization (HACO), is proposed in this paper to tackle continuous-space optimization problems. It was compared with other well-known stochastic methods in the optimization of the benchmark functions and was also used to solve the problem of selecting appropriate dilation efficiently by optimizing the wavelet power spectrum of the hydrophobic sequence of protein, which is thc key step on using continuous wavelet transform (CWT) to predict a-helices and connecting peptides.

  16. An adaptive ant colony system algorithm for continuous-space optimization problems

    Institute of Scientific and Technical Information of China (English)

    李艳君; 吴铁军

    2003-01-01

    Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates. Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.

  17. An adaptive ant colony system algorithm for continuous-space optimization problems

    Institute of Scientific and Technical Information of China (English)

    李艳君; 吴铁军

    2003-01-01

    Ant colony algorithms comprise a novel category of evolutionary computation methods for optimization problems, especially for sequencing-type combinatorial optimization problems. An adaptive ant colony algorithm is proposed in this paper to tackle continuous-space optimization problems, using a new objective-function-based heuristic pheromone assignment approach for pheromone update to filtrate solution candidates.Global optimal solutions can be reached more rapidly by self-adjusting the path searching behaviors of the ants according to objective values. The performance of the proposed algorithm is compared with a basic ant colony algorithm and a Square Quadratic Programming approach in solving two benchmark problems with multiple extremes. The results indicated that the efficiency and reliability of the proposed algorithm were greatly improved.

  18. Identification of Dynamic Parameters Based on Pseudo-Parallel Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHAO Feng-yao; MA Zhen-yue; ZHANG Yun-liang

    2007-01-01

    For the parameter identification of dynamic problems, a pseudo-parallel ant colony optimization (PPACO) algorithm based on graph-based ant system (AS) was introduced. On the platform of ANSYS dynamic analysis, the PPACO algorithm was applied to the identification of dynamic parameters successfully. Using simulated data of forces and displacements, elastic modulus E and damping ratio ξ was identified for a designed 3D finite element model, and the detailed identification step was given. Mathematical example and simulation example show that the proposed method has higher precision, faster convergence speed and stronger antinoise ability compared with the standard genetic algorithm and the ant colony optimization (ACO) algorithms.

  19. An Improved Ant Colony Optimization Approach for Optimization of Process Planning

    OpenAIRE

    JinFeng Wang; XiaoLiang Fan; Haimin Ding

    2014-01-01

    Computer-aided process planning (CAPP) is an important interface between computer-aided design (CAD) and computer-aided manufacturing (CAM) in computer-integrated manufacturing environments (CIMs). In this paper, process planning problem is described based on a weighted graph, and an ant colony optimization (ACO) approach is improved to deal with it effectively. The weighted graph consists of nodes, directed arcs, and undirected arcs, which denote operations, precedence constraints among oper...

  20. Inverse transient radiation analysis in one-dimensional participating slab using improved Ant Colony Optimization algorithms

    Science.gov (United States)

    Zhang, B.; Qi, H.; Ren, Y. T.; Sun, S. C.; Ruan, L. M.

    2014-01-01

    As a heuristic intelligent optimization algorithm, the Ant Colony Optimization (ACO) algorithm was applied to the inverse problem of a one-dimensional (1-D) transient radiative transfer in present study. To illustrate the performance of this algorithm, the optical thickness and scattering albedo of the 1-D participating slab medium were retrieved simultaneously. The radiative reflectance simulated by Monte-Carlo Method (MCM) and Finite Volume Method (FVM) were used as measured and estimated value for the inverse analysis, respectively. To improve the accuracy and efficiency of the Basic Ant Colony Optimization (BACO) algorithm, three improved ACO algorithms, i.e., the Region Ant Colony Optimization algorithm (RACO), Stochastic Ant Colony Optimization algorithm (SACO) and Homogeneous Ant Colony Optimization algorithm (HACO), were developed. By the HACO algorithm presented, the radiative parameters could be estimated accurately, even with noisy data. In conclusion, the HACO algorithm is demonstrated to be effective and robust, which had the potential to be implemented in various fields of inverse radiation problems.

  1. Inverse transient radiation analysis in one-dimensional participating slab using improved Ant Colony Optimization algorithms

    International Nuclear Information System (INIS)

    As a heuristic intelligent optimization algorithm, the Ant Colony Optimization (ACO) algorithm was applied to the inverse problem of a one-dimensional (1-D) transient radiative transfer in present study. To illustrate the performance of this algorithm, the optical thickness and scattering albedo of the 1-D participating slab medium were retrieved simultaneously. The radiative reflectance simulated by Monte-Carlo Method (MCM) and Finite Volume Method (FVM) were used as measured and estimated value for the inverse analysis, respectively. To improve the accuracy and efficiency of the Basic Ant Colony Optimization (BACO) algorithm, three improved ACO algorithms, i.e., the Region Ant Colony Optimization algorithm (RACO), Stochastic Ant Colony Optimization algorithm (SACO) and Homogeneous Ant Colony Optimization algorithm (HACO), were developed. By the HACO algorithm presented, the radiative parameters could be estimated accurately, even with noisy data. In conclusion, the HACO algorithm is demonstrated to be effective and robust, which had the potential to be implemented in various fields of inverse radiation problems. -- Highlights: • The ACO-based algorithms were firstly applied to the inverse transient radiation problem. • Three ACO-based algorithms were developed based on the BACO algorithm for continuous domain problem. • HACO shows a robust performance for simultaneous estimation of the radiative properties

  2. Distribution system minimum loss reconfiguration in the Hyper-Cube Ant Colony Optimization framework

    Energy Technology Data Exchange (ETDEWEB)

    Carpaneto, Enrico; Chicco, Gianfranco [Dipartimento di Ingegneria Elettrica, Politecnico di Torino, corso Duca degli Abruzzi 24, I-10129 Torino (Italy)

    2008-12-15

    This paper presents an original application of the Ant Colony Optimization concepts to the optimal reconfiguration of distribution systems, with the objective of minimizing the distribution system losses in the presence of a set of structural and operational constraints. The proposed algorithm starts from the current configuration of the system and proceeds by progressively introducing variations in the configuration according to local and global heuristic rules developed within the Hyper-Cube Ant Colony Optimization framework. Results of numerical tests carried out on a classical system and on a large real urban distribution system are presented to show the effectiveness of the proposed approach. (author)

  3. Application of ant colony optimization approach to severe accident management measures of Maanshan nuclear power plant

    International Nuclear Information System (INIS)

    The first three guidelines in the Maanshan SAMG were respectively evaluated for the effects in the SBO incident. The MAAP5 code was used to simulate the sequence of events and physical phenomena in the plant. The results show that the priority optimization should be carried out at two separated scenarios, i.e. the power recovered prior or after hot-leg creep rupture. The performance indices in the ant colony optimization could be the vessel life and the hydrogen generation from core for ant colony optimization. (author)

  4. Application of ant colony optimization approach to severe accident management measures of Maanshan nuclear power plant

    Energy Technology Data Exchange (ETDEWEB)

    Tsai, C.-M.; Wang, S.-J. [Inst. of Nuclear Energy Research, Taiwan (China)

    2011-07-01

    The first three guidelines in the Maanshan SAMG were respectively evaluated for the effects in the SBO incident. The MAAP5 code was used to simulate the sequence of events and physical phenomena in the plant. The results show that the priority optimization should be carried out at two separated scenarios, i.e. the power recovered prior or after hot-leg creep rupture. The performance indices in the ant colony optimization could be the vessel life and the hydrogen generation from core for ant colony optimization. (author)

  5. Dynamic Load Balancing Strategy for Cloud Computing with Ant Colony Optimization

    OpenAIRE

    Ren Gao; Juebo Wu

    2015-01-01

    How to distribute and coordinate tasks in cloud computing is a challenging issue, in order to get optimal resource utilization and avoid overload. In this paper, we present a novel approach on load balancing via ant colony optimization (ACO), for balancing the workload in a cloud computing platform dynamically. Two strategies, forward-backward ant mechanism and max-min rules, are introduced to quickly find out the candidate nodes for load balancing. We formulate pheromone initialization and p...

  6. A Multi Ant Colony Optimization algorithm for a Mixed Car Assembly Line

    OpenAIRE

    Pulido, Raúl; García Sánchez, Álvaro; Diego, Francisco Javier; Andrés-Romano, Carlos

    2013-01-01

    This paper presents an ant colony optimization algorithm to sequence the mixed assembly lines considering the inventory and the replenishment of components. This is a NP-problem that cannot be solved to optimality by exact methods when the size of the problem growth. Groups of specialized ants are implemented to solve the different parts of the problem. This is intended to differentiate each part of the problem. Different types of pheromone structures are created to identify good car sequence...

  7. A Graph-based Ant Colony Optimization Approach for Integrated Process Planning and Scheduling

    Institute of Scientific and Technical Information of China (English)

    Jinfeng Wang; Xiaoliang Fan; Chaowei Zhang; Shuting Wan

    2014-01-01

    This paper considers an ant colony optimization algorithm based on AND/OR graph for integrated process planning and scheduling (IPPS). General y, the process planning and scheduling are studied separately. Due to the complexity of manufacturing system, IPPS combining both process planning and scheduling can depict the real situation of a manufacturing system. The IPPS is represented on AND/OR graph consisting of nodes, and undirected and directed arcs. The nodes denote operations of jobs, and undirected/directed arcs denote possible visiting path among the nodes. Ant colony goes through the necessary nodes on the graph from the starting node to the end node to obtain the optimal solution with the objective of minimizing makespan. In order to avoid local convergence and low convergence, some improved strategy is incorporated in the standard ant colony optimiza-tion algorithm. Extensive computational experiments are carried out to study the influence of various parameters on the system performance.

  8. Application of Modified Ant Colony Optimization (MACO for Multicast Routing Problem

    Directory of Open Access Journals (Sweden)

    Sudip Kumar Sahana

    2016-04-01

    Full Text Available It is well known that multicast routing is combinatorial problem finds the optimal path between source destination pairs. Traditional approaches solve this problem by establishment of the spanning tree for the network which is mapped as an undirected weighted graph. This paper proposes a Modified Ant Colony Optimization (MACO algorithm which is based on Ant Colony System (ACS with some modification in the configuration of starting movement and in local updation technique to overcome the basic limitations of ACS such as poor initialization and slow convergence rate. It is shown that the proposed Modified Ant Colony Optimization (MACO shows better convergence speed and consumes less time than the conventional ACS to achieve the desired solution.

  9. An Effect and Analysis of Parameter on Ant Colony Optimization for Solving Travelling Salesman Problem

    OpenAIRE

    Km. Shweta; Alka Singh

    2013-01-01

    Ant Colony optimization has proved suitable to solve a wide range of combinatorial optimization(or NP-hard) problems as the Travelling Salesman Problem (TSP). The first step of ACO algorithm is to setthe parameters that drive the algorithm. The parameter has an important impact on the performance of theant colony algorithm. The basic parameters that are used in ACO algorithms are; the relative importance (orweight) of pheromone, the relative importance of heuristics value, initial pheromone v...

  10. Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence

    Science.gov (United States)

    Srinivasan, Thenmozhi; Palanisamy, Balasubramanie

    2015-01-01

    Clusters of high-dimensional data techniques are emerging, according to data noisy and poor quality challenges. This paper has been developed to cluster data using high-dimensional similarity based PCM (SPCM), with ant colony optimization intelligence which is effective in clustering nonspatial data without getting knowledge about cluster number from the user. The PCM becomes similarity based by using mountain method with it. Though this is efficient clustering, it is checked for optimization using ant colony algorithm with swarm intelligence. Thus the scalable clustering technique is obtained and the evaluation results are checked with synthetic datasets. PMID:26495413

  11. Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence.

    Science.gov (United States)

    Srinivasan, Thenmozhi; Palanisamy, Balasubramanie

    2015-01-01

    Clusters of high-dimensional data techniques are emerging, according to data noisy and poor quality challenges. This paper has been developed to cluster data using high-dimensional similarity based PCM (SPCM), with ant colony optimization intelligence which is effective in clustering nonspatial data without getting knowledge about cluster number from the user. The PCM becomes similarity based by using mountain method with it. Though this is efficient clustering, it is checked for optimization using ant colony algorithm with swarm intelligence. Thus the scalable clustering technique is obtained and the evaluation results are checked with synthetic datasets. PMID:26495413

  12. An Ant Colony Optimization Based Dimension Reduction Method for High-Dimensional Datasets

    Institute of Scientific and Technical Information of China (English)

    Ying Li; Gang Wang; Huiling Chen; Lian Shi; Lei Qin

    2013-01-01

    In this paper,a bionic optimization algorithm based dimension reduction method named Ant Colony Optimization -Selection (ACO-S) is proposed for high-dimensional datasets.Because microarray datasets comprise tens of thousands of features (genes),they are usually used to test the dimension reduction techniques.ACO-S consists of two stages in which two well-known ACO algorithms,namely ant system and ant colony system,are utilized to seek for genes,respectively.In the first stage,a modified ant system is used to filter the nonsignificant genes from high-dimensional space,and a number of promising genes are reserved in the next step.In the second stage,an improved ant colony system is applied to gene selection.In order to enhance the search ability of ACOs,we propose a method for calculating priori available heuristic information and design a fuzzy logic controller to dynamically adjust the number of ants in ant colony system.Furthermore,we devise another fuzzy logic controller to tune the parameter (q0) in ant colony system.We evaluate the performance of ACO-S on five microarray datasets,which have dimensions varying from 7129 to 12000.We also compare the performance of ACO-S with the results obtained from four existing well-known bionic optimization algorithms.The comparison results show that ACO-S has a notable ability to generate a gene subset with the smallest size and salient features while yielding high classification accuracy.The comparative results generated by ACO-S adopting different classifiers are also given.The proposed method is shown to be a promising and effective tool for mining high-dimension data and mobile robot navigation.

  13. Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems

    Institute of Scientific and Technical Information of China (English)

    Xiao-Min Hu; Jun Zhang; Yun Li

    2008-01-01

    Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional ant algorithms are designed for combinatorial optimization, they have shown great potential in solving a wide range of optimization problems, including continuous optimization. Aimed at solving continuous problems effectively, this paper develops a novel ant algorithm termed "continuous orthogonal ant colony" (COAC), whose pheromone deposit mechanisms would enable ants to search for solutions collaboratively and effectively. By using the orthogonal design method, ants in the feasible domain can explore their chosen regions rapidly and efficiently. By implementing an "adaptive regional radius" method, the proposed algorithm can reduce the probability of being trapped in local optima and therefore enhance the global search capability and accuracy. An elitist strategy is also employed to reserve the most valuable points. The performance of the COAC is compared with two other ant algorithms for continuous optimization -- API and CACO by testing seventeen functions in the continuous domain. The results demonstrate that the proposed COAC algorithm outperforms the others.

  14. Convergence results for continuous-time dynamics arising in ant colony optimization

    OpenAIRE

    Bliman, Pierre-Alexandre; Bhaya, Amit; Kaszkurewicz, Eugenius; Jayadeva

    2014-01-01

    This paper studies the asymptotic behavior of several continuous-time dynamical systems which are analogs of ant colony optimization algorithms that solve shortest path problems. Local asymptotic stability of the equilibrium corresponding to the shortest path is shown under mild assumptions. A complete study is given for a recently proposed model called EigenAnt: global asymptotic stability is shown, and the speed of convergence is calculated explicitly and shown to be proportional to the dif...

  15. ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization

    OpenAIRE

    Rafid Sagban; Ku Ruhana Ku-Mahamud; Muhamad Shahbani Abu Bakar

    2015-01-01

    A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens’ acoustics of their ant hosts. The parasites’ reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance’s matrix, esp...

  16. Edge Detection of Medical Images Using Modified Ant Colony Optimization Algorithm based on Weighted Heuristics

    Directory of Open Access Journals (Sweden)

    Puneet Rai

    2014-02-01

    Full Text Available Ant Colony Optimization (ACO is nature inspired algorithm based on foraging behavior of ants. The algorithm is based on the fact how ants deposit pheromone while searching for food. ACO generates a pheromone matrix which gives the edge information present at each pixel position of image, formed by ants dispatched on image. The movement of ants depends on local variance of image's intensity value. This paper proposes an improved method based on heuristic which assigns weight to the neighborhood. Thus by assigning the weights or priority to the neighboring pixels, the ant decides in which direction it can move. The method is applied on Medical images and experimental results are provided to support the superior performance of the proposed approach and the existing method.

  17. ACOustic: A Nature-Inspired Exploration Indicator for Ant Colony Optimization.

    Science.gov (United States)

    Sagban, Rafid; Ku-Mahamud, Ku Ruhana; Abu Bakar, Muhamad Shahbani

    2015-01-01

    A statistical machine learning indicator, ACOustic, is proposed to evaluate the exploration behavior in the iterations of ant colony optimization algorithms. This idea is inspired by the behavior of some parasites in their mimicry to the queens' acoustics of their ant hosts. The parasites' reaction results from their ability to indicate the state of penetration. The proposed indicator solves the problem of robustness that results from the difference of magnitudes in the distance's matrix, especially when combinatorial optimization problems with rugged fitness landscape are applied. The performance of the proposed indicator is evaluated against the existing indicators in six variants of ant colony optimization algorithms. Instances for travelling salesman problem and quadratic assignment problem are used in the experimental evaluation. The analytical results showed that the proposed indicator is more informative and more robust. PMID:25954768

  18. Item Selection for the Development of Short Forms of Scales Using an Ant Colony Optimization Algorithm

    Science.gov (United States)

    Leite, Walter L.; Huang, I-Chan; Marcoulides, George A.

    2008-01-01

    This article presents the use of an ant colony optimization (ACO) algorithm for the development of short forms of scales. An example 22-item short form is developed for the Diabetes-39 scale, a quality-of-life scale for diabetes patients, using a sample of 265 diabetes patients. A simulation study comparing the performance of the ACO algorithm and…

  19. Ant colony optimization analysis on overall stability of high arch dam basis of field monitoring.

    Science.gov (United States)

    Lin, Peng; Liu, Xiaoli; Chen, Hong-Xin; Kim, Jinxie

    2014-01-01

    A dam ant colony optimization (D-ACO) analysis of the overall stability of high arch dams on complicated foundations is presented in this paper. A modified ant colony optimization (ACO) model is proposed for obtaining dam concrete and rock mechanical parameters. A typical dam parameter feedback problem is proposed for nonlinear back-analysis numerical model based on field monitoring deformation and ACO. The basic principle of the proposed model is the establishment of the objective function of optimizing real concrete and rock mechanical parameter. The feedback analysis is then implemented with a modified ant colony algorithm. The algorithm performance is satisfactory, and the accuracy is verified. The m groups of feedback parameters, used to run a nonlinear FEM code, and the displacement and stress distribution are discussed. A feedback analysis of the deformation of the Lijiaxia arch dam and based on the modified ant colony optimization method is also conducted. By considering various material parameters obtained using different analysis methods, comparative analyses were conducted on dam displacements, stress distribution characteristics, and overall dam stability. The comparison results show that the proposal model can effectively solve for feedback multiple parameters of dam concrete and rock material and basically satisfy assessment requirements for geotechnical structural engineering discipline. PMID:25025089

  20. Ant Colony Optimization Analysis on Overall Stability of High Arch Dam Basis of Field Monitoring

    Directory of Open Access Journals (Sweden)

    Peng Lin

    2014-01-01

    Full Text Available A dam ant colony optimization (D-ACO analysis of the overall stability of high arch dams on complicated foundations is presented in this paper. A modified ant colony optimization (ACO model is proposed for obtaining dam concrete and rock mechanical parameters. A typical dam parameter feedback problem is proposed for nonlinear back-analysis numerical model based on field monitoring deformation and ACO. The basic principle of the proposed model is the establishment of the objective function of optimizing real concrete and rock mechanical parameter. The feedback analysis is then implemented with a modified ant colony algorithm. The algorithm performance is satisfactory, and the accuracy is verified. The m groups of feedback parameters, used to run a nonlinear FEM code, and the displacement and stress distribution are discussed. A feedback analysis of the deformation of the Lijiaxia arch dam and based on the modified ant colony optimization method is also conducted. By considering various material parameters obtained using different analysis methods, comparative analyses were conducted on dam displacements, stress distribution characteristics, and overall dam stability. The comparison results show that the proposal model can effectively solve for feedback multiple parameters of dam concrete and rock material and basically satisfy assessment requirements for geotechnical structural engineering discipline.

  1. Optimal Selection of Parameters for Nonuniform Embedding of Chaotic Time Series Using Ant Colony Optimization.

    Science.gov (United States)

    Shen, Meie; Chen, Wei-Neng; Zhang, Jun; Chung, Henry Shu-Hung; Kaynak, Okyay

    2013-04-01

    The optimal selection of parameters for time-delay embedding is crucial to the analysis and the forecasting of chaotic time series. Although various parameter selection techniques have been developed for conventional uniform embedding methods, the study of parameter selection for nonuniform embedding is progressed at a slow pace. In nonuniform embedding, which enables different dimensions to have different time delays, the selection of time delays for different dimensions presents a difficult optimization problem with combinatorial explosion. To solve this problem efficiently, this paper proposes an ant colony optimization (ACO) approach. Taking advantage of the characteristic of incremental solution construction of the ACO, the proposed ACO for nonuniform embedding (ACO-NE) divides the solution construction procedure into two phases, i.e., selection of embedding dimension and selection of time delays. In this way, both the embedding dimension and the time delays can be optimized, along with the search process of the algorithm. To accelerate search speed, we extract useful information from the original time series to define heuristics to guide the search direction of ants. Three geometry- or model-based criteria are used to test the performance of the algorithm. The optimal embeddings found by the algorithm are also applied in time-series forecasting. Experimental results show that the ACO-NE is able to yield good embedding solutions from both the viewpoints of optimization performance and prediction accuracy. PMID:23144038

  2. A Graph-Based Ant Colony Optimization Approach for Process Planning

    OpenAIRE

    2014-01-01

    The complex process planning problem is modeled as a combinatorial optimization problem with constraints in this paper. An ant colony optimization (ACO) approach has been developed to deal with process planning problem by simultaneously considering activities such as sequencing operations, selecting manufacturing resources, and determining setup plans to achieve the optimal process plan. A weighted directed graph is conducted to describe the operations, precedence constraints between operatio...

  3. An improved ant colony optimization approach for optimization of process planning.

    Science.gov (United States)

    Wang, JinFeng; Fan, XiaoLiang; Ding, Haimin

    2014-01-01

    Computer-aided process planning (CAPP) is an important interface between computer-aided design (CAD) and computer-aided manufacturing (CAM) in computer-integrated manufacturing environments (CIMs). In this paper, process planning problem is described based on a weighted graph, and an ant colony optimization (ACO) approach is improved to deal with it effectively. The weighted graph consists of nodes, directed arcs, and undirected arcs, which denote operations, precedence constraints among operation, and the possible visited path among operations, respectively. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing total production costs (TPCs). A pheromone updating strategy proposed in this paper is incorporated in the standard ACO, which includes Global Update Rule and Local Update Rule. A simple method by controlling the repeated number of the same process plans is designed to avoid the local convergence. A case has been carried out to study the influence of various parameters of ACO on the system performance. Extensive comparative experiments have been carried out to validate the feasibility and efficiency of the proposed approach. PMID:25097874

  4. A Preliminary Study of Automatic Delineation of Eyes on CT Images Using Ant Colony Optimization

    Institute of Scientific and Technical Information of China (English)

    LI Yong-jie; XIE Wei-fu; YAO De-zhong

    2007-01-01

    Eyes are important organs-at-risk (OARs) that should be protected during the radiation treatment of those head tumors. Correct delineation of the eyes on CT images is one of important issues for treatment planning to protect the eyes as much as possible. In this paper, we propose a new method, named ant colony optimization (ACO), to delineate the eyes automatically.In the proposed algorithm, each ant tries to find a closed path, and some pheromone is deposited on the visited path when the ant finds a path. After all ants finish a circle, the best ant will lay some pheromone to enforce the best path. The proposed algorithm is verified on several CT images, and the preliminary results demonstrate the feasibility of ACO for the delineation problem.

  5. AntEpiSeeker: detecting epistatic interactions for case-control studies using a two-stage ant colony optimization algorithm

    OpenAIRE

    Liu Xinyu; Wang Yupeng; Robbins Kelly; Rekaya Romdhane

    2010-01-01

    Abstract Background Epistatic interactions of multiple single nucleotide polymorphisms (SNPs) are now believed to affect individual susceptibility to common diseases. The detection of such interactions, however, is a challenging task in large scale association studies. Ant colony optimization (ACO) algorithms have been shown to be useful in detecting epistatic interactions. Findings AntEpiSeeker, a new two-stage ant colony optimization algorithm, has been developed for detecting epistasis in ...

  6. Multi-view 3D scene reconstruction using ant colony optimization techniques

    International Nuclear Information System (INIS)

    This paper presents a new method performing high-quality 3D object reconstruction of complex shapes derived from multiple, calibrated photographs of the same scene. The novelty of this research is found in two basic elements, namely: (i) a novel voxel dissimilarity measure, which accommodates the elimination of the lighting variations of the models and (ii) the use of an ant colony approach for further refinement of the final 3D models. The proposed reconstruction procedure employs a volumetric method based on a novel projection test for the production of a visual hull. While the presented algorithm shares certain aspects with the space carving algorithm, it is, nevertheless, first enhanced with the lightness compensating image comparison method, and then refined using ant colony optimization. The algorithm is fast, computationally simple and results in accurate representations of the input scenes. In addition, compared to previous publications, the particular nature of the proposed algorithm allows accurate 3D volumetric measurements under demanding lighting environmental conditions, due to the fact that it can cope with uneven light scenes, resulting from the characteristics of the voxel dissimilarity measure applied. Besides, the intelligent behavior of the ant colony framework provides the opportunity to formulate the process as a combinatorial optimization problem, which can then be solved by means of a colony of cooperating artificial ants, resulting in very promising results. The method is validated with several real datasets, along with qualitative comparisons with other state-of-the-art 3D reconstruction techniques, following the Middlebury benchmark. (paper)

  7. Ant-cuckoo colony optimization for feature selection in digital mammogram.

    Science.gov (United States)

    Jona, J B; Nagaveni, N

    2014-01-15

    Digital mammogram is the only effective screening method to detect the breast cancer. Gray Level Co-occurrence Matrix (GLCM) textural features are extracted from the mammogram. All the features are not essential to detect the mammogram. Therefore identifying the relevant feature is the aim of this work. Feature selection improves the classification rate and accuracy of any classifier. In this study, a new hybrid metaheuristic named Ant-Cuckoo Colony Optimization a hybrid of Ant Colony Optimization (ACO) and Cuckoo Search (CS) is proposed for feature selection in Digital Mammogram. ACO is a good metaheuristic optimization technique but the drawback of this algorithm is that the ant will walk through the path where the pheromone density is high which makes the whole process slow hence CS is employed to carry out the local search of ACO. Support Vector Machine (SVM) classifier with Radial Basis Kernal Function (RBF) is done along with the ACO to classify the normal mammogram from the abnormal mammogram. Experiments are conducted in miniMIAS database. The performance of the new hybrid algorithm is compared with the ACO and PSO algorithm. The results show that the hybrid Ant-Cuckoo Colony Optimization algorithm is more accurate than the other techniques. PMID:24783812

  8. A graph-based ant colony optimization approach for process planning.

    Science.gov (United States)

    Wang, JinFeng; Fan, XiaoLiang; Wan, Shuting

    2014-01-01

    The complex process planning problem is modeled as a combinatorial optimization problem with constraints in this paper. An ant colony optimization (ACO) approach has been developed to deal with process planning problem by simultaneously considering activities such as sequencing operations, selecting manufacturing resources, and determining setup plans to achieve the optimal process plan. A weighted directed graph is conducted to describe the operations, precedence constraints between operations, and the possible visited path between operation nodes. A representation of process plan is described based on the weighted directed graph. Ant colony goes through the necessary nodes on the graph to achieve the optimal solution with the objective of minimizing total production costs (TPC). Two cases have been carried out to study the influence of various parameters of ACO on the system performance. Extensive comparative experiments have been conducted to demonstrate the feasibility and efficiency of the proposed approach. PMID:24995355

  9. Image Watermarking Algorithm Based on Multiobjective Ant Colony Optimization and Singular Value Decomposition in Wavelet Domain

    Directory of Open Access Journals (Sweden)

    Khaled Loukhaoukha

    2013-01-01

    Full Text Available We present a new optimal watermarking scheme based on discrete wavelet transform (DWT and singular value decomposition (SVD using multiobjective ant colony optimization (MOACO. A binary watermark is decomposed using a singular value decomposition. Then, the singular values are embedded in a detailed subband of host image. The trade-off between watermark transparency and robustness is controlled by multiple scaling factors (MSFs instead of a single scaling factor (SSF. Determining the optimal values of the multiple scaling factors (MSFs is a difficult problem. However, a multiobjective ant colony optimization is used to determine these values. Experimental results show much improved performances of the proposed scheme in terms of transparency and robustness compared to other watermarking schemes. Furthermore, it does not suffer from the problem of high probability of false positive detection of the watermarks.

  10. Novel Voltage Scaling Algorithm Through Ant Colony Optimization for Embedded Distributed Systems

    Institute of Scientific and Technical Information of China (English)

    ZHANG Li-sheng; DING Dan

    2007-01-01

    Dynamic voltage scaling (DVS), supported by many DVS-enabled processors, is an efficient technique for energy-efficient embedded systems. Many researchers work on DVS and have presented various DVS algorithms, some with quite good results . However, the previous algorithms either have a large time complexity or obtain results sensitive to the count of the voltage modes. Fine-grained voltage modes lead to optimal results, but coarse-grained voltage modes cause less optimal one. A new algorithm is presented, which is based on ant colony optimization, called ant colony optimization voltage and task scheduling (ACO-VTS) with a low time complexity implemented by parallelizing and its linear time approximation algo rithm. Both of them generate quite good results, saving up to 30% more energy than that of the previous ones under coarse-grained modes, and their results don't depend on the number of modes available.

  11. Intercluster Ant Colony Optimization Algorithm for Wireless Sensor Network in Dense Environment

    OpenAIRE

    Jung-Yoon Kim; Tripti Sharma; Brijesh Kumar; Tomar, G. S.; Karan Berry; Won-Hyung Lee

    2014-01-01

    Wireless sensor networks have grown rapidly with the innovation in Information Technology. Sensor nodes are distributed and deployed over the area for gathering requisite information. Sensor nodes possess a negative characteristic of limited energy which pulls back the network from exploiting its peak capabilities. Hence, it is necessary to gather and transfer the information in an optimized way which reduces the energy dissipation. Ant Colony Optimization (ACO) is being widely used in optimi...

  12. A Schedule Optimization Model on Multirunway Based on Ant Colony Algorithm

    OpenAIRE

    Yu Jiang; Zhaolong Xu; Xinxing Xu; Zhihua Liao; Yuxiao Luo

    2014-01-01

    In order to make full use of the slot of runway, reduce flight delay, and ensure fairness among airlines, a schedule optimization model for arrival-departure flights is established in the paper. The total delay cost and fairness among airlines are two objective functions. The ant colony algorithm is adopted to solve this problem and the result is more efficient and reasonable when compared with FCFS (first come first served) strategy. Optimization results show that the flight delay and fair d...

  13. Adaptive Edge Detection Using Adjusted ANT Colony Optimization

    Science.gov (United States)

    Davoodianidaliki, M.; Abedini, A.; Shankayi, M.

    2013-09-01

    Edges contain important information in image and edge detection can be considered a low level process in image processing. Among different methods developed for this purpose traditional methods are simple and rather efficient. In Swarm Intelligent methods developed in last decade, ACO is more capable in this process. This paper uses traditional edge detection operators such as Sobel and Canny as input to ACO and turns overall process adaptive to application. Magnitude matrix or edge image can be used for initial pheromone and ant distribution. Image size reduction is proposed as an efficient smoothing method. A few parameters such as area and diameter of travelled path by ants are converted into rules in pheromone update process. All rules are normalized and final value is acquired by averaging.

  14. Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO) Router Chip.

    Science.gov (United States)

    Okdem, Selcuk; Karaboga, Dervis

    2009-01-01

    Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes. Illustrative examples, detailed descriptions and comparative performance test results of the proposed approach are included. The approach is also implemented to a small sized hardware component as a router chip. Simulation results show that proposed algorithm provides promising solutions allowing node designers to efficiently operate routing tasks. PMID:22399947

  15. Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO Router Chip

    Directory of Open Access Journals (Sweden)

    Dervis Karaboga

    2009-02-01

    Full Text Available Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes. Illustrative examples, detailed descriptions and comparative performance test results of the proposed approach are included. The approach is also implemented to a small sized hardware component as a router chip. Simulation results show that proposed algorithm provides promising solutions allowing node designers to efficiently operate routing tasks.

  16. Automated Software Testing Using Metahurestic Technique Based on An Ant Colony Optimization

    CERN Document Server

    Srivastava, Praveen Ranjan

    2011-01-01

    Software testing is an important and valuable part of the software development life cycle. Due to time, cost and other circumstances, exhaustive testing is not feasible that's why there is a need to automate the software testing process. Testing effectiveness can be achieved by the State Transition Testing (STT) which is commonly used in real time, embedded and web-based type of software systems. Aim of the current paper is to present an algorithm by applying an ant colony optimization technique, for generation of optimal and minimal test sequences for behavior specification of software. Present paper approach generates test sequence in order to obtain the complete software coverage. This paper also discusses the comparison between two metaheuristic techniques (Genetic Algorithm and Ant Colony optimization) for transition based testing

  17. An ant colony optimization based algorithm for identifying gene regulatory elements.

    Science.gov (United States)

    Liu, Wei; Chen, Hanwu; Chen, Ling

    2013-08-01

    It is one of the most important tasks in bioinformatics to identify the regulatory elements in gene sequences. Most of the existing algorithms for identifying regulatory elements are inclined to converge into a local optimum, and have high time complexity. Ant Colony Optimization (ACO) is a meta-heuristic method based on swarm intelligence and is derived from a model inspired by the collective foraging behavior of real ants. Taking advantage of the ACO in traits such as self-organization and robustness, this paper designs and implements an ACO based algorithm named ACRI (ant-colony-regulatory-identification) for identifying all possible binding sites of transcription factor from the upstream of co-expressed genes. To accelerate the ants' searching process, a strategy of local optimization is presented to adjust the ants' start positions on the searched sequences. By exploiting the powerful optimization ability of ACO, the algorithm ACRI can not only improve precision of the results, but also achieve a very high speed. Experimental results on real world datasets show that ACRI can outperform other traditional algorithms in the respects of speed and quality of solutions. PMID:23746735

  18. An Ant colony optimization algorithm to solve the broken link problem in wireless sensor network.-A Review

    OpenAIRE

    Minakshi,; Monika Bansal

    2015-01-01

    Aco is a well –known metahuristic in which a colony of artificial ants cooperates in explain Good solution to a combinational optimization problem. Wireless sensor consisting of nodes with limited power is deployed to gather useful information From the field. In wireless sensor network it is critical to collect the information in an energy efficient Manner.ant colony optimization, a swarm intelligence based optimization technique, is widely used In network routing. A novel rout...

  19. Co-evolutionary design of discrete structures based on the ant colony optimization

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    In order to optimize the sizing and topology of discrete structures together and resist the combinatorial explosion of the solution space, a co-evolutionary design (CED) method based on ant colony optimization (ACO) for discrete structures is proposed. The tailored ant colony optimization for the sizing of structures (TACO-SS) and the tailored ant colony optimization for the topology of structures (TACO-TS) are implemented respectively. Theoretical analysis shows that the computation complexity of each sub-process in CED based on ACO above is polynomial and it guarantees the efficiency of this method. After the parameter settings in TACO-SS and TACO-TS are discussed, the convergence history of a sub-process is studied through an instance in detail. Finally, according to the design examples of the 10-bar and 15-bar trusses under different cases, the effectiveness of the CED based on ACO is validated and the effects of the loads and the deflection constraints on the co-evolutionary design are discussed.

  20. Apply Local Clustering Method to Improve the Running Speed of Ant Colony Optimization

    OpenAIRE

    Pang, Chao-Yang; Hu, Wei; Li, Xia; Hu, Be-Qiong

    2009-01-01

    Ant Colony Optimization (ACO) has time complexity O(t*m*N*N), and its typical application is to solve Traveling Salesman Problem (TSP), where t, m, and N denotes the iteration number, number of ants, number of cities respectively. Cutting down running time is one of study focuses, and one way is to decrease parameter t and N, especially N. For this focus, the following method is presented in this paper. Firstly, design a novel clustering algorithm named Special Local Clustering algorithm (SLC...

  1. Gis-Based Route Finding Using ANT Colony Optimization and Urban Traffic Data from Different Sources

    Science.gov (United States)

    Davoodi, M.; Mesgari, M. S.

    2015-12-01

    Nowadays traffic data is obtained from multiple sources including GPS, Video Vehicle Detectors (VVD), Automatic Number Plate Recognition (ANPR), Floating Car Data (FCD), VANETs, etc. All such data can be used for route finding. This paper proposes a model for finding the optimum route based on the integration of traffic data from different sources. Ant Colony Optimization is applied in this paper because the concept of this method (movement of ants in a network) is similar to urban road network and movements of cars. The results indicate that this model is capable of incorporating data from different sources, which may even be inconsistent.

  2. Ant colony optimization approach for test scheduling of system on chip

    Institute of Scientific and Technical Information of China (English)

    CHEN Ling; PAN Zhong-liang

    2009-01-01

    It is necessary to perform the test of system on chip, the test scheduling determines the test start and finishing time of every core in the system on chip such that the overall test time is minimized. A new test scheduling approach based on chaotic ant colony algorithm is presented in this paper. The optimization model of test scheduling was studied, the model uses the information such as the scale of test sets of both cores and user defined logic. An approach based on chaotic ant colony algorithm was proposed to solve the optimization model of test scheduling. The test of signal integrity faults such as crosstalk were also investigated when performing the test scheduling. Experimental results on many circuits show that the proposed approach can be used to solve test scheduling problems.

  3. A nuclear reactor core fuel reload optimization using Artificial-Ant-Colony Connective Networks

    International Nuclear Information System (INIS)

    A Pressurized Water Reactor core must be reloaded every time the fuel burnup reaches a level when it is not possible to sustain nominal power operation. The nuclear core fuel reload optimization consists in finding a burned-up and fresh-fuel-assembly pattern that maximizes the number of full operational days. This problem is NP-hard, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Besides that, the problem is non-linear and its search space is highly discontinual and multimodal. In this work a parallel computational system based on Ant Colony System (ACS) called Artificial-Ant-Colony Networks is introduced to solve the nuclear reactor core fuel reload optimization problem. ACS is a system based on artificial agents that uses the reinforcement learning technique and was originally developed to solve the Traveling Salesman Problem, which is conceptually similar to the nuclear fuel reload problem. (author)

  4. Structural Damage Detection Based on Modal Parameters Using Continuous Ant Colony Optimization

    OpenAIRE

    Aditi Majumdar; Bharadwaj Nanda; Dipak Kumar Maiti; Damodar Maity

    2014-01-01

    A method is presented to detect and quantify structural damages from changes in modal parameters (such as natural frequencies and mode shapes). An inverse problem is formulated to minimize the objective function, defined in terms of discrepancy between the vibration data identified by modal testing and those computed from analytical model, which then solved to locate and assess the structural damage using continuous ant colony optimization algorithm. The damage is formulated as stiffness redu...

  5. Scalable Clustering of High-Dimensional Data Technique Using SPCM with Ant Colony Optimization Intelligence

    OpenAIRE

    Thenmozhi Srinivasan; Balasubramanie Palanisamy

    2015-01-01

    Clusters of high-dimensional data techniques are emerging, according to data noisy and poor quality challenges. This paper has been developed to cluster data using high-dimensional similarity based PCM (SPCM), with ant colony optimization intelligence which is effective in clustering nonspatial data without getting knowledge about cluster number from the user. The PCM becomes similarity based by using mountain method with it. Though this is efficient clustering, it is checked for optimizatio...

  6. Ant colony optimization applied to route planning using link travel time predictions

    OpenAIRE

    Claes, Rutger; Holvoet, Tom

    2011-01-01

    Finding the shortest path in a road network is a well known problem. Various proven static algorithms such as Dijkstra and A* are extensively evaluated and implemented. When confronted with dynamic costs, such as link travel time predictions, alternative route planning algorithms have to be applied. This paper applies Ant Colony Optimization combined with link travel time predictions to find routes that reduce the time spend by travels by taking into account link travel time predictions. The ...

  7. Applying Ant Colony Optimization Algorithms for High-Level Behavior Learning and Reproduction from Demonstrations

    OpenAIRE

    Fonooni, Benjamin; Jevtić, Aleksandar; Hellström, Thomas; Janlert, Lars-Erik

    2015-01-01

    International audience In domains where robots carry out human’s tasks, the ability to learn new behaviors easily and quickly plays an important role. Two major challenges with Learning from Demonstration (LfD) are to identify what information in a demonstrated behavior requires attention by the robot, and to generalize the learned behavior such that the robot is able to perform the same behavior in novel situations.The main goal of this paper is to incorporate Ant Colony Optimization (ACO...

  8. Coupling ant colony optimization and the extended great deluge algorithm for the discrete facility layout problem

    Science.gov (United States)

    Nourelfath, M.; Nahas, N.; Montreuil, B.

    2007-12-01

    This article uses a hybrid optimization approach to solve the discrete facility layout problem (FLP), modelled as a quadratic assignment problem (QAP). The idea of this approach design is inspired by the ant colony meta-heuristic optimization method, combined with the extended great deluge (EGD) local search technique. Comparative computational experiments are carried out on benchmarks taken from the QAP-library and from real life problems. The performance of the proposed algorithm is compared to construction and improvement heuristics such as H63, HC63-66, CRAFT and Bubble Search, as well as other existing meta-heuristics developed in the literature based on simulated annealing (SA), tabu search and genetic algorithms (GAs). This algorithm is compared also to other ant colony implementations for QAP. The experimental results show that the proposed ant colony optimization/extended great deluge (ACO/EGD) performs significantly better than the existing construction and improvement algorithms. The experimental results indicate also that the ACO/EGD heuristic methodology offers advantages over other algorithms based on meta-heuristics in terms of solution quality.

  9. Adaptive Search Protocol Based on Optimized Ant Colony Algorithm in Peer-to-Peer Network

    Directory of Open Access Journals (Sweden)

    Chun-Ying Liu

    2013-04-01

    Full Text Available In order to solve the low searching efficiency in the peer-to-peer (P2P network, introduce the ant colony algorithm with the particle swarm optimization in searching procedure. Present a new adaptive search protocol (SACASP based on the ant colony algorithm with the particle swarm optimization in the Peer-to-Peer Network. The approach simulates the process of the ants’ searching food, and can direct the query routing efficiently according to the adaptive strategy and the positive feedback principle of the pheromone. Decrease the blindness of the messages transmitting in early searching stage by adding the particle swarm optimization to the ant colony algorithm. Give the adaptive P2P search model based on the fusion algorithm, and design the data structure and steps of the model. The simulation experiment shows, PSACASP can effectively shorten the time and reduce the search query packets comparing with the other search algorithms, and it can achieve better search performance and decrease the network loads.

  10. A Stochastic Inversion Method for Potential Field Data: Ant Colony Optimization

    Science.gov (United States)

    Liu, Shuang; Hu, Xiangyun; Liu, Tianyou

    2014-07-01

    Simulating natural ants' foraging behavior, the ant colony optimization (ACO) algorithm performs excellently in combinational optimization problems, for example the traveling salesman problem and the quadratic assignment problem. However, the ACO is seldom used to inverted for gravitational and magnetic data. On the basis of the continuous and multi-dimensional objective function for potential field data optimization inversion, we present the node partition strategy ACO (NP-ACO) algorithm for inversion of model variables of fixed shape and recovery of physical property distributions of complicated shape models. We divide the continuous variables into discrete nodes and ants directionally tour the nodes by use of transition probabilities. We update the pheromone trails by use of Gaussian mapping between the objective function value and the quantity of pheromone. It can analyze the search results in real time and promote the rate of convergence and precision of inversion. Traditional mapping, including the ant-cycle system, weaken the differences between ant individuals and lead to premature convergence. We tested our method by use of synthetic data and real data from scenarios involving gravity and magnetic anomalies. The inverted model variables and recovered physical property distributions were in good agreement with the true values. The ACO algorithm for binary representation imaging and full imaging can recover sharper physical property distributions than traditional linear inversion methods. The ACO has good optimization capability and some excellent characteristics, for example robustness, parallel implementation, and portability, compared with other stochastic metaheuristics.

  11. Optimization of travel salesman problem using the ant colony system and Greedy search

    International Nuclear Information System (INIS)

    In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

  12. Ant colony optimization image registration algorithm based on wavelet transform and mutual information

    Science.gov (United States)

    Zhang, Hong; Sun, Yanfeng; Zhai, Bing; Wang, Yiding

    2013-07-01

    This paper studies on the image registration of the medical images. Wavelet transform is adopted to decompose the medical images because the resolution of the medical image is high and the computational amount of the registration is large. Firstly, the low frequency sub-images are matched. Then source images are matched. The image registration was fulfilled by the ant colony optimization algorithm to search the extremum of the mutual information. The experiment result demonstrates the proposed approach can not only reduce calculation amount, but also skip from the local extremum during optimization process, and search the optimization value.

  13. Event Space-Correlation Analysis Algorithm Based on Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Mingsheng Hu

    2013-03-01

    Full Text Available Historical disaster events are taken as a case for space-correlation analysis, three-dimensional disasters space-time network are modeled and chain relationship of disaster nodes are mined by looking for similar space vector in network. Then transformed the vector discover problem into a path optimization problem and solved by using ant colony algorithm, where the pheromone parameter in the process of optimal-path finding is concerned as the algorithm result, in order to solve the problem of path competition which existed when only to solve the optimal path. Experimental results of MATLAB show that this method has high accuracy and practicality.

  14. Ant colony system algorithm for the optimization of beer fermentation control

    Institute of Scientific and Technical Information of China (English)

    肖杰; 周泽魁; 张光新

    2004-01-01

    Beer fermentation is a dynamic process that must be guided along a temperature profile to obtain the desired results. Ant colony system algorithm was applied to optimize the kinetic model of this process. During a fixed period of fermentation time, a series of different temperature profiles of the mixture were constructed. An optimal one was chosen at last. Optimal temperature profile maximized the final ethanol production and minimized the byproducts concentration and spoilage risk. The satisfactory results obtained did not require much computation effort.

  15. Search tree-based approach for the p-median problem using the ant colony optimization algorithm

    OpenAIRE

    Gabriel Bodnariuc; Sergiu Cataranciuc

    2014-01-01

    In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the $p$-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.

  16. Displacement back analysis for underground engineering based on immunized continuous ant colony optimization

    Science.gov (United States)

    Gao, Wei

    2016-05-01

    The objective function of displacement back analysis for rock parameters in underground engineering is a very complicated nonlinear multiple hump function. The global optimization method can solve this problem very well. However, many numerical simulations must be performed during the optimization process, which is very time consuming. Therefore, it is important to improve the computational efficiency of optimization back analysis. To improve optimization back analysis, a new global optimization, immunized continuous ant colony optimization, is proposed. This is an improved continuous ant colony optimization using the basic principles of an artificial immune system and evolutionary algorithm. Based on this new global optimization, a new displacement optimization back analysis for rock parameters is proposed. The computational performance of the new back analysis is verified through a numerical example and a real engineering example. The results show that this new method can be used to obtain suitable parameters of rock mass with higher accuracy and less effort than previous methods. Moreover, the new back analysis is very robust.

  17. Novel method based on ant colony optimization for solving ill-conditioned linear systems of equations

    Institute of Scientific and Technical Information of China (English)

    2005-01-01

    A novel method based on ant colony optimization (ACO), algorithm for solving the ill-conditioned linear systems of equations is proposed. ACO is a parallelized bionic optimization algorithm which is inspired from the behavior of real ants. ACO algorithm is first introduced, a kind of positive feedback mechanism is adopted in ACO. Then, the solution problem of linear systems of equations was reformulated as an unconstrained optimization problem for solution by an ACO algorithm. Finally, the ACO with other traditional methods is applied to solve a kind of multi-dimensional Hilbert ill-conditioned linear equations. The numerical results demonstrate that ACO is effective, robust and recommendable in solving ill-conditioned linear systems of equations.

  18. ON THE SUITABILITY OF USING ANT COLONY OPTIMIZATION FOR ROUTING MULTIMEDIA CONTENT OVER WIRELESS SENSOR NETWORKS

    Directory of Open Access Journals (Sweden)

    Hiba Al-Zurba

    2011-07-01

    Full Text Available This paper studies the suitability of using a meta-heuristic ant colony technique in routing multimediacontent over wireless sensor networks. The presented technique is both energy and QoS-aware. Ant colonyalgorithm is used to find the optimal routing path. Optimality is in the sense of minimizing energyconsumption and increasing link quality and reliability. The proposed approach results in minimizingenergy consumption and prolonging the lifetime of the network. Moreover, the optimal path has a high linkquality and reliability which enhances video frame quality and ensures high probability of successfuldelivery of video frames. The importance given to energy consumption, link quality, and link reliabilitymetrics can be varied depending on the multimedia application requirements.

  19. A Multi-pipe Path Planning by Modified Ant Colony Optimization

    Institute of Scientific and Technical Information of China (English)

    QU Yan-feng; JIANG Dan; LIU Bin

    2011-01-01

    Path planning in 3D geometry space is used to find an optimal path in the restricted environment, according to a certain evaluation criteria. To solve the problem of long searching time and slow solving speed in 3D path planning, a modified ant colony optimization is proposed in this paper. Firstly, the grid method for environment modeling is adopted. Heuristic information is connected with the planning space. A semi-iterative global pheromone update mechanism is proposed. Secondly, the optimal ants mutate the paths to improve the diversity of the algorithm after a defined iterative number. Thirdly, co-evolutionary algorithm is used. Finally, the simulation result shows the effectiveness of the proposed algorithm in solving the problem of 3D pipe path planning.

  20. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    OpenAIRE

    Mr. P.Mathiyalagan; U.R. Dhepthie; S.N. Sivanandam

    2010-01-01

    Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedu...

  1. A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

    Energy Technology Data Exchange (ETDEWEB)

    Lima, Alan M.M. de [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: alanmmlima@yahoo.com.br; Schirru, Roberto [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: schirru@lmp.ufrj.br; Carvalho da Silva, Fernando [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: fernando@con.ufrj.br; Medeiros, Jose Antonio Carlos Canedo [Universidade Federal do Rio de Janeiro, PEN/COPPE - UFRJ, Ilha do Fundao s/n, CEP 21945-970 Rio de Janeiro (Brazil)], E-mail: canedo@lmp.ufrj.br

    2008-09-15

    The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem.

  2. A nuclear reactor core fuel reload optimization using artificial ant colony connective networks

    International Nuclear Information System (INIS)

    The core of a nuclear Pressurized Water Reactor (PWR) may be reloaded every time the fuel burn-up is such that it is not more possible to maintain the reactor operating at nominal power. The nuclear core fuel reload optimization problem consists in finding a pattern of burned-up and fresh-fuel assemblies that maximize the number of full operational days. This is an NP-Hard problem, meaning that complexity grows exponentially with the number of fuel assemblies in the core. Moreover, the problem is non-linear and its search space is highly discontinuous and multi-modal. Ant Colony System (ACS) is an optimization algorithm based on artificial ants that uses the reinforcement learning technique. The ACS was originally developed to solve the Traveling Salesman Problem (TSP), which is conceptually similar to the nuclear core fuel reload problem. In this work a parallel computational system based on the ACS, called Artificial Ant Colony Networks is introduced to solve the core fuel reload optimization problem

  3. Optimization of China Crude Oil Transportation Network with Genetic Ant Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Yao Wang

    2015-08-01

    Full Text Available Taking into consideration both shipping and pipeline transport, this paper first analysed the risk factors for different modes of crude oil import transportation. Then, based on the minimum of both transportation cost and overall risk, a multi-objective programming model was established to optimize the transportation network of crude oil import, and the genetic algorithm and ant colony algorithm were employed to solve the problem. The optimized result shows that VLCC (Very Large Crude Carrier is superior in long distance sea transportation, whereas pipeline transport is more secure than sea transport. Finally, this paper provides related safeguard suggestions on crude oil import transportation.

  4. Ant colony optimization for bearings-only maneuvering target tracking in sensors network

    Institute of Scientific and Technical Information of China (English)

    Benlian XU; Zhiquan WANG; Zhengyi WU

    2007-01-01

    In this paper, the problem of bearings-only maneuvering target tracking in sensors network is investigated.Two objectives are proposed and optimized by the ant colony optimization (ACO), then two kinds of node searching strategies of the ACO algorithm are presented. On the basis of the nodes determined by the ACO algorithm, the interacting multiple models extended Kalman filter (IMMEKF) for the multi-sensor bearings-only maneuvering target tracking is introduced. Simulation results indicate that the proposed ACO algorithm performs better than the Closest Nodes method.Furthermore, the Strategy 2 of the two given strategies is preferred in terms of the requirement of real time.

  5. An ant colony optimization algorithm for phylogenetic estimation under the minimum evolution principle

    Directory of Open Access Journals (Sweden)

    Milinkovitch Michel C

    2007-11-01

    Full Text Available Abstract Background Distance matrix methods constitute a major family of phylogenetic estimation methods, and the minimum evolution (ME principle (aiming at recovering the phylogeny with shortest length is one of the most commonly used optimality criteria for estimating phylogenetic trees. The major difficulty for its application is that the number of possible phylogenies grows exponentially with the number of taxa analyzed and the minimum evolution principle is known to belong to the NP MathType@MTEF@5@5@+=feaafiart1ev1aaatCvAUfKttLearuWrP9MDH5MBPbIqV92AaeXatLxBI9gBaebbnrfifHhDYfgasaacPC6xNi=xH8viVGI8Gi=hEeeu0xXdbba9frFj0xb9qqpG0dXdb9aspeI8k8fiI+fsY=rqGqVepae9pg0db9vqaiVgFr0xfr=xfr=xc9adbaqaaeGacaGaaiaabeqaaeqabiWaaaGcbaWenfgDOvwBHrxAJfwnHbqeg0uy0HwzTfgDPnwy1aaceaGae8xdX7Kaeeiuaafaaa@3888@-hard class of problems. Results In this paper, we introduce an Ant Colony Optimization (ACO algorithm to estimate phylogenies under the minimum evolution principle. ACO is an optimization technique inspired from the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems. Conclusion We show that the ACO algorithm is potentially competitive in comparison with state-of-the-art algorithms for the minimum evolution principle. This is the first application of an ACO algorithm to the phylogenetic estimation problem.

  6. GRID SCHEDULING USING ENHANCED ANT COLONY ALGORITHM

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2010-10-01

    Full Text Available Grid computing is a high performance computing used to solve larger scale computational demands. Task scheduling is a major issue in grid computing systems. Scheduling of tasks is the NP hard problem. The heuristic approach provides optimal solution for NP hard problems .The ant colony algorithm provides optimal solution. The existing ant colony algorithm takes more time to schedule the tasks. In this paper ant colony algorithm improved by enhancing pheromone updating rule such that it schedules the tasks efficiently and better resource utilization. The simulation results prove that proposed method reduces the execution time of tasks compared to existing ant colony algorithm.

  7. Biomedical Image Edge Detection using an Ant Colony Optimization Based on Artificial Neural Networks

    Directory of Open Access Journals (Sweden)

    Javad Rahebi

    2011-12-01

    Full Text Available Ant colony optimization (ACO is the algorithm that has inspired from natural behavior of ants life, which the ants leaved pheromone to search food on the ground. In this paper, ACO is introduced for resolving the edge detection in the biomedical image. Edge detection method based on ACO is able to create a matrix pheromone that shows information of available edge in each location of edge pixel which is created based on the movements of a number of ants on the biomedical image. Moreover, the movements of these ants are created by local fluctuation of biomedical image intensity values. The detected edge biomedical images have low quality rather than detected edge biomedical image resulted of a classic mask and won’t result application of these masks to edge detection biomedical image obtained of ACO. In proposed method, we use artificial neuralnetwork with supervised learning along with momentum to improve edge detection based on ACO. The experimental results shows that make use neural network are very effective in edge detection based on ACO.

  8. Improved multi-objective ant colony optimization algorithm and its application in complex reasoning

    Science.gov (United States)

    Wang, Xinqing; Zhao, Yang; Wang, Dong; Zhu, Huijie; Zhang, Qing

    2013-09-01

    The problem of fault reasoning has aroused great concern in scientific and engineering fields. However, fault investigation and reasoning of complex system is not a simple reasoning decision-making problem. It has become a typical multi-constraint and multi-objective reticulate optimization decision-making problem under many influencing factors and constraints. So far, little research has been carried out in this field. This paper transforms the fault reasoning problem of complex system into a paths-searching problem starting from known symptoms to fault causes. Three optimization objectives are considered simultaneously: maximum probability of average fault, maximum average importance, and minimum average complexity of test. Under the constraints of both known symptoms and the causal relationship among different components, a multi-objective optimization mathematical model is set up, taking minimizing cost of fault reasoning as the target function. Since the problem is non-deterministic polynomial-hard(NP-hard), a modified multi-objective ant colony algorithm is proposed, in which a reachability matrix is set up to constrain the feasible search nodes of the ants and a new pseudo-random-proportional rule and a pheromone adjustment mechinism are constructed to balance conflicts between the optimization objectives. At last, a Pareto optimal set is acquired. Evaluation functions based on validity and tendency of reasoning paths are defined to optimize noninferior set, through which the final fault causes can be identified according to decision-making demands, thus realize fault reasoning of the multi-constraint and multi-objective complex system. Reasoning results demonstrate that the improved multi-objective ant colony optimization(IMACO) can realize reasoning and locating fault positions precisely by solving the multi-objective fault diagnosis model, which provides a new method to solve the problem of multi-constraint and multi-objective fault diagnosis and

  9. Structural Damage Detection Based on Modal Parameters Using Continuous Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Aditi Majumdar

    2014-01-01

    Full Text Available A method is presented to detect and quantify structural damages from changes in modal parameters (such as natural frequencies and mode shapes. An inverse problem is formulated to minimize the objective function, defined in terms of discrepancy between the vibration data identified by modal testing and those computed from analytical model, which then solved to locate and assess the structural damage using continuous ant colony optimization algorithm. The damage is formulated as stiffness reduction factor. The study indicates potentiality of the developed code to solve a wide range of inverse identification problems.

  10. Ant Colony Optimization In Multi-Agent Systems With NetLogo

    Directory of Open Access Journals (Sweden)

    Mustafa Tüker

    2013-02-01

    Full Text Available Multi-agent systems (MAS offer an effective way to model and solve complex optimization problems. In this study, MAS and ant colonies have been used together to solve the Travelling Salesmen Problem (TSP. System simulation has been realized with NetLogo which is an agent-based programming environment. It has been explained in detail with code examples that how to use NetLogo for modeling and simulation of the problem. Algorithm has been tested for different numbers of nodes and obtained results have been discussed.

  11. ENHANCEMENT AND COMPARISON OF ANT COLONY OPTIMIZATION FOR SOFTWARE RELIABILITY MODELS

    Directory of Open Access Journals (Sweden)

    Latha Shanmugam

    2013-01-01

    Full Text Available In Common parlance, the traditional software reliability estimation methods often rely on assumptions like statistical distributions that are often dubious and unrealistic. The ability to predict the number of faults during development phase and a proper testing process helps in specifying timely release of software and efficient management of project resources. In the Present Study Enhancement and Comparison of Ant Colony Optimization Methods for Software Reliability Models are studied and the estimation accuracy was calculated. The Enhanced method shows significant advantages in finding the goodness of fit for software reliability model such as finite and infinite failure Poisson model and binomial models.

  12. Integration of GPS and DinSAR for Deformation Monitoring Based on Ant Colony Optimization

    Science.gov (United States)

    Shi, Guoqiang; He, Xiufeng; Xiao, Ruya

    2014-11-01

    To acquire three-dimensional earth surface deformation, a measurement method based on ant colony optimization (ACO) is proposed. It highly integrates high-accuracy GPS observations from sparse ground points with InSAR line-of-sight (LOS) direction information. Two constraints, GPS and DInSAR observations, are employed in constructing the energy function whose minimum value will be searched by the ACO operated in continuous space. Compared with conventional interpolation algorithms, the proposed method increases the three-dimensional deformation observation accuracy, especially showing the improvement in the up direction.

  13. Ant Colony Algorithm and Optimization of Test Conditions in Analytical Chemistry

    Institute of Scientific and Technical Information of China (English)

    丁亚平; 吴庆生; 苏庆德

    2003-01-01

    The research for the new algorithm is in the forward position and an issue of general interest in chemometrics all along.A novel chemometrics method,Chemical Ant Colony Algorithm,has first been developed.In this paper,the basic principle,theevaluation function,and the parameter choice were discussed.This method has been successfully applied to the fitting of nonlinear multivariate function and the optimization of test conditions in chrome-azure-S-Al spctrophotometric system.The sum of residual square of the results is 0.0009,which has reached a good convergence result.

  14. DANTE - The combination between an ant colony optimization algorithm and a depth search method

    OpenAIRE

    Cardoso, Pedro J. S.; Jesus, Mário Carlos Machado; Marquez, A.

    2008-01-01

    The ε-DANTE method is an hybrid meta-heuristic. In combines the evolutionary Ant Colony Optimization (ACO) algorithms with a limited Depth Search. This Depth Search is based in the pheromone trails used by the ACO, which allows it to be oriented to the more promising areas of the search space. Some results are presented for the multiple objective k-Degree Spanning Trees problem, proving the effectiveness of the method when compared with other already tested evolutionary methods. © 2008 IEEE.

  15. Ant Colony Optimization Algorithm For PAPR Reduction In Multicarrier Code Division Multiple Access System

    Directory of Open Access Journals (Sweden)

    Kanchan Singla

    2014-06-01

    Full Text Available MC CDMA is a rising candidate for future generation broadband wireless communication and gained great attention from researchers. It provides benefits of both OFDM and CDMA. Main challenging problem of MC CDMA is high PAPR. It occurs in HPA and reduces system efficiency. There are many PAPR reduction techniques for MC CDMA. In this paper we proposed Ant colony optimization algorithm to reduce PAPR with different number of user using BPSK and QPSK modulation. ACO is a metaheuristic technique and based on the foraging behavior of real ants. It provides solution to many complex problems. Simulation result proves that ACO using BPSK modulation is effective for reducing PAPR in MC CDMA.

  16. Scalable unit commitment by memory-bounded ant colony optimization with A{sup *} local search

    Energy Technology Data Exchange (ETDEWEB)

    Saber, Ahmed Yousuf; Alshareef, Abdulaziz Mohammed [Department of Electrical and Computer Engineering, King Abdulaziz University, P.O. Box 80204, Jeddah 21589 (Saudi Arabia)

    2008-07-15

    Ant colony optimization (ACO) is successfully applied in optimization problems. Performance of the basic ACO for small problems with moderate dimension and searching space is satisfactory. As the searching space grows exponentially in the large-scale unit commitment problem, the basic ACO is not applicable for the vast size of pheromone matrix of ACO in practical time and physical computer-memory limit. However, memory-bounded methods prune the least-promising nodes to fit the system in computer memory. Therefore, the authors propose memory-bounded ant colony optimization (MACO) in this paper for the scalable (no restriction for system size) unit commitment problem. This MACO intelligently solves the limitation of computer memory, and does not permit the system to grow beyond a bound on memory. In the memory-bounded ACO implementation, A{sup *} heuristic is introduced to increase local searching ability and probabilistic nearest neighbor method is applied to estimate pheromone intensity for the forgotten value. Finally, the benchmark data sets and existing methods are used to show the effectiveness of the proposed method. (author)

  17. Abnormality detection in retinal images using ant colony optimization and artificial neural networks - biomed 2010.

    Science.gov (United States)

    Kavitha, Ganesan; Ramakrishnan, Swaminathan

    2010-01-01

    Optic disc and retinal vasculature are important anatomical structures in the retina of the eye and any changes observed in these structures provide vital information on severity of various diseases. Digital retinal images are shown to provide a meaningful way of documenting and assessing some of the key elements inside the eye including the optic nerve and the tiny retinal blood vessels. In this work, an attempt has been made to detect and differentiate abnormalities of the retina using Digital image processing together with Optimization based segmentation and Artificial Neural Network methods. The retinal fundus images were recorded using standard protocols. Ant Colony Optimization is employed to extract the most significant objects namely the optic disc and blood vessel. The features related to these objects are obtained and corresponding indices are also derived. Further, these features are subjected to classification using Radial Basis Function Neural Networks and compared with conventional training algorithms. Results show that the Ant Colony Optimization is efficient in extracting useful information from retinal images. The features derived are effective for classification of normal and abnormal images using Radial basis function networks compared to other methods. As Optic disc and blood vessels are significant markers of abnormality in retinal images, the method proposed appears to be useful for mass screening. In this paper, the objectives of the study, methodology and significant observations are presented. PMID:20467104

  18. Solving optimum operation of single pump unit problem with ant colony optimization (ACO) algorithm

    International Nuclear Information System (INIS)

    For pumping stations, the effective scheduling of daily pump operations from solutions to the optimum design operation problem is one of the greatest potential areas for energy cost-savings, there are some difficulties in solving this problem with traditional optimization methods due to the multimodality of the solution region. In this case, an ACO model for optimum operation of pumping unit is proposed and the solution method by ants searching is presented by rationally setting the object function and constrained conditions. A weighted directed graph was constructed and feasible solutions may be found by iteratively searching of artificial ants, and then the optimal solution can be obtained by applying the rule of state transition and the pheromone updating. An example calculation was conducted and the minimum cost was found as 4.9979. The result of ant colony algorithm was compared with the result from dynamic programming or evolutionary solving method in commercial software under the same discrete condition. The result of ACO is better and the computing time is shorter which indicates that ACO algorithm can provide a high application value to the field of optimal operation of pumping stations and related fields.

  19. An Ant colony optimization algorithm to solve the broken link problem in wireless sensor network.-A Review

    Directory of Open Access Journals (Sweden)

    Minakshi

    2015-06-01

    Full Text Available Aco is a well –known metahuristic in which a colony of artificial ants cooperates in explain Good solution to a combinational optimization problem. Wireless sensor consisting of nodes with limited power is deployed to gather useful information From the field. In wireless sensor network it is critical to collect the information in an energy efficient Manner.ant colony optimization, a swarm intelligence based optimization technique, is widely used In network routing. A novel routing approach using an ant colony optimization algorithm is proposed for wireless sensor Network consisting of stable nodes illustrative example details description and cooperative performance test result the proposed approach are included. The approach is also implementing to a small sized hardware component as a router chip simulation result show that proposed algorithm Provides promising solution allowing node designers to efficiency operate routing tasks.

  20. Ant-Based Phylogenetic Reconstruction (ABPR: A new distance algorithm for phylogenetic estimation based on ant colony optimization

    Directory of Open Access Journals (Sweden)

    Karla Vittori

    2008-12-01

    Full Text Available We propose a new distance algorithm for phylogenetic estimation based on Ant Colony Optimization (ACO, named Ant-Based Phylogenetic Reconstruction (ABPR. ABPR joins two taxa iteratively based on evolutionary distance among sequences, while also accounting for the quality of the phylogenetic tree built according to the total length of the tree. Similar to optimization algorithms for phylogenetic estimation, the algorithm allows exploration of a larger set of nearly optimal solutions. We applied the algorithm to four empirical data sets of mitochondrial DNA ranging from 12 to 186 sequences, and from 898 to 16,608 base pairs, and covering taxonomic levels from populations to orders. We show that ABPR performs better than the commonly used Neighbor-Joining algorithm, except when sequences are too closely related (e.g., population-level sequences. The phylogenetic relationships recovered at and above species level by ABPR agree with conventional views. However, like other algorithms of phylogenetic estimation, the proposed algorithm failed to recover expected relationships when distances are too similar or when rates of evolution are very variable, leading to the problem of long-branch attraction. ABPR, as well as other ACO-based algorithms, is emerging as a fast and accurate alternative method of phylogenetic estimation for large data sets.

  1. 双种群改进蚁群算法%Dual population ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    郏宣耀; 滕少华

    2006-01-01

    基本蚁群优化(Basic Ant Colony Optimization,BACO)算法在进化中容易出现停滞,其根源是蚁群算法中信息的正反馈. 在大量蚂蚁选择相同路径后,该路径上的信息素浓度远高于其他路径,算法很难再搜索到邻域空间中的其他优良解. 对此,提出一种双种群改进蚁群(Dual Population Ant Colony Optimization,DPACO)算法. 借鉴遗传算法中个体多样性特点,将蚁群算法中的蚂蚁分成两个群体分别独立进行进化,并定期进行信息交换. 这一方法缓解了因信息素浓度失衡而造成的局部收敛,有效改进算法的搜索性能,实验结果表明该算法有效可行.

  2. Adaptive tracking and compensation of laser spot based on ant colony optimization

    Science.gov (United States)

    Yang, Lihong; Ke, Xizheng; Bai, Runbing; Hu, Qidi

    2009-05-01

    Because the effect of atmospheric scattering and atmospheric turbulence on laser signal of atmospheric absorption,laser spot twinkling, beam drift and spot split-up occur ,when laser signal transmits in the atmospheric channel. The phenomenon will be seriously affects the stability and the reliability of laser spot receiving system. In order to reduce the influence of atmospheric turbulence, we adopt optimum control thoughts in the field of artificial intelligence, propose a novel adaptive optical control technology-- model-free optimized adaptive control technology, analyze low-order pattern wave-front error theory, in which an -adaptive optical system is employed to adjust errors, and design its adaptive structure system. Ant colony algorithm is the control core algorithm, which is characteristic of positive feedback, distributed computing and greedy heuristic search. . The ant colony algorithm optimization of adaptive optical phase compensation is simulated. Simulation result shows that, the algorithm can effectively control laser energy distribution, improve laser light beam quality, and enhance signal-to-noise ratio of received signal.

  3. Optimization of fuel reloads for a BWR using the ant colony system

    International Nuclear Information System (INIS)

    In this work some results obtained during the development of optimization systems are presented, which are employees for the fuel reload design in a BWR. The systems use the ant colony optimization technique. As first instance, a system is developed that was adapted at travel salesman problem applied for the 32 state capitals of Mexican Republic. The purpose of this implementation is that a similarity exists with the design of fuel reload, since the two problems are of combinatorial optimization with decision variables that have similarity between both. The system was coupled to simulator SIMULATE-3, obtaining good results when being applied to an operation cycle in equilibrium for reactors of nuclear power plant of Laguna Verde. (Author)

  4. Estimating the net electricity energy generation and demand using the ant colony optimization approach. Case of Turkey

    International Nuclear Information System (INIS)

    This paper presents Turkey's net electricity energy generation and demand based on economic indicators. Forecasting model for electricity energy generation and demand is first proposed by the ant colony optimization (ACO) approach. It is multi-agent system in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. Ant colony optimization electricity energy estimation (ACOEEE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear electricity energy generation and demand (linearACOEEGE and linear ACOEEDE) and quadratic energy generation and demand (quadraticACOEEGE and quadratic ACOEEDE). Quadratic models for both generation and demand provided better fit solution due to the fluctuations of the economic indicators. The ACOEEGE and ACOEEDE models indicate Turkey's net electricity energy generation and demand until 2025 according to three scenarios. (author)

  5. Estimating the net electricity energy generation and demand using the ant colony optimization approach. Case of Turkey

    Energy Technology Data Exchange (ETDEWEB)

    Toksari, M. Duran [Engineering Faculty, Industrial Engineering Department, Erciyes University, 38039 Kayseri (Turkey)

    2009-03-15

    This paper presents Turkey's net electricity energy generation and demand based on economic indicators. Forecasting model for electricity energy generation and demand is first proposed by the ant colony optimization (ACO) approach. It is multi-agent system in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. Ant colony optimization electricity energy estimation (ACOEEE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear electricity energy generation and demand (linear{sub A}COEEGE and linear ACOEEDE) and quadratic energy generation and demand (quadratic{sub A}COEEGE and quadratic ACOEEDE). Quadratic models for both generation and demand provided better fit solution due to the fluctuations of the economic indicators. The ACOEEGE and ACOEEDE models indicate Turkey's net electricity energy generation and demand until 2025 according to three scenarios. (author)

  6. Estimating the net electricity energy generation and demand using the ant colony optimization approach: Case of Turkey

    Energy Technology Data Exchange (ETDEWEB)

    Toksari, M. Duran [Engineering Faculty, Industrial Engineering Department, Erciyes University, 38039 Kayseri (Turkey)], E-mail: dtoksari@erciyes.edu.tr

    2009-03-15

    This paper presents Turkey's net electricity energy generation and demand based on economic indicators. Forecasting model for electricity energy generation and demand is first proposed by the ant colony optimization (ACO) approach. It is multi-agent system in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. Ant colony optimization electricity energy estimation (ACOEEE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear electricity energy generation and demand (linear{sub A}COEEGE and linear ACOEEDE) and quadratic energy generation and demand (quadratic{sub A}COEEGE and quadratic ACOEEDE). Quadratic models for both generation and demand provided better fit solution due to the fluctuations of the economic indicators. The ACOEEGE and ACOEEDE models indicate Turkey's net electricity energy generation and demand until 2025 according to three scenarios.

  7. Estimating the net electricity energy generation and demand using the ant colony optimization approach: Case of Turkey

    International Nuclear Information System (INIS)

    This paper presents Turkey's net electricity energy generation and demand based on economic indicators. Forecasting model for electricity energy generation and demand is first proposed by the ant colony optimization (ACO) approach. It is multi-agent system in which the behavior of each ant is inspired by the foraging behavior of real ants to solve optimization problem. Ant colony optimization electricity energy estimation (ACOEEE) model is developed using population, gross domestic product (GDP), import and export. All equations proposed here are linear electricity energy generation and demand (linearACOEEGE and linear ACOEEDE) and quadratic energy generation and demand (quadraticACOEEGE and quadratic ACOEEDE). Quadratic models for both generation and demand provided better fit solution due to the fluctuations of the economic indicators. The ACOEEGE and ACOEEDE models indicate Turkey's net electricity energy generation and demand until 2025 according to three scenarios

  8. Energy Aware Reliable Routing Protocol (EARRP) for Mobile AdHoc Networks Using Bee Foraging Behavior and Ant Colony Optimization

    OpenAIRE

    K. G. Santhiya; Arumugam, N.

    2012-01-01

    Energy aware reliable routing in mobile ad hoc networks is an astonishing task and in this paper we propose to design, develop such protocol which will be a good solution. For developing such protocol EARRP, two swarm intelligence techniques are involved namely ant colony optimization and bee colony foraging behavior. For optimization, we proposed adaptive solutions in order to estimate MAC overhead, link eminence and residual energy. After estimating the above said metrics, the fitness funct...

  9. Ant colony optimization and neural networks applied to nuclear power plant monitoring

    Energy Technology Data Exchange (ETDEWEB)

    Santos, Gean Ribeiro dos; Andrade, Delvonei Alves de; Pereira, Iraci Martinez, E-mail: gean@usp.br, E-mail: delvonei@ipen.br, E-mail: martinez@ipen.br [Instituto de Pesquisas Energeticas e Nucleares (IPEN/CNEN-SP), Sao Paulo, SP (Brazil)

    2015-07-01

    A recurring challenge in production processes is the development of monitoring and diagnosis systems. Those systems help on detecting unexpected changes and interruptions, preventing losses and mitigating risks. Artificial Neural Networks (ANNs) have been extensively used in creating monitoring systems. Usually the ANNs created to solve this kind of problem are created by taking into account only parameters as the number of inputs, outputs, and hidden layers. The result networks are generally fully connected and have no improvements in its topology. This work intends to use an Ant Colony Optimization (ACO) algorithm to create a tuned neural network. The ACO search algorithm will use Back Error Propagation (BP) to optimize the network topology by suggesting the best neuron connections. The result ANN will be applied to monitoring the IEA-R1 research reactor at IPEN. (author)

  10. An ant colony optimization heuristic for an integrated production and distribution scheduling problem

    Science.gov (United States)

    Chang, Yung-Chia; Li, Vincent C.; Chiang, Chia-Ju

    2014-04-01

    Make-to-order or direct-order business models that require close interaction between production and distribution activities have been adopted by many enterprises in order to be competitive in demanding markets. This article considers an integrated production and distribution scheduling problem in which jobs are first processed by one of the unrelated parallel machines and then distributed to corresponding customers by capacitated vehicles without intermediate inventory. The objective is to find a joint production and distribution schedule so that the weighted sum of total weighted job delivery time and the total distribution cost is minimized. This article presents a mathematical model for describing the problem and designs an algorithm using ant colony optimization. Computational experiments illustrate that the algorithm developed is capable of generating near-optimal solutions. The computational results also demonstrate the value of integrating production and distribution in the model for the studied problem.

  11. Ant colony optimization and neural networks applied to nuclear power plant monitoring

    International Nuclear Information System (INIS)

    A recurring challenge in production processes is the development of monitoring and diagnosis systems. Those systems help on detecting unexpected changes and interruptions, preventing losses and mitigating risks. Artificial Neural Networks (ANNs) have been extensively used in creating monitoring systems. Usually the ANNs created to solve this kind of problem are created by taking into account only parameters as the number of inputs, outputs, and hidden layers. The result networks are generally fully connected and have no improvements in its topology. This work intends to use an Ant Colony Optimization (ACO) algorithm to create a tuned neural network. The ACO search algorithm will use Back Error Propagation (BP) to optimize the network topology by suggesting the best neuron connections. The result ANN will be applied to monitoring the IEA-R1 research reactor at IPEN. (author)

  12. Construction of Learning Path Using Ant Colony Optimization from a Frequent Pattern Graph

    CERN Document Server

    Sengupta, Souvik; Dasgupta, Ranjan

    2012-01-01

    In an e-Learning system a learner may come across multiple unknown terms, which are generally hyperlinked, while reading a text definition or theory on any topic. It becomes even harder when one tries to understand those unknown terms through further such links and they again find some new terms that have new links. As a consequence they get confused where to initiate from and what are the prerequisites. So it is very obvious for the learner to make a choice of what should be learnt before what. In this paper we have taken the data mining based frequent pattern graph model to define the association and sequencing between the words and then adopted the Ant Colony Optimization, an artificial intelligence approach, to derive a searching technique to obtain an efficient and optimized learning path to reach to a unknown term.

  13. Parallel Methods of Solving of Supply Problem Using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Stanislav Piecka

    2013-03-01

    Full Text Available Presented work focuses on solving of the vehicle routingproblem, which is considered as a basic supply problem.The main motivation is to achieve high quality solutions ofthe vehicle routing problem in the shortest possible time.It tries to achieve this goal via parallelization of the antcolony optimization metaheuristics, which is suitable forcalculating of combinatorial problems. The vehicle rout-ing problem is an NP-complete problem, therefore usageof heuristics is the only way to solve it on large instances.The author proposes and compares dierent settings andsolving methods of the vehicle routing problem using theant colony optimization in sequence and parallel execu-tion. He determines appropriate application of the lo-cal search methods, which improves solution quality andapplies the elite approach. On selected communicationtopology, he proposes and compares several synchroniza-tion and communication strategies, all from achieved qual-ity and speedup point of view, on dierent number ofmulti-core processors.The author presents his own optimization tool, which isbased on execution of the ant colony optimization in a pa-rallel environment. The author applies proposed parallelmethod to the very large scale vehicle routing probleminstances with as many as 1200 customers.

  14. An approach using quantum ant colony optimization applied to the problem of identification of nuclear power plant transients

    International Nuclear Information System (INIS)

    Using concepts and principles of the quantum computation, as the quantum bit and superposition of states, coupled with the biological metaphor of a colony of ants, used in the Ant Colony Optimization algorithm (ACO), Wang et al developed the Quantum Ant Colony Optimization (QACO). In this paper we present a modification of the algorithm proposed by Wang et al. While the original QACO was used just for simple benchmarks functions with, at the most, two dimensions, QACOAlfa was developed for application where the original QACO, due to its tendency to converge prematurely, does not obtain good results, as in complex multidimensional functions. Furthermore, to evaluate its behavior, both algorithms are applied to the real problem of identification of accidents in PWR nuclear power plants. (author)

  15. An approach using quantum ant colony optimization applied to the problem of identification of nuclear power plant transients

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Marcio H.; Schirru, Roberto; Medeiros, Jose A.C.C., E-mail: marciohenrique@lmp.ufrj.b, E-mail: schirru@lmp.ufrj.b, E-mail: canedo@lmp.ufrj.b [Coordenacao dos Programas de Pos-Graduacao de Engenharia (COPPE/UFRJ), RJ (Brazil). Programa de Engenharia Nuclear. Lab. de Monitoramento de Processos

    2009-07-01

    Using concepts and principles of the quantum computation, as the quantum bit and superposition of states, coupled with the biological metaphor of a colony of ants, used in the Ant Colony Optimization algorithm (ACO), Wang et al developed the Quantum Ant Colony Optimization (QACO). In this paper we present a modification of the algorithm proposed by Wang et al. While the original QACO was used just for simple benchmarks functions with, at the most, two dimensions, QACO{sub A}lfa was developed for application where the original QACO, due to its tendency to converge prematurely, does not obtain good results, as in complex multidimensional functions. Furthermore, to evaluate its behavior, both algorithms are applied to the real problem of identification of accidents in PWR nuclear power plants. (author)

  16. Multipath Data Transmission with minimization of Congestion Using Ant Colony Optimization for MTSP and Total Queue Length

    OpenAIRE

    Dhriti Sundar Maity; Subhrananda Goswami

    2015-01-01

    This paper represents The Ant Colony Optimization for MTSP and Swarm Inspired Multipath Data Transmission with Congestion Control in MANET using Total Queue Length based on the behavioral nature in the biological ants. We consider the problem of congestion control for multicast traffic in wireless networks. MANET is multi hop wireless network in which the network components such as PC, mobile phones are mobile in nature. The components can communicate with each other without going through its...

  17. Implementasi Algoritma Ant Colony System Dalam Menentukan Optimisasi Network Routing .

    OpenAIRE

    Lubis, Dini Anggraini

    2011-01-01

    Ant Colony System is an algorithm that adapt from ants biologic behavior which the ant colony can hold to find shortest path. Ant Colony System can implement for several optimization problems and one of them is in network routing. Ant colony system that talked in this paper is about optimization cases in network routing called AntNet. The purpose of AntNet is to search shortest path between source node to destination node based the table routing read by AntNet. In this research, it implemente...

  18. Optic disc detection in color fundus images using ant colony optimization.

    Science.gov (United States)

    Pereira, Carla; Gonçalves, Luís; Ferreira, Manuel

    2013-03-01

    Diabetic retinopathy has been revealed as the most common cause of blindness among people of working age in developed countries. However, loss of vision could be prevented by an early detection of the disease and, therefore, by a regular screening program to detect retinopathy. Due to its characteristics, the digital color fundus photographs have been the easiest way to analyze the eye fundus. An important prerequisite for automation is the segmentation of the main anatomical features in the image, particularly the optic disc. Currently, there are many works reported in the literature with the purpose of detecting and segmenting this anatomical structure. Though, none of them performs as needed, especially when dealing with images presenting pathologies and a great variability. Ant colony optimization (ACO) is an optimization algorithm inspired by the foraging behavior of some ant species that has been applied in image processing with different purposes. In this paper, this algorithm preceded by anisotropic diffusion is used for optic disc detection in color fundus images. Experimental results demonstrate the good performance of the proposed approach as the optic disc was detected in most of all the images used, even in the images with great variability. PMID:23160896

  19. An Energy Consumption Optimized Clustering Algorithm for Radar Sensor Networks Based on an Ant Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Jiang Ting

    2010-01-01

    Full Text Available We optimize the cluster structure to solve problems such as the uneven energy consumption of the radar sensor nodes and random cluster head selection in the traditional clustering routing algorithm. According to the defined cost function for clusters, we present the clustering algorithm which is based on radio-free space path loss. In addition, we propose the energy and distance pheromones based on the residual energy and aggregation of the radar sensor nodes. According to bionic heuristic algorithm, a new ant colony-based clustering algorithm for radar sensor networks is also proposed. Simulation results show that this algorithm can get a better balance of the energy consumption and then remarkably prolong the lifetime of the radar sensor network.

  20. An approach using quantum ant colony optimization applied to the problem of nuclear reactors reload

    Energy Technology Data Exchange (ETDEWEB)

    Silva, Marcio H.; Lima, Alan M.M. de; Schirru, Roberto; Medeiros, J.A.C.C., E-mail: marciohenrique@lmp.ufrj.b, E-mail: schirru@lmp.ufrj.b, E-mail: canedo@lmp.ufrj.b [Coordenacao dos Programas de Pos-Graduacao de Engenharia (COPPE/UFRJ), RJ (Brazil). Programa de Engenharia Nuclear. Lab. de Monitoramento de Processos

    2009-07-01

    The basic concept behind the nuclear reactor fuel reloading problem is to find a configuration of new and used fuel elements, to keep the plant working at full power by the largest possible duration, within the safety restrictions. The main restriction is the power peaking factor, which is the limit value for the preservation of the fuel assembly. The QACO{sub A}lfa algorithm is a modified version of Quantum Ant Colony Optimization (QACO) proposed by Wang et al, which uses a new actualization method and a pseudo evaporation step. We examined the QACO{sub A}lfa behavior associated to physics of reactors code RECNOD when applied to this problem. Although the QACO have been developed for continuous functions, the binary model used in this work allows applying it to discrete problems, such as the mentioned above. (author)

  1. A convenient and robust edge detection method based on ant colony optimization

    Science.gov (United States)

    Liu, Xiaochen; Fang, Suping

    2015-10-01

    Edge detection is usually used as a preprocessing operation in many machine vision industrial applications. Recently, ant colony optimization (ACO) as a relatively new meta-heuristic approach has been used to tackle the edge detection problem. In this work, a convenient and robust method for edge detection based on ACO is proposed, which employs a new heuristic function, adopts a user-defined threshold in pheromone update process and provides a group of suitable parameter values. Experimental results clearly demonstrated the effectiveness of the proposed method, and at the same time, in the presence of noise, the proposed approach outperforms other two ACO-based edge detection techniques and four conventional edge detectors.

  2. An approach using quantum ant colony optimization applied to the problem of nuclear reactors reload

    International Nuclear Information System (INIS)

    The basic concept behind the nuclear reactor fuel reloading problem is to find a configuration of new and used fuel elements, to keep the plant working at full power by the largest possible duration, within the safety restrictions. The main restriction is the power peaking factor, which is the limit value for the preservation of the fuel assembly. The QACOAlfa algorithm is a modified version of Quantum Ant Colony Optimization (QACO) proposed by Wang et al, which uses a new actualization method and a pseudo evaporation step. We examined the QACOAlfa behavior associated to physics of reactors code RECNOD when applied to this problem. Although the QACO have been developed for continuous functions, the binary model used in this work allows applying it to discrete problems, such as the mentioned above. (author)

  3. Ant colony optimization algorithm and its application to Neuro-Fuzzy controller design

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    An adaptive ant colony algorithm is proposed based on dynamically adjusting the strategy of updating trail information.The algorithm can keep good balance between accelerating convergence and averting precocity and stagnation.The results of function optimization show that the algorithm has good searching ability and high convergence speed.The algorithm is employed to design a neuro-fuzzy controller for real-time control of an inverted pendulum.In order to avoid the combinatorial explosion of fuzzy.rules due to multivariable inputs,a state variable synthesis scheme is emploved to reduce the number of fuzzy rules greatly.The simulation results show that the designed controller can control the inverted pendulum successfully.

  4. The Lobe Fissure Tracking by the Modified Ant Colony Optimization Framework in CT Images

    Directory of Open Access Journals (Sweden)

    Chii-Jen Chen

    2014-11-01

    Full Text Available Chest computed tomography (CT is the most commonly used technique for the inspection of lung lesions. However, the lobe fissures in lung CT is still difficult to observe owing to its imaging structure. Therefore, in this paper, we aimed to develop an efficient tracking framework to extract the lobe fissures by the proposed modified ant colony optimization (ACO algorithm. We used the method of increasing the consistency of pheromone on lobe fissure to improve the accuracy of path tracking. In order to validate the proposed system, we had tested our method in a database from 15 lung patients. In the experiment, the quantitative assessment shows that the proposed ACO method achieved the average F-measures of 80.9% and 82.84% in left and right lungs, respectively. The experiments indicate our method results more satisfied performance, and can help investigators detect lung lesion for further examination.

  5. Multiobjective optimal placement of switches and protective devices in electric power distribution systems using ant colony optimization

    Energy Technology Data Exchange (ETDEWEB)

    Tippachon, Wiwat; Rerkpreedapong, Dulpichet [Department of Electrical Engineering, Kasetsart University, 50 Phaholyothin Rd., Ladyao, Jatujak, Bangkok 10900 (Thailand)

    2009-07-15

    This paper presents a multiobjective optimization methodology to optimally place switches and protective devices in electric power distribution networks. Identifying the type and location of them is a combinatorial optimization problem described by a nonlinear and nondifferential function. The multiobjective ant colony optimization (MACO) has been applied to this problem to minimize the total cost while simultaneously minimize two distribution network reliability indices including system average interruption frequency index (SAIFI) and system interruption duration index (SAIDI). Actual distribution feeders are used in the tests, and test results have shown that the algorithm can determine the set of optimal nondominated solutions. It allows the utility to obtain the optimal type and location of devices to achieve the best system reliability with the lowest cost. (author)

  6. Apply Local Clustering Method to Improve the Running Speed of Ant Colony Optimization

    CERN Document Server

    Pang, Chao-Yang; Li, Xia; Hu, Be-Qiong

    2009-01-01

    Ant Colony Optimization (ACO) has time complexity O(t*m*N*N), and its typical application is to solve Traveling Salesman Problem (TSP), where t, m, and N denotes the iteration number, number of ants, number of cities respectively. Cutting down running time is one of study focuses, and one way is to decrease parameter t and N, especially N. For this focus, the following method is presented in this paper. Firstly, design a novel clustering algorithm named Special Local Clustering algorithm (SLC), then apply it to classify all cities into compact classes, where compact class is the class that all cities in this class cluster tightly in a small region. Secondly, let ACO act on every class to get a local TSP route. Thirdly, all local TSP routes are jointed to form solution. Fourthly, the inaccuracy of solution caused by clustering is eliminated. Simulation shows that the presented method improves the running speed of ACO by 200 factors at least. And this high speed is benefit from two factors. One is that class ha...

  7. Performance Evaluation of Different Network Topologies Based On Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Joydip Dhar

    2010-11-01

    Full Text Available All networks tend to become more and more complicated. They can be wired, with lots of routers, orwireless, with lots of mobile node. The problem remains the same, in order to get the best from thenetwork; there is a need to find the shortest path. The more complicated the network is, the more difficultit is to manage the routes and indicate which one is the best. The Nature gives us a solution to find theshortest path. The ants, in their necessity to find food and brings it back to the nest, manage not only toexplore a vast area, but also to indicate to their peers the location of the food while bringing it back tothe nest. Most of the time, they will find the shortest path and adapt to ground changes, hence provingtheir great efficiency toward this difficult task. The purpose of this paper is to evaluate the performanceof different network topologies based on Ant Colony Optimization Algorithm. Simulation is done in NS-2.

  8. Automatic boiling water reactor loading pattern design using ant colony optimization algorithm

    International Nuclear Information System (INIS)

    An automatic boiling water reactor (BWR) loading pattern (LP) design methodology was developed using the rank-based ant system (RAS), which is a variant of the ant colony optimization (ACO) algorithm. To reduce design complexity, only the fuel assemblies (FAs) of one eight-core positions were determined using the RAS algorithm, and then the corresponding FAs were loaded into the other parts of the core. Heuristic information was adopted to exclude the selection of the inappropriate FAs which will reduce search space, and thus, the computation time. When the LP was determined, Haling cycle length, beginning of cycle (BOC) shutdown margin (SDM), and Haling end of cycle (EOC) maximum fraction of limit for critical power ratio (MFLCPR) were calculated using SIMULATE-3 code, which were used to evaluate the LP for updating pheromone of RAS. The developed design methodology was demonstrated using FAs of a reference cycle of the BWR6 nuclear power plant. The results show that, the designed LP can be obtained within reasonable computation time, and has a longer cycle length than that of the original design.

  9. Automatic boiling water reactor loading pattern design using ant colony optimization algorithm

    Energy Technology Data Exchange (ETDEWEB)

    Wang, C.-D. [Department of Engineering and System Science, National Tsing Hua University, 101, Section 2 Kuang Fu Road, Hsinchu 30013, Taiwan (China); Nuclear Engineering Division, Institute of Nuclear Energy Research, No. 1000, Wenhua Rd., Jiaan Village, Longtan Township, Taoyuan County 32546, Taiwan (China)], E-mail: jdwang@iner.gov.tw; Lin Chaung [Department of Engineering and System Science, National Tsing Hua University, 101, Section 2 Kuang Fu Road, Hsinchu 30013, Taiwan (China)

    2009-08-15

    An automatic boiling water reactor (BWR) loading pattern (LP) design methodology was developed using the rank-based ant system (RAS), which is a variant of the ant colony optimization (ACO) algorithm. To reduce design complexity, only the fuel assemblies (FAs) of one eight-core positions were determined using the RAS algorithm, and then the corresponding FAs were loaded into the other parts of the core. Heuristic information was adopted to exclude the selection of the inappropriate FAs which will reduce search space, and thus, the computation time. When the LP was determined, Haling cycle length, beginning of cycle (BOC) shutdown margin (SDM), and Haling end of cycle (EOC) maximum fraction of limit for critical power ratio (MFLCPR) were calculated using SIMULATE-3 code, which were used to evaluate the LP for updating pheromone of RAS. The developed design methodology was demonstrated using FAs of a reference cycle of the BWR6 nuclear power plant. The results show that, the designed LP can be obtained within reasonable computation time, and has a longer cycle length than that of the original design.

  10. Runtime analysis of ant colony optimization on dynamic shortest path problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei; Witt, Carsten

    2015-01-01

    A simple ACO algorithm called lambda-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses. Building upon previous results for the special case of 1-MMAS, it is studied to what extent an enlarged colony using lambda ants per vertex helps...... in tracking an oscillating optimum. It is shown that easy cases of oscillations can be tracked by a constant number of ants. However, the paper also identifies more involved oscillations that with overwhelming probability cannot be tracked with any polynomial-size colony. Finally, parameters of...

  11. Runtime analysis of ant colony optimization on dynamic shortest path problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei; Witt, Carsten

    2013-01-01

    A simple ACO algorithm called λ-MMAS for dynamic variants of the single-destination shortest paths problem is studied by rigorous runtime analyses. Building upon previous results for the special case of 1-MMAS, it is studied to what extent an enlarged colony using $\\lambda$ ants per vertex helps in...... tracking an oscillating optimum. It is shown that easy cases of oscillations can be tracked by a constant number of ants. However, the paper also identifies more involved oscillations that with overwhelming probability cannot be tracked with any polynomial-size colony. Finally, parameters of dynamic...

  12. Research of Ant Colony Optimized Adaptive Control Strategy for Hybrid Electric Vehicle

    Directory of Open Access Journals (Sweden)

    Linhui Li

    2014-01-01

    Full Text Available Energy management control strategy of hybrid electric vehicle has a great influence on the vehicle fuel consumption with electric motors adding to the traditional vehicle power system. As vehicle real driving cycles seem to be uncertain, the dynamic driving cycles will have an impact on control strategy’s energy-saving effect. In order to better adapt the dynamic driving cycles, control strategy should have the ability to recognize the real-time driving cycle and adaptively adjust to the corresponding off-line optimal control parameters. In this paper, four types of representative driving cycles are constructed based on the actual vehicle operating data, and a fuzzy driving cycle recognition algorithm is proposed for online recognizing the type of actual driving cycle. Then, based on the equivalent fuel consumption minimization strategy, an ant colony optimization algorithm is utilized to search the optimal control parameters “charge and discharge equivalent factors” for each type of representative driving cycle. At last, the simulation experiments are conducted to verify the accuracy of the proposed fuzzy recognition algorithm and the validity of the designed control strategy optimization method.

  13. 蚁群算法参数分析%Parametric Study of Ant Colony Optimization

    Institute of Scientific and Technical Information of China (English)

    陈一昭; 姜麟

    2011-01-01

    The basic principle of Ant Colony algorithm and main parameters about this algorithm are determined are described. These parameters which greatly influence the ant colony algorithm' capacity of searching optimal so-lution comprise the inspired factor (e), the expectation inspired factor β, ant population m, information strength Q and the pheromone volatilization factor ρ. Employing the Travelling Salesman problem (TSP) as an example, dif-ferent combined conditions about these parameters are studied. Firstly, according to the result of numerical exam-ples, selects [(e),β,m,Q,ρ] =[1.5, 4.2, 30,200,0.5], Secondly, 4 parameters of them, Conducts numerical experiments by changing the remaining parameter value are fixed. Through getting (e) ∈ [0. 7,1.1],β ∈ [3.8, 4. 5] ,Q ∈ [400,950] and ρ ∈ [0. 7,0. 9] , the stable global optimal solution could be achieved.%介绍了蚁群算法的基本原理.确定了蚁群算法中的主要参数,这些参数对蚁群算法的寻优能力的影响非常之大,有启发因子δ,期望启发因子β,蚁群数量m,信息强度Q和信息素会发因子ρ等参数,以旅行商问题为例优化以上参数,研究这些参数的组合情况.首先根据数值试验选定[δ,β,m,Q,p]=[1.5,4.2,30,200,0.5].固定四个参数,改变一个参数进行数值试验.得到δ∈ [0.7,1.1],β∈[3.8,4.5],Q∈ [400,950]和p∈[0.7,0.9]能得到稳定的全局最优解.

  14. Multiple ant-bee colony optimization for load balancing in packet-switched networks

    OpenAIRE

    Mehdi Kashefi Kia; Nasser Nemat bakhsh; Reza Askari Moghadam

    2011-01-01

    One of the important issues in computer networks is “Load Balancing” which leads to efficient use of the network resources. To achieve a balanced network it is necessary to find different routes between the source and destination. In the current paper we propose a new approach to find different routes using swarm intelligence techniques and multi colony algorithms. In the proposed algorithm that is an improved version of MACO algorithm, we use different colonies of ants and bees and appoint t...

  15. HYBRIDIZATION OF MODIFIED ANT COLONY OPTIMIZATION AND INTELLIGENT WATER DROPS ALGORITHM FOR JOB SCHEDULING IN COMPUTATIONAL GRID

    Directory of Open Access Journals (Sweden)

    P. Mathiyalagan

    2013-10-01

    Full Text Available As grid is a heterogeneous environment, finding an optimal schedule for the job is always a complex task. In this paper, a hybridization technique using intelligent water drops and Ant colony optimization which are nature-inspired swarm intelligence approaches are used to find the best resource for the job. Intelligent water drops involves in finding out all matching resources for the job requirements and the routing information (optimal path to reach those resources. Ant Colony optimization chooses the best resource among all matching resources for the job. The objective of this approach is to converge to the optimal schedule faster, minimize the make span of the job, improve load balancing of resources and efficient utilization of available resources.

  16. Evaluation of Anaerobic Biofilm Reactor Kinetic Parameters Using Ant Colony Optimization.

    Science.gov (United States)

    Satya, Eswari Jujjavarapu; Venkateswarlu, Chimmiri

    2013-09-01

    Fixed bed reactors with naturally attached biofilms are increasingly used for anaerobic treatment of industry wastewaters due their effective treatment performance. The complex nature of biological reactions in biofilm processes often poses difficulty in analyzing them experimentally, and mathematical models could be very useful for their design and analysis. However, effective application of biofilm reactor models to practical problems suffers due to the lack of knowledge of accurate kinetic models and uncertainty in model parameters. In this work, an inverse modeling approach based on ant colony optimization is proposed and applied to estimate the kinetic and film thickness model parameters of wastewater treatment process in an anaerobic fixed bed biofilm reactor. Experimental data of pharmaceutical industry wastewater treatment process are used to determine the model parameters as a consequence of the solution of the rigorous mathematical models of the process. Results were evaluated for different modeling configurations derived from the combination of mathematical models, kinetic expressions, and optimization algorithms. Analysis of results showed that the two-dimensional mathematical model with Haldane kinetics better represents the pharmaceutical wastewater treatment in the biofilm reactor. The mathematical and kinetic modeling of this work forms a useful basis for the design and optimization of industry wastewater treating biofilm reactors. PMID:24065871

  17. Semivariogram Estimation Using Ant Colony Optimization and Ensemble Kriging Accounting for Parameter Uncertainty

    Science.gov (United States)

    Cardiff, M. A.; Kitanidis, P. K.

    2005-12-01

    In this presentation we revisit the problem of semivariogram estimation and present a modular, reusable, and encapsulated set of MATLAB programs that use a hybrid Ant Colony Optimization (ACO) heuristic to solve the "optimal fit" problem. Though the ACO heuristic involves a stochastic component, advantages of the heuristic over traditional gradient-search methods, like the Gauss-Newton method, include the ability to estimate model semivariogram parameters accurately without initial guesses input by the user. The ACO heuristic is also superiorly suited for strongly nonlinear optimization over spaces that may contain several local minima. The presentation will focus on the application of ACO to existing weighted least squares and restricted maximum likelihood estimation methods with a comparison of results. The presentation will also discuss parameter uncertainty, particularly in the context of restricted maximum likelihood and Bayesian methods. We compare the local linearized parameter estimates (or Cramer-Rao lower bounds) with modern Monte Carlo methods, such as acceptance-rejection. Finally, we present ensemble kriging in which conditional realizations are generated in a way that uncertainty in semi-variogram parameters is fully accounted for. Results for a variety of sample problems will be presented along with a discussion of solution accuracy and computational efficiency.

  18. Optimal management of substrates in anaerobic co-digestion: An ant colony algorithm approach.

    Science.gov (United States)

    Verdaguer, Marta; Molinos-Senante, María; Poch, Manel

    2016-04-01

    Sewage sludge (SWS) is inevitably produced in urban wastewater treatment plants (WWTPs). The treatment of SWS on site at small WWTPs is not economical; therefore, the SWS is typically transported to an alternative SWS treatment center. There is increased interest in the use of anaerobic digestion (AnD) with co-digestion as an SWS treatment alternative. Although the availability of different co-substrates has been ignored in most of the previous studies, it is an essential issue for the optimization of AnD co-digestion. In a pioneering approach, this paper applies an Ant-Colony-Optimization (ACO) algorithm that maximizes the generation of biogas through AnD co-digestion in order to optimize the discharge of organic waste from different waste sources in real-time. An empirical application is developed based on a virtual case study that involves organic waste from urban WWTPs and agrifood activities. The results illustrate the dominate role of toxicity levels in selecting contributions to the AnD input. The methodology and case study proposed in this paper demonstrate the usefulness of the ACO approach in supporting a decision process that contributes to improving the sustainability of organic waste and SWS management. PMID:26868846

  19. Protein folding in hydrophobic-polar lattice model: a flexible ant colony optimization approach

    OpenAIRE

    Hu, X-M.; Zhang, J.(High Energy Physics Division, Argonne National Laboratory, Argonne, IL, USA); Xiao, J.; Li, Y.

    2008-01-01

    This paper proposes a flexible ant colony (FAC) algorithm for solving protein folding problems based on the hydrophobic-polar square lattice model. Collaborations of novel pheromone and heuristic strategies in the proposed algorithm make it more effective in predicting structures of proteins compared with other state-of-the-art algorithms.

  20. Protein folding in hydrophobic-polar lattice model: a flexible ant-colony optimization approach.

    Science.gov (United States)

    Hu, Xiao-Min; Zhang, Jun; Xiao, Jing; Li, Yun

    2008-01-01

    This paper proposes a flexible ant colony (FAC) algorithm for solving protein folding problems based on the hydrophobic-polar square lattice model. Collaborations of novel pheromone and heuristic strategies in the proposed algorithm make it more effective in predicting structures of proteins compared with other state-of-the-art algorithms. PMID:18537736

  1. Ant Colony Optimization: Implementace a testování biologicky inspirované optimalizační metody

    OpenAIRE

    Havlík, Michal

    2015-01-01

    Havlík, M. Ant Colony Optimization: Implementation and testing of bio-inspired optimization method. Diploma thesis. Brno, 2015. This thesis deals with the implementation and testing of algorithm Ant Colony Optimization as a representative of the family of bio-inspired opti-mization methods. A given algorithm is described, analyzed and subsequently put into context with the problems which can be solved. Based on the collec-ted information is designed implementation that solves the Traveling sa...

  2. Integrating geological uncertainty in long-term open pit mine production planning by ant colony optimization

    Science.gov (United States)

    Gilani, Seyed-Omid; Sattarvand, Javad

    2016-02-01

    Meeting production targets in terms of ore quantity and quality is critical for a successful mining operation. In-situ grade uncertainty causes both deviations from production targets and general financial deficits. A new stochastic optimization algorithm based on ant colony optimization (ACO) approach is developed herein to integrate geological uncertainty described through a series of the simulated ore bodies. Two different strategies were developed based on a single predefined probability value (Prob) and multiple probability values (Pro bnt), respectively in order to improve the initial solutions that created by deterministic ACO procedure. Application at the Sungun copper mine in the northwest of Iran demonstrate the abilities of the stochastic approach to create a single schedule and control the risk of deviating from production targets over time and also increase the project value. A comparison between two strategies and traditional approach illustrates that the multiple probability strategy is able to produce better schedules, however, the single predefined probability is more practical in projects requiring of high flexibility degree.

  3. Fuzzy Random λ-Mean SAD Portfolio Selection Problem: An Ant Colony Optimization Approach

    Science.gov (United States)

    Thakur, Gour Sundar Mitra; Bhattacharyya, Rupak; Mitra, Swapan Kumar

    2010-10-01

    To reach the investment goal, one has to select a combination of securities among different portfolios containing large number of securities. Only the past records of each security do not guarantee the future return. As there are many uncertain factors which directly or indirectly influence the stock market and there are also some newer stock markets which do not have enough historical data, experts' expectation and experience must be combined with the past records to generate an effective portfolio selection model. In this paper the return of security is assumed to be Fuzzy Random Variable Set (FRVS), where returns are set of random numbers which are in turn fuzzy numbers. A new λ-Mean Semi Absolute Deviation (λ-MSAD) portfolio selection model is developed. The subjective opinions of the investors to the rate of returns of each security are taken into consideration by introducing a pessimistic-optimistic parameter vector λ. λ-Mean Semi Absolute Deviation (λ-MSAD) model is preferred as it follows absolute deviation of the rate of returns of a portfolio instead of the variance as the measure of the risk. As this model can be reduced to Linear Programming Problem (LPP) it can be solved much faster than quadratic programming problems. Ant Colony Optimization (ACO) is used for solving the portfolio selection problem. ACO is a paradigm for designing meta-heuristic algorithms for combinatorial optimization problem. Data from BSE is used for illustration.

  4. Azcaxalli: A system based on Ant Colony Optimization algorithms, applied to fuel reloads design in a Boiling Water Reactor

    International Nuclear Information System (INIS)

    This paper presents some results of the implementation of several optimization algorithms based on ant colonies, applied to the fuel reload design in a Boiling Water Reactor. The system called Azcaxalli is constructed with the following algorithms: Ant Colony System, Ant System, Best-Worst Ant System and MAX-MIN Ant System. Azcaxalli starts with a random fuel reload. Ants move into reactor core channels according to the State Transition Rule in order to select two fuel assemblies into a 1/8 part of the reactor core and change positions between them. This rule takes into account pheromone trails and acquired knowledge. Acquired knowledge is obtained from load cycle values of fuel assemblies. Azcaxalli claim is to work in order to maximize the cycle length taking into account several safety parameters. Azcaxalli's objective function involves thermal limits at the end of the cycle, cold shutdown margin at the beginning of the cycle and the neutron effective multiplication factor for a given cycle exposure. Those parameters are calculated by CM-PRESTO code. Through the Haling Principle is possible to calculate the end of the cycle. This system was applied to an equilibrium cycle of 18 months of Laguna Verde Nuclear Power Plant in Mexico. The results show that the system obtains fuel reloads with higher cycle lengths than the original fuel reload. Azcaxalli results are compared with genetic algorithms, tabu search and neural networks results.

  5. Azcaxalli: A system based on Ant Colony Optimization algorithms, applied to fuel reloads design in a Boiling Water Reactor

    Energy Technology Data Exchange (ETDEWEB)

    Esquivel-Estrada, Jaime, E-mail: jaime.esquivel@fi.uaemex.m [Facultad de Ingenieria, Universidad Autonoma del Estado de Mexico, Cerro de Coatepec S/N, Toluca de Lerdo, Estado de Mexico 50000 (Mexico); Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico); Ortiz-Servin, Juan Jose, E-mail: juanjose.ortiz@inin.gob.m [Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico); Castillo, Jose Alejandro; Perusquia, Raul [Instituto Nacional de Investigaciones Nucleares, Carr. Mexico Toluca S/N, Ocoyoacac, Estado de Mexico 52750 (Mexico)

    2011-01-15

    This paper presents some results of the implementation of several optimization algorithms based on ant colonies, applied to the fuel reload design in a Boiling Water Reactor. The system called Azcaxalli is constructed with the following algorithms: Ant Colony System, Ant System, Best-Worst Ant System and MAX-MIN Ant System. Azcaxalli starts with a random fuel reload. Ants move into reactor core channels according to the State Transition Rule in order to select two fuel assemblies into a 1/8 part of the reactor core and change positions between them. This rule takes into account pheromone trails and acquired knowledge. Acquired knowledge is obtained from load cycle values of fuel assemblies. Azcaxalli claim is to work in order to maximize the cycle length taking into account several safety parameters. Azcaxalli's objective function involves thermal limits at the end of the cycle, cold shutdown margin at the beginning of the cycle and the neutron effective multiplication factor for a given cycle exposure. Those parameters are calculated by CM-PRESTO code. Through the Haling Principle is possible to calculate the end of the cycle. This system was applied to an equilibrium cycle of 18 months of Laguna Verde Nuclear Power Plant in Mexico. The results show that the system obtains fuel reloads with higher cycle lengths than the original fuel reload. Azcaxalli results are compared with genetic algorithms, tabu search and neural networks results.

  6. A multipath routing protocol based on clustering and ant colony optimization for wireless sensor networks.

    Science.gov (United States)

    Yang, Jing; Xu, Mai; Zhao, Wei; Xu, Baoguo

    2010-01-01

    For monitoring burst events in a kind of reactive wireless sensor networks (WSNs), a multipath routing protocol (MRP) based on dynamic clustering and ant colony optimization (ACO) is proposed. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length) were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH) is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively. PMID:22399890

  7. A Multipath Routing Protocol Based on Clustering and Ant Colony Optimization for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jing Yang

    2010-05-01

    Full Text Available For monitoring burst events in a kind of reactive wireless sensor networks (WSNs, a multipath routing protocol (MRP based on dynamic clustering and ant colony optimization (ACO is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is their limited power supply, and therefore some metrics (such as energy consumption of communication among nodes, residual energy, path length were considered as very important criteria while designing routing in the MRP. Firstly, a cluster head (CH is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in the search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance of energy consumption among nodes and reduce the average energy consumption effectively.

  8. A Novel Approach for Medical Image Stitching Using Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Amrita

    2014-05-01

    Full Text Available Image stitching is one of important technologies in medical image processing field. In digital radiography oversized images have to be assembled from multiple exposures as the flat panel of an X-ray system cannot cover all part of a body. The stitching of X-ray images is carried out by employing two basic steps: Registration and Blending. The classical registration methods such as SIFT and SURF search for all the pixels to get the best registration. These methods are slow and cannot perform well for high resolution X-ray images. Therefore a fast and accurate feature based technique using ant colony optimization is implemented in the present work. This technique not only saves time but also gives the accuracy to stitch the image. This technique is also used for finding the edges for land marking and features of different X-ray images. Correlation is found between landmarks to check the alignment between the images and RANSAC algorithm is used to eliminate the spurious feature points. Finally alpha- blending technique is used to stitch the images.

  9. An ant colony optimization based feature selection for web page classification.

    Science.gov (United States)

    Saraç, Esra; Özel, Selma Ayşe

    2014-01-01

    The increased popularity of the web has caused the inclusion of huge amount of information to the web, and as a result of this explosive information growth, automated web page classification systems are needed to improve search engines' performance. Web pages have a large number of features such as HTML/XML tags, URLs, hyperlinks, and text contents that should be considered during an automated classification process. The aim of this study is to reduce the number of features to be used to improve runtime and accuracy of the classification of web pages. In this study, we used an ant colony optimization (ACO) algorithm to select the best features, and then we applied the well-known C4.5, naive Bayes, and k nearest neighbor classifiers to assign class labels to web pages. We used the WebKB and Conference datasets in our experiments, and we showed that using the ACO for feature selection improves both accuracy and runtime performance of classification. We also showed that the proposed ACO based algorithm can select better features with respect to the well-known information gain and chi square feature selection methods. PMID:25136678

  10. A modified ant colony optimization to solve multi products inventory routing problem

    Science.gov (United States)

    Wong, Lily; Moin, Noor Hasnah

    2014-07-01

    This study considers a one-to-many inventory routing problem (IRP) network consisting of a manufacturer that produces multi products to be transported to many geographically dispersed customers. We consider a finite horizon where a fleet of capacitated homogeneous vehicles, housed at a depot/warehouse, transport products from the warehouse to meet the demand specified by the customers in each period. The demand for each product is deterministic and time varying and each customer requests a distinct product. The inventory holding cost is product specific and is incurred at the customer sites. The objective is to determine the amount on inventory and to construct a delivery schedule that minimizes both the total transportation and inventory holding costs while ensuring each customer's demand is met over the planning horizon. The problem is formulated as a mixed integer programming problem and is solved using CPLEX 12.4 to get the lower and upper bound (best integer solution) for each problem considered. We propose a modified ant colony optimization (ACO) to solve the problem and the built route is improved by using local search. ACO performs better on large instances compared to the upper bound.

  11. Ant Colony Optimization for Mapping, Scheduling and Placing in Reconfigurable Systems

    Energy Technology Data Exchange (ETDEWEB)

    Ferrandi, Fabrizio; Lanzi, Pier Luca; Pilato, Christian; Sciuto, Donatella; Tumeo, Antonino

    2013-06-24

    Modern heterogeneous embedded platforms, com- posed of several digital signal, application specific and general purpose processors, also include reconfigurable devices support- ing partial dynamic reconfiguration. These devices can change the behavior of some of their parts during execution, allowing hardware acceleration of more sections of the applications. Never- theless, partial dynamic reconfiguration imposes severe overheads in terms of latency. For such systems, a critical part of the design phase is deciding on which processing elements (mapping) and when (scheduling) executing a task, but also how to place them on the reconfigurable device to guarantee the most efficient reuse of the programmable logic. In this paper we propose an algorithm based on Ant Colony Optimization (ACO) that simultaneously executes the scheduling, the mapping and the linear placing of tasks, hiding reconfiguration overheads through prefetching. Our heuristic gradually constructs solutions and then searches around the best ones, cutting out non-promising areas of the design space. We show how to consider the partial dynamic reconfiguration constraints in the scheduling, placing and mapping problems and compare our formulation to other heuristics that address the same problems. We demonstrate that our proposal is more general and robust, and finds better solutions (16.5% in average) with respect to competing solutions.

  12. A Multipath Routing Protocol Based on Clustering and Ant Colony Optimization for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Jing Yang

    2009-10-01

    Full Text Available For monitoring burst events in a kind of reactive wireless sensor networks (WSNs, a multipath routing protocol (MRP based on dynamic clustering and ant colony optimization (ACO is proposed.. Such an approach can maximize the network lifetime and reduce the energy consumption. An important attribute of WSNs is its limited power supply, and therefore in MRP, some metrics (such as energy consumption of communication among nodes, residual energy, path length are considered as very important criteria while designing routing. Firstly, a cluster head (CH is selected among nodes located in the event area according to some parameters, such as residual energy. Secondly, an improved ACO algorithm is applied in search for multiple paths between the CH and sink node. Finally, the CH dynamically chooses a route to transmit data with a probability that depends on many path metrics, such as energy consumption. The simulation results show that MRP can prolong the network lifetime, as well as balance energy consumption among nodes and reduce the average energy consumption effectively.

  13. A Multiple-Dimensional Tree Routing Protocol for Multisink Wireless Sensor Networks Based on Ant Colony Optimization

    OpenAIRE

    Hui Zhou; Dongliang Qing; Xiaomei Zhang; Honglin Yuan; Chen Xu

    2012-01-01

    Routing protocol is an important topic in the wireless sensor networks. For MultiSink wireless sensor networks, the routing protocol designs and implementations are more difficult due to the structure complexity. The paper deals with the problem of a multiple-dimensional tree routing protocol for multisink wireless sensor networks based on ant colony optimization. The proposed protocol is as follows: (1) listening mechanism is used to establish and maintain multidimensional tree routing topol...

  14. [Application of rational ant colony optimization to improve the reproducibility degree of laser three-dimensional copy].

    Science.gov (United States)

    Cui, Xiao-Yan; Huo, Zhong-Gang; Xin, Zhong-Hua; Tian, Xiao; Zhang, Xiao-Dong

    2013-07-01

    Three-dimensional (3D) copying of artificial ears and pistol printing are pushing laser three-dimensional copying technique to a new page. Laser three-dimensional scanning is a fresh field in laser application, and plays an irreplaceable part in three-dimensional copying. Its accuracy is the highest among all present copying techniques. Reproducibility degree marks the agreement of copied object with the original object on geometry, being the most important index property in laser three-dimensional copying technique. In the present paper, the error of laser three-dimensional copying was analyzed. The conclusion is that the data processing to the point cloud of laser scanning is the key technique to reduce the error and increase the reproducibility degree. The main innovation of this paper is as follows. On the basis of traditional ant colony optimization, rational ant colony optimization algorithm proposed by the author was applied to the laser three-dimensional copying as a new algorithm, and was put into practice. Compared with customary algorithm, rational ant colony optimization algorithm shows distinct advantages in data processing of laser three-dimensional copying, reducing the error and increasing the reproducibility degree of the copy. PMID:24059192

  15. Kernel feature identification algorithm based on improved ant colony optimization and its application in transient stability assessment

    Energy Technology Data Exchange (ETDEWEB)

    Guan, L.; Zhang, X.; Wang, T. [South China Univ. of Technology, Guangzhou (China). College of Electrical Power

    2009-03-11

    This study presented an optimized ant colony optimization algorithm combined with a K-nearest neighbour (K-NN) classifier. Ant colony optimization is used to simulate the information exchange and cooperation schemes among individual ants in the process of searching for food. The processes are used to simulate positive feedback, distributed computation, and the use of constructive heuristic searches. In this study, each feature was regarded as a node that the ant may visit. Feature selection processes were described as a path-forming process. The weighted sum of the K-NN classification error and a selected feature dimension was used to construct a fitness function for assessing transient stability. A local search loop wa used to remove redundant or strongly-correlated features. The algorithm was verified using a set of artificial test data. The scheme was then used to obtain a security-related kernel feature for an Institute of Electrical and Electronics Engineers (IEEE) 10-unit 39-bus system. The study demonstrated that the proposed scheme accurately assessed transient stability. 14 refs., 6 figs.

  16. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model.

    Science.gov (United States)

    Zhang, Zili; Gao, Chao; Liu, Yuxin; Qian, Tao

    2014-09-01

    Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. PMID:24613939

  17. A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model

    International Nuclear Information System (INIS)

    Ant colony optimization (ACO) algorithms often fall into the local optimal solution and have lower search efficiency for solving the travelling salesman problem (TSP). According to these shortcomings, this paper proposes a universal optimization strategy for updating the pheromone matrix in the ACO algorithms. The new optimization strategy takes advantages of the unique feature of critical paths reserved in the process of evolving adaptive networks of the Physarum-inspired mathematical model (PMM). The optimized algorithms, denoted as PMACO algorithms, can enhance the amount of pheromone in the critical paths and promote the exploitation of the optimal solution. Experimental results in synthetic and real networks show that the PMACO algorithms are more efficient and robust than the traditional ACO algorithms, which are adaptable to solve the TSP with single or multiple objectives. Meanwhile, we further analyse the influence of parameters on the performance of the PMACO algorithms. Based on these analyses, the best values of these parameters are worked out for the TSP. (paper)

  18. Multiple ant-bee colony optimization for load balancing in packet-switched networks

    CERN Document Server

    Kashefikia, Mehdi; Moghadam, Reza Askari

    2011-01-01

    One of the important issues in computer networks is "Load Balancing" which leads to efficient use of the network resources. To achieve a balanced network it is necessary to find different routes between the source and destination. In the current paper we propose a new approach to find different routes using swarm intelligence techniques and multi colony algorithms. In the proposed algorithm that is an improved version of MACO algorithm, we use different colonies of ants and bees and appoint these colony members as intelligent agents to monitor the network and update the routing information. The survey includes comparison and critiques of MACO. The simulation results show a tangible improvement in the aforementioned approach.

  19. MULTIPLE ANT-BEE COLONY OPTIMIZATION FOR LOAD BALANCING IN PACKET-SWITCHED NETWORKS

    Directory of Open Access Journals (Sweden)

    Mehdi Kashefi Kia

    2011-10-01

    Full Text Available One of the important issues in computer networks is “Load Balancing” which leads to efficient use of the network resources. To achieve a balanced network it is necessary to find different routes between the source and destination. In the current paper we propose a new approach to find different routes using swarm intelligence techniques and multi colony algorithms. In the proposed algorithm that is an improved version of MACO algorithm, we use different colonies of ants and bees and appoint these colony members as intelligent agents to monitor the network and update the routing information. The survey includes comparison and critiques of MACO. The simulation results show a tangible improvement in the aforementioned approach.

  20. Energy Efficient Routing in Wireless Sensor Networks Based on Fuzzy Ant Colony Optimization

    OpenAIRE

    Ehsan Amiri; Hassan Keshavarz; Mojtaba Alizadeh; Mazdak Zamani; Touraj Khodadadi

    2014-01-01

    A wireless sensor network (WSN) is a collection of sensor nodes that dynamically self-organize themselves into a wireless network without the utilization of any preexisting infrastructure. One of the major problems in WSNs is the energy consumption, whereby the network lifetime is dependent on this factor. In this paper, we propose an optimal routing protocol for WSN inspired by the foraging behavior of ants. The ants try to find existing paths between the source and base station. Furthermore...

  1. Recruitment strategies and colony size in ants.

    Directory of Open Access Journals (Sweden)

    Robert Planqué

    Full Text Available Ants use a great variety of recruitment methods to forage for food or find new nests, including tandem running, group recruitment and scent trails. It has been known for some time that there is a loose correlation across many taxa between species-specific mature colony size and recruitment method. Very small colonies tend to use solitary foraging; small to medium sized colonies use tandem running or group recruitment whereas larger colonies use pheromone recruitment trails. Until now, explanations for this correlation have focused on the ants' ecology, such as food resource distribution. However, many species have colonies with a single queen and workforces that grow over several orders of magnitude, and little is known about how a colony's organization, including recruitment methods, may change during its growth. After all, recruitment involves interactions between ants, and hence the size of the colony itself may influence which recruitment method is used--even if the ants' behavioural repertoire remains unchanged. Here we show using mathematical models that the observed correlation can also be explained by recognizing that failure rates in recruitment depend differently on colony size in various recruitment strategies. Our models focus on the build up of recruiter numbers inside colonies and are not based on optimality arguments, such as maximizing food yield. We predict that ant colonies of a certain size should use only one recruitment method (and always the same one rather than a mix of two or more. These results highlight the importance of the organization of recruitment and how it is affected by colony size. Hence these results should also expand our understanding of ant ecology.

  2. A hybrid of ant colony optimization and artificial bee colony algorithm for probabilistic optimal placement and sizing of distributed energy resources

    International Nuclear Information System (INIS)

    Highlights: • A probabilistic optimization framework incorporated with uncertainty is proposed. • A hybrid optimization approach combining ACO and ABC algorithms is proposed. • The problem is to deal with technical, environmental and economical aspects. • A fuzzy interactive approach is incorporated to solve the multi-objective problem. • Several strategies are implemented to compare with literature methods. - Abstract: In this paper, a hybrid configuration of ant colony optimization (ACO) with artificial bee colony (ABC) algorithm called hybrid ACO–ABC algorithm is presented for optimal location and sizing of distributed energy resources (DERs) (i.e., gas turbine, fuel cell, and wind energy) on distribution systems. The proposed algorithm is a combined strategy based on the discrete (location optimization) and continuous (size optimization) structures to achieve advantages of the global and local search ability of ABC and ACO algorithms, respectively. Also, in the proposed algorithm, a multi-objective ABC is used to produce a set of non-dominated solutions which store in the external archive. The objectives consist of minimizing power losses, total emissions produced by substation and resources, total electrical energy cost, and improving the voltage stability. In order to investigate the impact of the uncertainty in the output of the wind energy and load demands, a probabilistic load flow is necessary. In this study, an efficient point estimate method (PEM) is employed to solve the optimization problem in a stochastic environment. The proposed algorithm is tested on the IEEE 33- and 69-bus distribution systems. The results demonstrate the potential and effectiveness of the proposed algorithm in comparison with those of other evolutionary optimization methods

  3. Ant Colony Optimization detects anomalous aerosol variations associated with the Chile earthquake of 27 February 2010

    Science.gov (United States)

    Akhoondzadeh, M.

    2015-04-01

    This study attempts to acknowledge AOD (Aerosol Optical Depth) seismo-atmospheric anomalies around the time of the Chile earthquake of 27 February 2010. Since AOD precursor alone might not be useful as an accurate and stand alone criteria for the earthquake anomalies detection, therefore it would be more appropriate to use and integrate a variety of other precursors to reduce the uncertainty of potential detected seismic anomalies. To achieve this aim, eight other precursors including GPS-TEC (Total Electron Content), H+, He+, O+ densities (cm-3) and total ion density (cm-3) from IAP experiment, electron density (cm-3) and electron temperature (K) from ISL experiment and VLF electric field from ICE experiment have been surveyed to detect unusual variations around the time and location of the Chile earthquake. Moreover, three methods including Interquartile, ANN (Artificial Neural Network) and ACO (Ant Colony Optimization) have been implemented to observe the discord patterns in time series of the AOD precursor. All of the methods indicate a clear abnormal increase in time series of AOD data, 2 days prior to event. Also a striking anomaly is observed in time series of TEC data, 6 days preceding the earthquake. Using the analysis of ICE data, a prominent anomaly is detected in the VLF electric field measurement, 1 day before the earthquake. The time series of H+, He+, O+ densities (cm-3) and total ion density (cm-3) from IAP and also electron density (cm-3) and electron temperature (K) from ISL, illustrate the abnormal behaviors, 3 days before the event. It should be noted that the acknowledgment of the different lead times in outcomes of the implemented precursors strictly depend on the proper understanding of Lithosphere-Atmosphere-Ionosphere (LAI) coupling mechanism during seismic activities. It means that these different anomalies dates between LAI precursors can be a hint of truthfulness of multi-precursors analysis.

  4. Reviews of binary ant colony optimization%二元蚁群优化算法研究综述

    Institute of Scientific and Technical Information of China (English)

    钱乾; 程美英; 熊伟清; 周鸣争

    2012-01-01

    As an improvement of rhe ant colony algorithm,the binary ant colony algorithm has good performance in the discrete combinational optimization prohlems and continuous optimhation problems. However, the drawbacks that easy to fali into the local optimization and the limitation of the sole population as well as the increasement of the appraisal numbers still exist.Starting with one dimension cellular automata model,this paper designed a kind of binary ant colony cellular automata, then discussed a series of schemes on improving the binary ant colony algorithm, and aiso provided the new applications. FinaUy,it resented some remarks on the futher research.%二元蚁群优化算法作为蚁群算法改进的一种,其独特的随机二元网络结构在离散域及连续域优化问题中均得到较好的应用,但探索和利用的冲突、单一种群寻优的局限性以及算法评价次数的增加均限制了二元蚁群算法更好的发展.从一维细胞自动机入手,首先对二元蚁群优化算法的基本模型进行描述,然后讨论了近年来对二元蚁群优化算法的若干改进及应用;最后评述了二元蚁群优化算法未来的研究方向和主要研究内容.

  5. Ant- and Ant-Colony-Inspired ALife Visual Art.

    Science.gov (United States)

    Greenfield, Gary; Machado, Penousal

    2015-01-01

    Ant- and ant-colony-inspired ALife art is characterized by the artistic exploration of the emerging collective behavior of computational agents, developed using ants as a metaphor. We present a chronology that documents the emergence and history of such visual art, contextualize ant- and ant-colony-inspired art within generative art practices, and consider how it relates to other ALife art. We survey many of the algorithms that artists have used in this genre, address some of their aims, and explore the relationships between ant- and ant-colony-inspired art and research on ant and ant colony behavior. PMID:26280070

  6. Ant colony optimization as a descriptor selection in QSPR modeling for prediction of λmax of azo dyes

    Institute of Scientific and Technical Information of China (English)

    Morteza Atabati; Farzaneh Khandani

    2012-01-01

    A quantitative structure-property relationship (QSPR) study was suggested for the prediction of λmax of azo dyes.After optimization of 3D geometry of structures,different descriptors were calculated by the HyperChem and Dragon softwares.A major problem of QSPR is the high dimensionality of the descriptor space; therefore,descriptor selection is the most important step for these studies.In this paper,an ant colony optimization (ACO) algorithm was proposed to select the best descriptors.

  7. Arc-based constrained ant colony optimisation algorithms for the optimal solution of hydropower reservoir operation problems

    Energy Technology Data Exchange (ETDEWEB)

    Moeini, R.; Afshar, M.H.

    2011-07-15

    Hydropower is currently the number one source of electricity production in the world. For the design and construction of such systems, mathematical modelling is often use for reservoir operations. As conventional methods present some shortcomings in solving reservoir operation problems, a new method is presented here. It consists in an arc-based formulation of hydropower reservoir operation problems which can be applied to ant colony optimization algorithms. This paper first described this formulation and then applied it to solve two hydropower reservoir operation problems. The results showed that this formulation can optimally solve large-scale hydropower reservoir operation problems while offering a clear definition of heuristic information.

  8. Artificial Ant Species on Solving Optimization Problems

    OpenAIRE

    Pintea, Camelia-M.

    2013-01-01

    During the last years several ant-based techniques were involved to solve hard and complex optimization problems. The current paper is a short study about the influence of artificial ant species in solving optimization problems. There are studied the artificial Pharaoh Ants, Lasius Niger and also artificial ants with no special specificity used commonly in Ant Colony Optimization.

  9. Swarm Intelligence Based Ant Colony Optimization (ACO Approach for Maximizing the Lifetime of Heterogeneous Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    LingaRaj.K

    2013-11-01

    Full Text Available This paper attempts to undertake the study of maximizing the lifetime of Heterogeneous wireless sensor networks (WSNs. In wireless sensor networks, sensor nodes are typically power-constrained with limited lifetime, and thus it is necessary to know how long the network sustains its networking operations. Heterogeneous WSNs consists of different sensor devices with different capabilities. We can enhance the quality of monitoring in wireless sensor networks by increasing the coverage area. One of major issue in WSNs is finding maximum number of connected coverage. This paper proposed a Swarm Intelligence, Ant Colony Optimization (ACO based approach. Ant colony optimization algorithm provides a natural and intrinsic way of exploration of search space of coverage area. Ants communicate with their nest- mates using chemical scents known as pheromones, Based on Pheromone trail between sensor devices the shortest path is found. The methodology is based on finding the maximum number of connected covers that satisfy both sensing coverage and network connectivity. By finding the coverage area and sensing range, the network lifetime maximized and reduces the energy consumption

  10. Gas ultrasonic flow rate measurement through genetic-ant colony optimization based on the ultrasonic pulse received signal model

    International Nuclear Information System (INIS)

    For gas ultrasonic flowmeters, the signals received by ultrasonic sensors are susceptible to noise interference. If signals are mingled with noise, a large error in flow measurement can be caused by triggering mistakenly using the traditional double-threshold method. To solve this problem, genetic-ant colony optimization (GACO) based on the ultrasonic pulse received signal model is proposed. Furthermore, in consideration of the real-time performance of the flow measurement system, the improvement of processing only the first three cycles of the received signals rather than the whole signal is proposed. Simulation results show that the GACO algorithm has the best estimation accuracy and ant-noise ability compared with the genetic algorithm, ant colony optimization, double-threshold and enveloped zero-crossing. Local convergence doesn’t appear with the GACO algorithm until –10 dB. For the GACO algorithm, the converging accuracy and converging speed and the amount of computation are further improved when using the first three cycles (called GACO-3cycles). Experimental results involving actual received signals show that the accuracy of single-gas ultrasonic flow rate measurement can reach 0.5% with GACO-3 cycles, which is better than with the double-threshold method. (paper)

  11. Gas ultrasonic flow rate measurement through genetic-ant colony optimization based on the ultrasonic pulse received signal model

    Science.gov (United States)

    Hou, Huirang; Zheng, Dandan; Nie, Laixiao

    2015-04-01

    For gas ultrasonic flowmeters, the signals received by ultrasonic sensors are susceptible to noise interference. If signals are mingled with noise, a large error in flow measurement can be caused by triggering mistakenly using the traditional double-threshold method. To solve this problem, genetic-ant colony optimization (GACO) based on the ultrasonic pulse received signal model is proposed. Furthermore, in consideration of the real-time performance of the flow measurement system, the improvement of processing only the first three cycles of the received signals rather than the whole signal is proposed. Simulation results show that the GACO algorithm has the best estimation accuracy and ant-noise ability compared with the genetic algorithm, ant colony optimization, double-threshold and enveloped zero-crossing. Local convergence doesn’t appear with the GACO algorithm until -10 dB. For the GACO algorithm, the converging accuracy and converging speed and the amount of computation are further improved when using the first three cycles (called GACO-3cycles). Experimental results involving actual received signals show that the accuracy of single-gas ultrasonic flow rate measurement can reach 0.5% with GACO-3 cycles, which is better than with the double-threshold method.

  12. Energy Aware Reliable Routing Protocol (EARRP for Mobile AdHoc Networks Using Bee Foraging Behavior and Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    K.G.Santhiya

    2012-03-01

    Full Text Available Energy aware reliable routing in mobile ad hoc networks is an astonishing task and in this paper we propose to design, develop such protocol which will be a good solution. For developing such protocol EARRP, two swarm intelligence techniques are involved namely ant colony optimization and bee colony foraging behavior. For optimization, we proposed adaptive solutions in order to estimate MAC overhead, link eminence and residual energy. After estimating the above said metrics, the fitness function is derived out. The performance metrics taken are overhead, delay, packet delivery ratio and total energy consumed by nodes. By simulation results the proposed EARRP outperforms AODV by reducing energy consumption, overhead and delay. Also EARRP gains better packet delivery ratio than that of AODV.

  13. A multi-objective ant colony optimization method applied to switch engine scheduling in railroad yards

    Directory of Open Access Journals (Sweden)

    Jodelson A. Sabino

    2010-08-01

    Full Text Available This paper proposes an ant colony optimization algorithm to assist railroad yard operational planning staff in their daily tasks. The proposed algorithm tries to minimize a multi-objective function that considers both fixed and variable transportation costs involved in moving railroad cars within the railroad yard area. This is accomplished by searching the best switch engine schedule for a given time horizon. As the algorithm was designed for real life application, the solution must be delivered in a predefined processing time and it must be in accordance with railroad yard operational policies. A railroad yard operations simulator was built to produce artificial instances in order to tune the parameters of the algorithm. The project is being developed together with industrial professionals from the Tubarão Railroad Terminal, which is the largest railroad yard in Latin America.Este trabalho propõe um algoritmo de otimização com colônia de formigas para auxiliar a equipe de planejamento de operações de pátios ferroviários em suas tarefas diárias. O algoritmo proposto é baseado em uma função multi-objetivo que busca a redução dos custos fixo e variável de movimentação de vagões no pátio. Isto é feito através da busca da melhor programação para as locomotivas de manobra, considerando um dado horizonte de planejamento. Como o algoritmo foi desenvolvido para aplicação na vida real, a solução deve ser entregue em um tempo de processamento definido previamente e deve obedecer as políticas operacionais do pátio. Foi desenvolvido um simulador de operações de pátio que gera instâncias artificiais utilizadas para ajuste dos parâmetros do algoritmo. O projeto está sendo desenvolvido em conjunto com profissionais envolvidos na operação do Terminal Ferroviário de Tubarão, o qual é o maior pátio de manobras da América Latina.

  14. A multilevel ant colony optimization algorithm for classical and isothermic DNA sequencing by hybridization with multiplicity information available.

    Science.gov (United States)

    Kwarciak, Kamil; Radom, Marcin; Formanowicz, Piotr

    2016-04-01

    The classical sequencing by hybridization takes into account a binary information about sequence composition. A given element from an oligonucleotide library is or is not a part of the target sequence. However, the DNA chip technology has been developed and it enables to receive a partial information about multiplicity of each oligonucleotide the analyzed sequence consist of. Currently, it is not possible to assess the exact data of such type but even partial information should be very useful. Two realistic multiplicity information models are taken into consideration in this paper. The first one, called "one and many" assumes that it is possible to obtain information if a given oligonucleotide occurs in a reconstructed sequence once or more than once. According to the second model, called "one, two and many", one is able to receive from biochemical experiment information if a given oligonucleotide is present in an analyzed sequence once, twice or at least three times. An ant colony optimization algorithm has been implemented to verify the above models and to compare with existing algorithms for sequencing by hybridization which utilize the additional information. The proposed algorithm solves the problem with any kind of hybridization errors. Computational experiment results confirm that using even the partial information about multiplicity leads to increased quality of reconstructed sequences. Moreover, they also show that the more precise model enables to obtain better solutions and the ant colony optimization algorithm outperforms the existing ones. Test data sets and the proposed ant colony optimization algorithm are available on: http://bioserver.cs.put.poznan.pl/download/ACO4mSBH.zip. PMID:26878124

  15. Optimum culture medium composition for lipopeptide production by Bacillus subtilis using response surface model-based ant colony optimization

    Indian Academy of Sciences (India)

    J Satya Eswari; M Anand; C Venkateswarlu

    2016-01-01

    Central composite rotatable design (CCRD) of experiments was used to obtain data for Lipopeptide and Biomass concentrations from fermentation medium containing the following five components: glucose,monosodium glutamate, yeast extract,MgSO4·7H2O, and K2HPO4. Data was used to develop a second order regression response surface model (RSM) which was coupled with ant colony optimization (ACO) to optimize the media compositions so as to enhance the productivity of lipopeptide. The optimized media by ACO was found to yield 1.501 g/L of lipopeptide concentration which was much higher compared to 1.387 g/L predicted by Nelder–Mead optimization (NMO). The optimum from ACO was validated experimentally. RSM-based ACO is thus shown to be an effective tool for medium optimization of biosurfactant production.

  16. Building optimal regression tree by ant colony system-genetic algorithm: Application to modeling of melting points

    Energy Technology Data Exchange (ETDEWEB)

    Hemmateenejad, Bahram, E-mail: hemmatb@sums.ac.ir [Department of Chemistry, Shiraz University, Shiraz (Iran, Islamic Republic of); Medicinal and Natural Products Chemistry Research Center, Shiraz University of Medical Sciences, Shiraz (Iran, Islamic Republic of); Shamsipur, Mojtaba [Department of Chemistry, Razi University, Kermanshah (Iran, Islamic Republic of); Zare-Shahabadi, Vali [Young Researchers Club, Mahshahr Branch, Islamic Azad University, Mahshahr (Iran, Islamic Republic of); Akhond, Morteza [Department of Chemistry, Shiraz University, Shiraz (Iran, Islamic Republic of)

    2011-10-17

    Highlights: {yields} Ant colony systems help to build optimum classification and regression trees. {yields} Using of genetic algorithm operators in ant colony systems resulted in more appropriate models. {yields} Variable selection in each terminal node of the tree gives promising results. {yields} CART-ACS-GA could model the melting point of organic materials with prediction errors lower than previous models. - Abstract: The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure.

  17. Building optimal regression tree by ant colony system-genetic algorithm: Application to modeling of melting points

    International Nuclear Information System (INIS)

    Highlights: → Ant colony systems help to build optimum classification and regression trees. → Using of genetic algorithm operators in ant colony systems resulted in more appropriate models. → Variable selection in each terminal node of the tree gives promising results. → CART-ACS-GA could model the melting point of organic materials with prediction errors lower than previous models. - Abstract: The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure.

  18. New methods to minimize the preventive maintenance cost of series-parallel systems using ant colony optimization

    International Nuclear Information System (INIS)

    This article is based on a previous study made by Bris, Chatelet and Yalaoui [Bris R, Chatelet E, Yalaoui F. New method to minimise the preventive maintenance cost of series-parallel systems. Reliab Eng Syst Saf 2003;82:247-55]. They use genetic algorithm to minimize preventive maintenance cost problem for the series-parallel systems. We propose to improve their results developing a new method based on another technique, the Ant Colony Optimization (ACO). The resolution consists in determining the solution vector of system component inspection periods, T P. Those calculations were applied within the programming tool Matlab. Thus, highly interesting results and improvements of previous studies were obtained

  19. Framework for computationally efficient optimal irrigation scheduling using ant colony optimization

    Science.gov (United States)

    A general optimization framework is introduced with the overall goal of reducing search space size and increasing the computational efficiency of evolutionary algorithm application for optimal irrigation scheduling. The framework achieves this goal by representing the problem in the form of a decisi...

  20. Performance evaluation of ant colony optimization-based solution strategies on the mixed-model assembly line balancing problem

    Science.gov (United States)

    Akpinar, Sener; Mirac Bayhan, G.

    2014-06-01

    The aim of this article is to compare the performances of iterative ant colony optimization (ACO)-based solution strategies on a mixed-model assembly line balancing problem of type II (MMALBP-II) by addressing some particular features of real-world assembly line balancing problems such as parallel workstations and zoning constraints. To solve the problem, where the objective is to minimize the cycle time (i.e. maximize the production rate) for a predefined number of workstations in an existing assembly line, two ACO-based approaches which differ in the mission assigned to artificial ants are used. Furthermore, each ACO-based approach is conducted with two different pheromone release strategies: global and local pheromone updating rules. The four ACO-based approaches are used for solving 20 representative MMALBP-II to compare their performance in terms of computational time and solution quality. Detailed comparison results are presented.

  1. Improvement and Implementation of Best-worst Ant Colony Algorithm

    OpenAIRE

    Xianmin Wei

    2013-01-01

    In this study, we introduced the ant colony algorithm of best-worst ant system based on the pheromone update. By update improvements of local pheromone and global pheromone, as well as the optimal solution enhancement to a greater extent and the weakening of the worst solution, the algorithm further increased the difference of pheromone amount between the edge of the optimal path and the edge of the worst path and allowed the ant colony search behavior more focused near the optimal solution. ...

  2. The ant colony metaphor in continuous spaces using boundary search

    OpenAIRE

    Leguizamón, Guillermo

    2003-01-01

    This paper presents an application of the ant colony metaphor for continuous space optimization problems. The ant algortihm proposed works following the principle of the ant colony approach, i.e., a population of agents iteratively, cooperatively, and independently search for a solution. Each ant in the distributed algorithm applies a local search operator which explores the neighborhood region of a particular point in the search space (individual search level). The local search operator i...

  3. Image feature extraction based multiple ant colonies cooperation

    Science.gov (United States)

    Zhang, Zhilong; Yang, Weiping; Li, Jicheng

    2015-05-01

    This paper presents a novel image feature extraction algorithm based on multiple ant colonies cooperation. Firstly, a low resolution version of the input image is created using Gaussian pyramid algorithm, and two ant colonies are spread on the source image and low resolution image respectively. The ant colony on the low resolution image uses phase congruency as its inspiration information, while the ant colony on the source image uses gradient magnitude as its inspiration information. These two ant colonies cooperate to extract salient image features through sharing a same pheromone matrix. After the optimization process, image features are detected based on thresholding the pheromone matrix. Since gradient magnitude and phase congruency of the input image are used as inspiration information of the ant colonies, our algorithm shows higher intelligence and is capable of acquiring more complete and meaningful image features than other simpler edge detectors.

  4. Application of ant colony optimization to image classification using a Markov model with non-stationary neighborhoods

    Science.gov (United States)

    Le Hégarat-Mascle, S.; Kallel, A.; Descombes, X.

    2005-10-01

    In global classifications using Markov Random Field (MRF) modelling, the neighbourhood form is generally considered as independent of its location in the image. Such an approach may lead to classification errors for pixels located at the segment borders. The solution proposed here consists in relaxing the assumption of fixed-form neighbourhood. However this non-stationary neighbourhood modelling is useful only if an efficient heuristic can be defined to perform the optimization. Ant colony optimization (ACO) is currently a popular algorithm. It models upon the behavior of social insects for computing strategies: the information gathered by simple autonomous mobile agents, called ants, is shared and exploited for problem solving. Here we propose to use the ACO and to exploit its ability of self-organization. The ants collect information through the image, from one pixel to the others. The choice of the path is a function of the pixel label, favouring paths within a same image segment. We show that this corresponds to an automatic adaptation of the neighbourhood to the segment form. Performance of this new approach is illustrated on a simulated image and on actual remote sensing images, SPOT4/HRV, representing agricultural areas. In the studied examples, we found that it outperforms the fixed-form neighbourhood used in classical MRF classifications. The advantage of having a neighborhood shape that automatically adapts to the image segment clearly appears in these cases of images containing fine elements, lanes or thin fields, but also complex natural landscape structures.

  5. A novel hybrid approach based on Particle Swarm Optimization and Ant Colony Algorithm to forecast energy demand of Turkey

    International Nuclear Information System (INIS)

    Highlights: ► PSO and ACO algorithms are hybridized for forecasting energy demands of Turkey. ► Linear and quadratic forms are developed to meet the fluctuations of indicators. ► GDP, population, export and import have significant impacts on energy demand. ► Quadratic form provides better fit solution than linear form. ► Proposed approach gives lower estimation error than ACO and PSO, separately. - Abstract: This paper proposes a new hybrid method (HAP) for estimating energy demand of Turkey using Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). Proposed energy demand model (HAPE) is the first model which integrates two mentioned meta-heuristic techniques. While, PSO, developed for solving continuous optimization problems, is a population based stochastic technique; ACO, simulating behaviors between nest and food source of real ants, is generally used for discrete optimizations. Hybrid method based PSO and ACO is developed to estimate energy demand using gross domestic product (GDP), population, import and export. HAPE is developed in two forms which are linear (HAPEL) and quadratic (HAPEQ). The future energy demand is estimated under different scenarios. In order to show the accuracy of the algorithm, a comparison is made with ACO and PSO which are developed for the same problem. According to obtained results, relative estimation errors of the HAPE model are the lowest of them and quadratic form (HAPEQ) provides better-fit solutions due to fluctuations of the socio-economic indicators.

  6. Simulated Annealing-Based Ant Colony Algorithm for Tugboat Scheduling Optimization

    Directory of Open Access Journals (Sweden)

    Qi Xu

    2012-01-01

    Full Text Available As the “first service station” for ships in the whole port logistics system, the tugboat operation system is one of the most important systems in port logistics. This paper formulated the tugboat scheduling problem as a multiprocessor task scheduling problem (MTSP after analyzing the characteristics of tugboat operation. The model considers factors of multianchorage bases, different operation modes, and three stages of operations (berthing/shifting-berth/unberthing. The objective is to minimize the total operation times for all tugboats in a port. A hybrid simulated annealing-based ant colony algorithm is proposed to solve the addressed problem. By the numerical experiments without the shifting-berth operation, the effectiveness was verified, and the fact that more effective sailing may be possible if tugboats return to the anchorage base timely was pointed out; by the experiments with the shifting-berth operation, one can see that the objective is most sensitive to the proportion of the shifting-berth operation, influenced slightly by the tugboat deployment scheme, and not sensitive to the handling operation times.

  7. Chlorophyll concentration profiles from in situ radiances by ant colony optimization

    Energy Technology Data Exchange (ETDEWEB)

    Souto, R P [Instituto de Informatica, Universidade Federal do Rio Grande do Sul (UFRGS), Av. Bento Gonalves, 9500, P. O. Box 15064, 91501-970, Porto Alegre, RS (Brazil); Velho, H F Campos; Stephany, S [Laboratorio Associado de Computacao e Matematica Aplicada (LAC), Instituto Nacional de Pesquisas Espaciais (INPE), P. O. Box 515, 12245-970, Sao Jose dos Campos, SP (Brazil); Kampel, M [Divisao de Sensoriamento Remoto (DSR), Instituto Nacional de Pesquisas Espaciais (INPE), P. O. Box 515, 12245-970, Sao Jose dos Campos, SP (Brazil)], E-mail: rpsouto@inf.ufrgsbr, E-mail: haroldo@lac.inpe.br, E-mail: stephan@lac.inpe.br, E-mail: milton@dsr.inpe.br

    2008-07-15

    A methodology for the reconstruction of vertical profiles of the absorption (a) and scattering (b) coefficients in natural waters is presented. Reconstruction is performed using single-wavelength in situ radiance measurements at several depths. The depth is discretized by a multi-region approach assuming that absorption and scattering coefficients are constant in each region. The inverse problem is iteratively computed employing the radiative transfer equation as direct model, and bio-optical models to correlate the chlorophyll concentration to these coefficients. At every iteration, the inverse solver generates a candidate solution that is a set of discrete chlorophyll concentration values. For each region, the concentration is mapped to the values of absorption and scattering coefficients. The radiative transfer equation is then solved by a parallel version of the Laplace transform discrete ordinate (LTSN) method considering polar and azimuthal scattering angles. An objective function is given by the square difference between reconstructed and experimental radiances. In order to compensate the nearly exponential radiance decay with depth, that unbalances the influence of the radiance at different depths, a depth correction factor is applied to weight radiance values at each level. This objective function is minimized by an Ant Colony System (ACS) implementation. A new regularization scheme pre-selects candidate solutions based on their smoothness quantified by the Tikhonov's norm. A new chlorophyll candidate profile is then generated and iterations proceed. Synthetic and real data show the suitability of the proposed method.

  8. Feature Extraction in Medical Image using Ant Colony Optimization : A Study

    Directory of Open Access Journals (Sweden)

    A. Amali Asha,

    2011-02-01

    Full Text Available The front end of most vision systems consists of an edge detection as preprocessing. The vision of objects is easy for the human because of the natural intelligence of segmenting, pattern matching and recognizing very complex objects. But for the machine, everything needs to be artificially induced and it is not so easy to recognize and identify objects. Towards Computer vision, the Machine needs pattern recognition; extracting the important features so as to recognize the objects, where the boundary detection or the edge detection is very crucial. Edge detection is finding the points where there are sudden changes in the intensity values and linking them suitably. This paper aims at presenting a comparison of the Gradient based existing edge detectors, with a swarm intelligence Ant Colony. Though, these detectors are applied on to the same image, they may not see the same edge pixels. Some detectors seems to be good only for simple transparent images which are less noise prone, and marks pseudo and congested edges in case of denser images. Hence it would be appreciated, to have an edge detector, which is sensitive in detecting edges in majority of the common types of edges. With this in mind, the authors propose a new edge detector based on swarm intelligence, which fairly detects the edges of all types of images with improved quality, and with a low failing probability in detecting edges.

  9. Chlorophyll concentration profiles from in situ radiances by ant colony optimization

    International Nuclear Information System (INIS)

    A methodology for the reconstruction of vertical profiles of the absorption (a) and scattering (b) coefficients in natural waters is presented. Reconstruction is performed using single-wavelength in situ radiance measurements at several depths. The depth is discretized by a multi-region approach assuming that absorption and scattering coefficients are constant in each region. The inverse problem is iteratively computed employing the radiative transfer equation as direct model, and bio-optical models to correlate the chlorophyll concentration to these coefficients. At every iteration, the inverse solver generates a candidate solution that is a set of discrete chlorophyll concentration values. For each region, the concentration is mapped to the values of absorption and scattering coefficients. The radiative transfer equation is then solved by a parallel version of the Laplace transform discrete ordinate (LTSN) method considering polar and azimuthal scattering angles. An objective function is given by the square difference between reconstructed and experimental radiances. In order to compensate the nearly exponential radiance decay with depth, that unbalances the influence of the radiance at different depths, a depth correction factor is applied to weight radiance values at each level. This objective function is minimized by an Ant Colony System (ACS) implementation. A new regularization scheme pre-selects candidate solutions based on their smoothness quantified by the Tikhonov's norm. A new chlorophyll candidate profile is then generated and iterations proceed. Synthetic and real data show the suitability of the proposed method

  10. Multipath Data Transmission with minimization of Congestion Using Ant Colony Optimization for MTSP and Total Queue Length

    Directory of Open Access Journals (Sweden)

    Dhriti Sundar Maity

    2015-02-01

    Full Text Available This paper represents The Ant Colony Optimization for MTSP and Swarm Inspired Multipath Data Transmission with Congestion Control in MANET using Total Queue Length based on the behavioral nature in the biological ants. We consider the problem of congestion control for multicast traffic in wireless networks. MANET is multi hop wireless network in which the network components such as PC, mobile phones are mobile in nature. The components can communicate with each other without going through its server. One kind of agent (salesman is engaged in routing. One is Routing agent (salesman, who collects the information about network congestion as well as link failure and same is message agent (salesman that uses this information to get his destination nodes. Though a number of routing protocols exists, which aim to provide effecting routing but few provide a plausible solution to overall network congestion. We attempt to explore the property of the pheromone deposition by the real ant for MTSP. The proposed algorithm using path pheromone scents constantly updates the goodness of choosing a particular path and measuring the congestion in the network using total queue length and Hop-distance.

  11. The Optimization of Running Queries in Relational Databases Using ANT-Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Adel Alinezhad Kolaei

    2013-10-01

    Full Text Available The issue of optimizing queries is a cost-sensitive process and with respect to the number of associatedtables in a query, its number of permutations grows exponentially. On one hand, in comparison with otheroperators in relational database, join operator is the most difficult and complicated one in terms ofoptimization for reducing its runtime. Accordingly, various algorithms have so far been proposed to solvethis problem. On the other hand, the success of any database management system (DBMS meansexploiting the query model. In the current paper, the heuristic ant algorithm has been proposed to solve thisproblem and improve the runtime of join operation. Experiments and observed results reveal the efficiencyof this algorithm compared to its similar algorithms.

  12. Dynamic Task Scheduling Algorithm based on Ant Colony Scheme

    Directory of Open Access Journals (Sweden)

    Kamolov Nizomiddin Baxodirjonovich

    2015-08-01

    Full Text Available Many scientific applications running in Cloud Computing system are workflow applications that contains large number of tasks and in which tasks are connected by precedence relations. Efficient scheduling the workflow tasks become a challenging issue in Cloud Computing environments because the scheduling decides performance of the applications. Unfortunately, finding the optimal scheduling is known as NP-hard. Ant Colony Optimization algorithm can be applied to design efficient scheduling algorithms. Previous scheduling algorithms that use Ant Colony mechanism lack rapid adaptivity. This paper proposes a task scheduling algorithm that uses a modified Ant Colony Optimization. The modified version uses probability in order for ants to decide target machine. The proposed task scheduling algorithm is implemented in WorkflowSim in order to measure performance. The experimental results show that the proposed scheduling algorithm reduce average makespan to about 6.4% compared to a scheduling algorithm that uses basic Ant Colony Optimization scheme.

  13. An efficient technique to solve combined economic and emission dispatch problem using modified Ant colony optimization

    Indian Academy of Sciences (India)

    R Gopalakrishnan; A Krishnan

    2013-08-01

    Economic load dispatch is one of the vital purposes in electrical power system operation, management and planning. Economic dispatch problem is one of the most important problems in electric power system operation. In large scale system, the problem is more complex and difficult to find out optimal solution because it is nonlinear function and it contains number of local optimal. Combined economic emission dispatch (CEED) problem is to schedule the committed generating units outputs to meet the required load demand at minimum operating cost with minimum emission simultaneously. The main aim of economic load dispatch is to reduce the total production cost of the generating system and at the same time the necessary equality and inequality constraints should also be fulfilled. This leads to the development of CEED techniques. There are various techniques proposed by several researchers to solve CEED problem based on optimization techniques. But still some problems such as slower convergence and higher computational complexity exist in using the optimization techniques such as GA for solving CEED problem. This paper proposes an efficient and reliable technique for combined fuel cost economic optimization and emission dispatch using the Modified Ant Colony Optimization algorithm (MACO) to produce better optimal solution. The simulation results reveal the significant performance of the proposed MACO approach.

  14. An ant colony algorithm on continuous searching space

    Science.gov (United States)

    Xie, Jing; Cai, Chao

    2015-12-01

    Ant colony algorithm is heuristic, bionic and parallel. Because of it is property of positive feedback, parallelism and simplicity to cooperate with other method, it is widely adopted in planning on discrete space. But it is still not good at planning on continuous space. After a basic introduction to the basic ant colony algorithm, we will propose an ant colony algorithm on continuous space. Our method makes use of the following three tricks. We search for the next nodes of the route according to fixed-step to guarantee the continuity of solution. When storing pheromone, it discretizes field of pheromone, clusters states and sums up the values of pheromone of these states. When updating pheromone, it makes good resolutions measured in relative score functions leave more pheromone, so that ant colony algorithm can find a sub-optimal solution in shorter time. The simulated experiment shows that our ant colony algorithm can find sub-optimal solution in relatively shorter time.

  15. A hybrid gene selection approach for microarray data classification using cellular learning automata and ant colony optimization.

    Science.gov (United States)

    Vafaee Sharbaf, Fatemeh; Mosafer, Sara; Moattar, Mohammad Hossein

    2016-06-01

    This paper proposes an approach for gene selection in microarray data. The proposed approach consists of a primary filter approach using Fisher criterion which reduces the initial genes and hence the search space and time complexity. Then, a wrapper approach which is based on cellular learning automata (CLA) optimized with ant colony method (ACO) is used to find the set of features which improve the classification accuracy. CLA is applied due to its capability to learn and model complicated relationships. The selected features from the last phase are evaluated using ROC curve and the most effective while smallest feature subset is determined. The classifiers which are evaluated in the proposed framework are K-nearest neighbor; support vector machine and naïve Bayes. The proposed approach is evaluated on 4 microarray datasets. The evaluations confirm that the proposed approach can find the smallest subset of genes while approaching the maximum accuracy. PMID:27154739

  16. Robust boundary detection and tracking of left ventricles on ultrasound images using active shape model and ant colony optimization.

    Science.gov (United States)

    Zhang, Yaonan; Gao, Yuan; Jiao, Jinling; Li, Xian; Li, Sai; Yang, Jun

    2014-01-01

    Information regarding the motion, strain and synchronization are important for cardiac diagnosis and therapy. Extraction of such information from ultrasound images remains an open problem till today. In this paper, a novel method is proposed to extract the boundaries of left ventricles and track these boundaries in ultrasound image sequences. The initial detection of boundaries was performed by an active shape model scheme. Subsequent refinement of the boundaries was done by using local variance information of the images. The main objective of this paper is the formulation of a new boundary tracking algorithm using ant colony optimization technique. The experiments conducted on the simulated image sequences and the real cardiac ultrasound image sequences shows a positive and promising result. PMID:25226995

  17. A new approach based on ant colony optimization for daily Volt/Var control in distribution networks considering distributed generators

    Energy Technology Data Exchange (ETDEWEB)

    Niknam, Taher [Shiraz University of Technology, Electrical Engineering Department, Modars Boulevard, Shiraz (Iran)

    2008-12-15

    This paper presents a new approach to daily Volt/Var control in distribution systems with regard to distributed generators (DGs). Due to the small X/R ratio and radial configuration of distribution systems, DGs have much impact on this problem. A cost-based compensation methodology is proposed as a proper signal to encourage owners of DGs in active and reactive power generation. An evolutionary method based on ant colony optimization (ACO) is used to determine the active and reactive power values of DGs, reactive power values of capacitors and tap positions of transformers for the next day. The results indicate that the proposed encouraging factor has improved the performance of distribution networks on a large scale. (author)

  18. A temporal ant colony optimization approach to the shortest path problem in dynamic scale-free networks

    Science.gov (United States)

    Yu, Feng; Li, Yanjun; Wu, Tie-Jun

    2010-02-01

    A large number of networks in the real world have a scale-free structure, and the parameters of the networks change stochastically with time. Searching for the shortest paths in a scale-free dynamic and stochastic network is not only necessary for the estimation of the statistical characteristics such as the average shortest path length of the network, but also challenges the traditional concepts related to the “shortest path” of a network and the design of path searching strategies. In this paper, the concept of shortest path is defined on the basis of a scale-free dynamic and stochastic network model, and a temporal ant colony optimization (TACO) algorithm is proposed for searching for the shortest paths in the network. The convergence and the setup for some important parameters of the TACO algorithm are discussed through theoretical analysis and computer simulations, validating the effectiveness of the proposed algorithm.

  19. A new approach based on ant colony optimization for daily Volt/Var control in distribution networks considering distributed generators

    International Nuclear Information System (INIS)

    This paper presents a new approach to daily Volt/Var control in distribution systems with regard to distributed generators (DGs). Due to the small X/R ratio and radial configuration of distribution systems, DGs have much impact on this problem. A cost-based compensation methodology is proposed as a proper signal to encourage owners of DGs in active and reactive power generation. An evolutionary method based on ant colony optimization (ACO) is used to determine the active and reactive power values of DGs, reactive power values of capacitors and tap positions of transformers for the next day. The results indicate that the proposed encouraging factor has improved the performance of distribution networks on a large scale

  20. Ant Colony Optimization Combined With Immunosuppression and Parameters Switching Strategy for Solving Path Planning Problem of Landfill Inspection Robots

    Directory of Open Access Journals (Sweden)

    Chao Zhang

    2016-06-01

    Full Text Available An improved ant colony optimization (ACO combined with immunosuppression and parameters switching strategy is proposed in this paper. In this algorithm, a novel judgment criterion for immunosuppression is introduced, that is, if the optimum solution has not changed for default iteration number, the immunosuppressive strategy is carried out. Moreover, two groups of parameters in ACO are switched back and forth according to the change of optimum solution as well. Therefore, the search space is expanded greatly and the problem of the traditional ACO such as falling into local minima easily is avoided effectively. The comparative simulation studies for path planning of landfill inspection robots in Asahikawa, Japan are executed, and the results show that the proposed algorithm has better performance characterized by higher search quality and faster search speed.

  1. A multiobjective ant colony optimization approach for scheduling environmental flow management alternatives with application to the River Murray, Australia

    Science.gov (United States)

    Szemis, J. M.; Dandy, G. C.; Maier, H. R.

    2013-10-01

    In regulated river systems, such as the River Murray in Australia, the efficient use of water to preserve and restore biota in the river, wetlands, and floodplains is of concern for water managers. Available management options include the timing of river flow releases and operation of wetland flow control structures. However, the optimal scheduling of these environmental flow management alternatives is a difficult task, since there are generally multiple wetlands and floodplains with a range of species, as well as a large number of management options that need to be considered. Consequently, this problem is a multiobjective optimization problem aimed at maximizing ecological benefit while minimizing water allocations within the infrastructure constraints of the system under consideration. This paper presents a multiobjective optimization framework, which is based on a multiobjective ant colony optimization approach, for developing optimal trade-offs between water allocation and ecological benefit. The framework is applied to a reach of the River Murray in South Australia. Two studies are formulated to assess the impact of (i) upstream system flow constraints and (ii) additional regulators on this trade-off. The results indicate that unless the system flow constraints are relaxed, there is limited additional ecological benefit as allocation increases. Furthermore the use of regulators can increase ecological benefits while using less water. The results illustrate the utility of the framework since the impact of flow control infrastructure on the trade-offs between water allocation and ecological benefit can be investigated, thereby providing valuable insight to managers.

  2. Meta-heurística ACO (Ant Colony Optimization) para la resolución de problemas en líneas de producción

    OpenAIRE

    Bautista Valhondo, Joaquín; Bretón Blas, Javier; Fernández Ros, José Antonio; De la Rosa Herrero, Marcela

    2000-01-01

    La meta-heurística ACO (Ant Colony Optimization) es un procedimiento heurístico para la resolución de problemas de optimización discreta basado en el comportamiento de las hormigas. Sus principales características son: (1) la utilización de

  3. Building optimal regression tree by ant colony system-genetic algorithm: application to modeling of melting points.

    Science.gov (United States)

    Hemmateenejad, Bahram; Shamsipur, Mojtaba; Zare-Shahabadi, Vali; Akhond, Morteza

    2011-10-17

    The classification and regression trees (CART) possess the advantage of being able to handle large data sets and yield readily interpretable models. A conventional method of building a regression tree is recursive partitioning, which results in a good but not optimal tree. Ant colony system (ACS), which is a meta-heuristic algorithm and derived from the observation of real ants, can be used to overcome this problem. The purpose of this study was to explore the use of CART and its combination with ACS for modeling of melting points of a large variety of chemical compounds. Genetic algorithm (GA) operators (e.g., cross averring and mutation operators) were combined with ACS algorithm to select the best solution model. In addition, at each terminal node of the resulted tree, variable selection was done by ACS-GA algorithm to build an appropriate partial least squares (PLS) model. To test the ability of the resulted tree, a set of approximately 4173 structures and their melting points were used (3000 compounds as training set and 1173 as validation set). Further, an external test set containing of 277 drugs was used to validate the prediction ability of the tree. Comparison of the results obtained from both trees showed that the tree constructed by ACS-GA algorithm performs better than that produced by recursive partitioning procedure. PMID:21907021

  4. Combining support vector regression and ant colony optimization to reduce NOx emissions in coal-fired utility boilers

    Energy Technology Data Exchange (ETDEWEB)

    Ligang Zheng; Hao Zhou; Chunlin Wang; Kefa Cen [Zhejiang University, Hangzhou (China). State Key Laboratory of Clean Energy Utilization

    2008-03-15

    Combustion optimization has recently demonstrated its potential to reduce NOx emissions in high capacity coal-fired utility boilers. In the present study, support vector regression (SVR), as well as artificial neural networks (ANN), was proposed to model the relationship between NOx emissions and operating parameters of a 300 MW coal-fired utility boiler. The predicted NOx emissions from the SVR model, by comparing with that of the ANN-based model, showed better agreement with the values obtained in the experimental tests on this boiler operated at different loads and various other operating parameters. The mean modeling error and the correlation factor were 1.58% and 0.94, respectively. Then, the combination of the SVR model with ant colony optimization (ACO) to reduce NOx emissions was presented in detail. The experimental results showed that the proposed approach can effectively reduce NOx emissions from the coal-fired utility boiler by about 18.69% (65 ppm). A time period of less than 6 min was required for NOx emissions modeling, and 2 min was required for a run of optimization under a PC system. The computing times are suitable for the online application of the proposed method to actual power plants. 37 refs., 8 figs., 3 tabs.

  5. Complete Inverse Method Using Ant Colony Optimization Algorithm for Structural Parameters and Excitation Identification from Output Only Measurements

    Directory of Open Access Journals (Sweden)

    Jun Chen

    2014-01-01

    Full Text Available In vibration-based structural health monitoring of existing large civil structures, it is difficult, sometimes even impossible, to measure the actual excitation applied to structures. Therefore, an identification method using output-only measurements is crucial for the practical application of structural health monitoring. This paper integrates the ant colony optimization (ACO algorithm into the framework of the complete inverse method to simultaneously identify unknown structural parameters and input time history using output-only measurements. The complete inverse method, which was previously suggested by the authors, converts physical or spatial information of the unknown input into the objective function of an optimization problem that can be solved by the ACO algorithm. ACO is a newly developed swarm computation method that has a very good performance in solving complex global continuous optimization problems. The principles and implementation procedure of the ACO algorithm are first introduced followed by an introduction of the framework of the complete inverse method. Construction of the objective function is then described in detail with an emphasis on the common situation wherein a limited number of actuators are installed on some key locations of the structure. Applicability and feasibility of the proposed method were validated by numerical examples and experimental results from a three-story building model.

  6. A Web-Based Egg-Quality Expert Advisory System using Rule Based and Ant Colony (ACO Optimization Algorithms

    Directory of Open Access Journals (Sweden)

    J. Anitha

    2010-10-01

    Full Text Available This paper deals with the development of Web based online expert systems using Evolutionary Algorithms. An expert system is a computer application that performs a task that would otherwise be performed by a human expert. Here one of the evolutionary algorithms (ACO Algorithm is considered to find a good match of symptoms in the database. In the present paper, Ant Colony Optimization1 (ACO algorithm has been taken as the base and the concept of optimization is included, so that the new algorithm mainly focuses on the determination of the quality of eggs in the poultry farms. At first, the symptoms provided by the user are processed by a rule based expert system for identifying the quality of the eggs. If the rules required for processing the data by the above are not present in the database, then the system automatically calls the machine learning algorithm technique. As a whole, the system results good optimized solution for recognizing the quality and viruses if any affected to eggs in poultry farms. And corresponding treatments to the viruses may also be suggested to the users. This expert system is designed with JSP as front end and MySQL as backend.

  7. A framework for using ant colony optimization to schedule environmental flow management alternatives for rivers, wetlands, and floodplains

    Science.gov (United States)

    Szemis, J. M.; Maier, H. R.; Dandy, G. C.

    2012-08-01

    Rivers, wetlands, and floodplains are in need of management as they have been altered from natural conditions and are at risk of vanishing because of river development. One method to mitigate these impacts involves the scheduling of environmental flow management alternatives (EFMA); however, this is a complex task as there are generally a large number of ecological assets (e.g., wetlands) that need to be considered, each with species with competing flow requirements. Hence, this problem evolves into an optimization problem to maximize an ecological benefit within constraints imposed by human needs and the physical layout of the system. This paper presents a novel optimization framework which uses ant colony optimization to enable optimal scheduling of EFMAs, given constraints on the environmental water that is available. This optimization algorithm is selected because, unlike other currently popular algorithms, it is able to account for all aspects of the problem. The approach is validated by comparing it to a heuristic approach, and its utility is demonstrated using a case study based on the Murray River in South Australia to investigate (1) the trade-off between plant recruitment (i.e., promoting germination) and maintenance (i.e., maintaining habitat) flow requirements, (2) the trade-off between flora and fauna flow requirements, and (3) a hydrograph inversion case. The results demonstrate the usefulness and flexibility of the proposed framework as it is able to determine EFMA schedules that provide optimal or near-optimal trade-offs between the competing needs of species under a range of operating conditions and valuable insight for managers.

  8. Path Optimization for WSN Based on Improved Ant Colony Algorithm%基于改进蚁群算法的WSN路径优化

    Institute of Scientific and Technical Information of China (English)

    杨新锋; 刘克成

    2012-01-01

    Against path optimization problem for wireless sensor network (WSN), this paper proposes a path optimization for WSN based on improved ant colony algorithm by combining with the advantages of genetic algorithm and ant colony algorithm and introducing the genetic algorithm selection, crossover and mutation operators into ant colony algorithm to improve the algorithm's capability of convergence and global search. Simulation experimental results show that the improved ant colony algorithm improves WSN routing efficiency and success rate, prolongs the survival time of network and improves the overall network performance.%针对无线传感器网络(WSN)路径优化问题,提出一种改进蚁群算法的WSN路径优化方法,结合遗传算法和蚁群算法的优点,在蚁群算法中引入遗传算法选择、交叉和变异算子,提高算法收敛和全局寻优能力.仿真对比实验结果表明,改进蚁群算法提高了WSN路径优化效率和成功率,有效延长了WSN的生命周期,改善了网络整体性能.

  9. Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

    OpenAIRE

    Shuai Deng; Yanhui Li; Hao Guo; Bailing Liu

    2016-01-01

    This paper presents a closed-loop location-inventory-routing problem model considering both quality defect returns and nondefect returns in e-commerce supply chain system. The objective is to minimize the total cost produced in both forward and reverse logistics networks. We propose a combined optimization algorithm named hybrid ant colony optimization algorithm (HACO) to address this model that is an NP-hard problem. Our experimental results show that the proposed HACO is considerably effici...

  10. Ant Colony versus Genetic Algorithm based on Travelling Salesman Problem

    Directory of Open Access Journals (Sweden)

    Mohammed Alhanjouri

    2011-05-01

    Full Text Available The travelling salesman problem (TSP is a nondeterministic Polynomial hard problem in combinatorial optimization studied in operations research and theoretical computer science. And to solve this problem we used two popular meta-heuristics techniques that used for optimization tasks; the first one is Ant Colony Optimization (ACO, and the second is Genetic Algorithm (GA. In this work, we try to apply both techniques to solve TSP by using the same dataset and compare between them to determine the best one for travelling salesman problem. for Ant Colony Optimization, we studied the effect of some parameters on the produced results, these parameters as: number of used Ants, evaporation, and number of iterations. On the other hand, we studied the chromosome population, crossover probability, and mutation probability parameters that effect on the Genetic Algorithm results.The comparison between Genetic Algorithm and Ant Colony Optimization is accomplished to state the better one for travelling salesman problem.

  11. An integrated ant colony optimization approach to compare strategies of clearing market in electricity markets: Agent-based simulation

    International Nuclear Information System (INIS)

    In this paper, an innovative model of agent based simulation, based on Ant Colony Optimization (ACO) algorithm is proposed in order to compare three available strategies of clearing wholesale electricity markets, i.e. uniform, pay-as-bid, and generalized Vickrey rules. The supply side actors of the power market are modeled as adaptive agents who learn how to bid strategically to optimize their profit through indirect interaction with other actors of the market. The proposed model is proper for bidding functions with high number of dimensions and enables modelers to avoid curse of dimensionality as dimension grows. Test systems are then used to study the behavior of each pricing rule under different degrees of competition and heterogeneity. Finally, the pricing rules are comprehensively compared using different economic criteria such as average cleared price, efficiency of allocation, and price volatility. Also, principle component analysis (PCA) is used to rank and select the best price rule. To the knowledge of the authors, this is the first study that uses ACO for assessing strategies of wholesale electricity market.

  12. Measurement of total anthocyanins content in flowering tea using near infrared spectroscopy combined with ant colony optimization models.

    Science.gov (United States)

    Xiaowei, Huang; Xiaobo, Zou; Jiewen, Zhao; Jiyong, Shi; Xiaolei, Zhang; Holmes, Mel

    2014-12-01

    Flowering tea has become a popular beverage consumed across the world. Anthocyanins content is considered as an important quality index of flowering tea. The feasibility of using near infrared (NIR) spectra at the wavelength range of 10,000-4000 cm(-1) for rapid and nondestructive determination of total anthocyanins content in flowering tea was investigated. Ant colony optimization interval partial least squares (ACO-iPLS) and Genetic algorithm interval partial least squares (GA-iPLS) were used to develop calibration models for total anthocyanins content. Two characteristic wavelength regions (4590-4783, 5770-5,963 cm(-1)), which corresponding to the ultraviolet/visible absorption bands of anthocyanins, were selected by ACO-iPLS. The optimal ACO-iPLS model for total anthocyanins content (R=0.9856, RMSECV=0.1,198 mg/g) had better performance than full-spectrum PLS, iPLS, and GA-iPLS models. It could be concluded that NIR spectroscopy has significant potential in the nondestructive determination of total anthocyanins content in flowering tea. PMID:24996367

  13. Reverse Game Theory Approach for Aggregator Nodes Selection with Ant Colony Optimization Based Routing in Wireless Sensor Network

    Directory of Open Access Journals (Sweden)

    Bharathi M A

    2012-11-01

    Full Text Available The self-configurable, randomly distributed, adhoc technology based wireless sensor networks can be invaluable in various domestic and military applications for collecting, processing and propagating wide range of complex environmental data. Hierarchical routing has been adopted, where clusters of nodes are formulated based on geographical location of nodes and associate node to aggregator node and other aggregator node to sink or aggregator node to aggregator node to sink routing mechanism is followed. The model work Low Energy Adaptive Clustering Hierarchical (LEACH, is the leading work in this direction, whereas it is a complete probabilistic model, which does not achieve the tradeoff between power and QoS parameter optimization. We proposed RGT-AGN-ACO-R (Reverse Game Theory based Aggregator Node Selection and Ant Colony Optimization based Routing, In order to maximize life time of the network. The proposed protocol has been simulated, and the life time assessment, power inconsistency, residual power against number of rounds is evaluated and is compared with LEACH. Simulation results shows a remarkable enhancement as compare to LEACH

  14. An integrated ant colony optimization approach to compare strategies of clearing market in electricity markets: Agent-based simulation

    Energy Technology Data Exchange (ETDEWEB)

    Azadeh, A., E-mail: aazadeh@ut.ac.i [Department of Industrial Engineering and Center of Excellence for Intelligent Experimental Mechanics, College of Engineering, University of Tehran (Iran, Islamic Republic of); Skandari, M.R. [Department of Industrial Engineering, University of Florida, Gainesville (United States); Maleki-Shoja, B. [Department of Industrial Engineering and Center of Excellence for Intelligent Experimental Mechanics, College of Engineering, University of Tehran (Iran, Islamic Republic of)

    2010-10-15

    In this paper, an innovative model of agent based simulation, based on Ant Colony Optimization (ACO) algorithm is proposed in order to compare three available strategies of clearing wholesale electricity markets, i.e. uniform, pay-as-bid, and generalized Vickrey rules. The supply side actors of the power market are modeled as adaptive agents who learn how to bid strategically to optimize their profit through indirect interaction with other actors of the market. The proposed model is proper for bidding functions with high number of dimensions and enables modelers to avoid curse of dimensionality as dimension grows. Test systems are then used to study the behavior of each pricing rule under different degrees of competition and heterogeneity. Finally, the pricing rules are comprehensively compared using different economic criteria such as average cleared price, efficiency of allocation, and price volatility. Also, principle component analysis (PCA) is used to rank and select the best price rule. To the knowledge of the authors, this is the first study that uses ACO for assessing strategies of wholesale electricity market.

  15. An integrated ant colony optimization approach to compare strategies of clearing market in electricity markets. Agent-based simulation

    International Nuclear Information System (INIS)

    In this paper, an innovative model of agent based simulation, based on Ant Colony Optimization (ACO) algorithm is proposed in order to compare three available strategies of clearing wholesale electricity markets, i.e. uniform, pay-as-bid, and generalized Vickrey rules. The supply side actors of the power market are modeled as adaptive agents who learn how to bid strategically to optimize their profit through indirect interaction with other actors of the market. The proposed model is proper for bidding functions with high number of dimensions and enables modelers to avoid curse of dimensionality as dimension grows. Test systems are then used to study the behavior of each pricing rule under different degrees of competition and heterogeneity. Finally, the pricing rules are comprehensively compared using different economic criteria such as average cleared price, efficiency of allocation, and price volatility. Also, principle component analysis (PCA) is used to rank and select the best price rule. To the knowledge of the authors, this is the first study that uses ACO for assessing strategies of wholesale electricity market. (author)

  16. An integrated ant colony optimization approach to compare strategies of clearing market in electricity markets. Agent-based simulation

    Energy Technology Data Exchange (ETDEWEB)

    Azadeh, A.; Maleki-Shoja, B. [Department of Industrial Engineering and Center of Excellence for Intelligent Experimental Mechanics, College of Engineering, University of Tehran (Iran); Skandari, M.R. [Department of Industrial Engineering, University of Florida, Gainesville (United States)

    2010-10-15

    In this paper, an innovative model of agent based simulation, based on Ant Colony Optimization (ACO) algorithm is proposed in order to compare three available strategies of clearing wholesale electricity markets, i.e. uniform, pay-as-bid, and generalized Vickrey rules. The supply side actors of the power market are modeled as adaptive agents who learn how to bid strategically to optimize their profit through indirect interaction with other actors of the market. The proposed model is proper for bidding functions with high number of dimensions and enables modelers to avoid curse of dimensionality as dimension grows. Test systems are then used to study the behavior of each pricing rule under different degrees of competition and heterogeneity. Finally, the pricing rules are comprehensively compared using different economic criteria such as average cleared price, efficiency of allocation, and price volatility. Also, principle component analysis (PCA) is used to rank and select the best price rule. To the knowledge of the authors, this is the first study that uses ACO for assessing strategies of wholesale electricity market. (author)

  17. Exploration adjustment by ant colonies.

    Science.gov (United States)

    Doran, Carolina; Stumpe, Martin C; Sendova-Franks, Ana; Franks, Nigel R

    2016-01-01

    How do animals in groups organize their work? Division of labour, i.e. the process by which individuals within a group choose which tasks to perform, has been extensively studied in social insects. Variability among individuals within a colony seems to underpin both the decision over which tasks to perform and the amount of effort to invest in a task. Studies have focused mainly on discrete tasks, i.e. tasks with a recognizable end. Here, we study the distribution of effort in nest seeking, in the absence of new nest sites. Hence, this task is open-ended and individuals have to decide when to stop searching, even though the task has not been completed. We show that collective search effort declines when colonies inhabit better homes, as a consequence of a reduction in the number of bouts (exploratory events). Furthermore, we show an increase in bout exploration time and a decrease in bout instantaneous speed for colonies inhabiting better homes. The effect of treatment on bout effort is very small; however, we suggest that the organization of work performed within nest searching is achieved both by a process of self-selection of the most hard-working ants and individual effort adjustment. PMID:26909180

  18. Lifecycle-Based Binary Ant Colony Optimization Algorithm%基于生命周期的二元蚁群优化算法

    Institute of Scientific and Technical Information of China (English)

    程美英; 倪志伟; 朱旭辉

    2014-01-01

    将自然生态系统中生物生命周期的思想引入二元蚁群优化算法中,通过对蚂蚁设置相应的营养阈值而执行繁殖、迁徙、死亡操作,从而保持种群的动态多样性,进而克服二元蚁群优化算法易陷入局部最优的缺陷,然后结合分形维数将该算法应用于属性约简问题中,通过UCI中的6个数据集进行测试,结果表明该算法具有较好的可行性和有效性。%The biological life cycle in natural ecosystem is introduced into binary ant colony optimization algorithm, and the main idea is to execute breeding, migrating and dying operations by setting relevant nutritious threshold value to the ants. Thus, the dynamic diversity of the population is maintained and the drawback that binary ant colony optimization algorithm easily traps in local optimum is overcome. The proposed algorithm, lifecycle-based binary ant colony optimization algorithm ( LCBBACO) , is combined with fractal dimension to attribute reduction problem. The experimental results on 6 UCI datasets show that the method has preferable feasibility and effectiveness.

  19. An Energy-Efficient Multipath Routing Algorithm Based on Ant Colony Optimization for Wireless Sensor Networks

    OpenAIRE

    Mengjun Tong; Yangli Chen; Fangxiang Chen; Xiaoping Wu; Guozhong Shou

    2015-01-01

    An energy-efficient ACO-based multipath routing algorithm (EAMR) is proposed for energy-constrained wireless sensor networks. EAMR is a hybrid multipath algorithm, which is reactive in path discovery and proactive in route maintenance. EAMR has improvement and innovation in the ant packet structure, pheromone update formula, pheromone update mode, and the mechanism of multipath. Average energy consumption and congestion of path make pheromone update formula more reasonable. Incremental pherom...

  20. Ant colony optimization and its application to adaptive routing in telecommunication networks

    OpenAIRE

    Di Caro, Gianni

    2004-01-01

    In ant societies, and, more in general, in insect societies, the activities of the individuals, as well as of the society as a whole, are not regulated by any explicit form of centralized control. On the other hand, adaptive and robust behaviors transcending the behavioral repertoire of the single individual can be easily observed at society level. These complex global behaviors are the result of self-organizing dynamics driven by local interactions and communications among a number of relati...

  1. An Improved Multi--Objective Ant Colony Optimization Algorithm of Quantum%一种改进的量子多目标蚁群优化算法

    Institute of Scientific and Technical Information of China (English)

    杨剑; 张敏辉

    2011-01-01

    提出一种新的量子多目标蚁群算法.在蚁群算法的基础上中引入量子理论,将量子计算与蚁群进行融合,并用于求解多目标问题.该算法的核心是在蚁群中引入量子算法中的量子态矢量和量子旋转门来分别表示和更新信息素.该算法在全局寻优能力和种群多样性方面比蚁群算法有所改进,测试表明:该算法是求解多目标问题的一种有效的算法.%Proposed a new quantum multi--objective anf colony algorithm. In the ant colony algorithm based on the introduction of quantum theory, quantum computation and ant colony fusion, and for solving multi--objective problem. The core of the algorithm is introduced in the colony quantum quantum algorithm and quantum state vector, respectively, and the revolving door to update the pheromone. The ability of global optimization algorithm and population diversity than improved ant colony algorithm, the algorithm was tested, the results shows that the algorithm for solving Multi--objective problem is an effective algorithm.

  2. Estimate of FDG excretion by means of compartmental analysis and ant colony optimization of nuclear medicine data.

    Science.gov (United States)

    Garbarino, Sara; Caviglia, Giacomo; Brignone, Massimo; Massollo, Michela; Sambuceti, Gianmario; Piana, Michele

    2013-01-01

    [(18)F]fluoro-2-deoxy-D-glucose (FDG) is one of the most utilized tracers for positron emission tomography (PET) applications in oncology. FDG-PET relies on higher glycolytic activity in tumors compared to normal structures as the basis of image contrast. As a glucose analog, FDG is transported into malignant cells which typically exhibit an increased radioactivity. However, different from glucose, FDG is not reabsorbed by the renal system and is excreted to the bladder. The present paper describes a novel computational method for the quantitative assessment of this excretion process. The method is based on a compartmental analysis of FDG-PET data in which the excretion process is explicitly accounted for by the bladder compartment and on the application of an ant colony optimization (ACO) algorithm for the determination of the tracer coefficients describing the FDG transport effectiveness. The validation of this approach is performed by means of both synthetic data and real measurements acquired by a PET device for small animals (micro-PET). Possible oncological applications of the results are discussed in the final section. PMID:24191175

  3. At-Least Version of the Generalized Minimum Spanning Tree Problem: Optimization Through Ant Colony System and Genetic Algorithms

    Science.gov (United States)

    Janich, Karl W.

    2005-01-01

    The At-Least version of the Generalized Minimum Spanning Tree Problem (L-GMST) is a problem in which the optimal solution connects all defined clusters of nodes in a given network at a minimum cost. The L-GMST is NPHard; therefore, metaheuristic algorithms have been used to find reasonable solutions to the problem as opposed to computationally feasible exact algorithms, which many believe do not exist for such a problem. One such metaheuristic uses a swarm-intelligent Ant Colony System (ACS) algorithm, in which agents converge on a solution through the weighing of local heuristics, such as the shortest available path and the number of agents that recently used a given path. However, in a network using a solution derived from the ACS algorithm, some nodes may move around to different clusters and cause small changes in the network makeup. Rerunning the algorithm from the start would be somewhat inefficient due to the significance of the changes, so a genetic algorithm based on the top few solutions found in the ACS algorithm is proposed to quickly and efficiently adapt the network to these small changes.

  4. Inverse estimation of the spheroidal particle size distribution using Ant Colony Optimization algorithms in multispectral extinction technique

    Science.gov (United States)

    He, Zhenzong; Qi, Hong; Wang, Yuqing; Ruan, Liming

    2014-10-01

    Four improved Ant Colony Optimization (ACO) algorithms, i.e. the probability density function based ACO (PDF-ACO) algorithm, the Region ACO (RACO) algorithm, Stochastic ACO (SACO) algorithm and Homogeneous ACO (HACO) algorithm, are employed to estimate the particle size distribution (PSD) of the spheroidal particles. The direct problems are solved by the extended Anomalous Diffraction Approximation (ADA) and the Lambert-Beer law. Three commonly used monomodal distribution functions i.e. the Rosin-Rammer (R-R) distribution function, the normal (N-N) distribution function, and the logarithmic normal (L-N) distribution function are estimated under dependent model. The influence of random measurement errors on the inverse results is also investigated. All the results reveal that the PDF-ACO algorithm is more accurate than the other three ACO algorithms and can be used as an effective technique to investigate the PSD of the spheroidal particles. Furthermore, the Johnson's SB (J-SB) function and the modified beta (M-β) function are employed as the general distribution functions to retrieve the PSD of spheroidal particles using PDF-ACO algorithm. The investigation shows a reasonable agreement between the original distribution function and the general distribution function when only considering the variety of the length of the rotational semi-axis.

  5. An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method

    OpenAIRE

    Peker, Musa; ŞEN, Baha; KUMRU, Pınar Yıldız

    2012-01-01

    Owing to its complexity, the traveling salesman problem (TSP) is one of the most intensively studied problems in computational mathematics. The TSP is defined as the provision of minimization of total distance, cost, and duration by visiting the n number of points only once in order to arrive at the starting point. Various heuristic algorithms used in many fields have been developed to solve this problem. In this study, a solution was proposed for the TSP using the ant colony system and...

  6. A cross-layer design and ant-colony optimization based load-balancing routing protocol for ad-hoc networks

    Institute of Scientific and Technical Information of China (English)

    ZHENG Xiangquan; GUO Wei; GE Lijia; LIU Renting

    2007-01-01

    In order to periodically reassess the status of the alternate path route (APR) set and to improve the efficiency of alternate path construction existing in most current alternate path routing protocols,we present a cross-layer design and ant-colony optimization based load-balancing routing protocol for ad-hoc networks (CALRA) in this paper.In CALRA,the APR set maintained in nodes is aged and reassessed by the inherent mechanism of pheromone evaporation of ant-colony optimization algorithm,and load balance of network is achieved by ant-colony optimization combining with cross-layer synthetic optimization.The efficiency of APR set construction is improved by bidirectional and hop-by-hop routing update during routing discovery and routing maintenance process.Moreover,ants in CALRA deposit simulated pheromones as a function of multiple parameters corresponding to the information collected by each layer of each node visited,such as the distance from their source node,the congestion degree of the visited nodes,the current pheromones the nodes possess,the velocity of the nodes,and so on,and provide the information to the visiting nodes to update their pheromone tables by endowing the different parameters corresponding to different information and different weight values,which provides a new method to improve the congestion problem,the shortcut problem,the convergence rate and the heavy overheads commonly existed in existing ant-based routing protocols for ad-hoc networks.The performance of the algorithm is measured by the packet delivery rate,good-put ratio (routing overhead),and end-to-end delay.Simulation results show that CALRA performs well in decreasing the route overheads,balancing traffic load,as well as increasing the packet delivery rate,etc.

  7. Analysis of Ant Colony Optimization and Population-Based Evolutionary Algorithms on Dynamic Problems

    DEFF Research Database (Denmark)

    Lissovoi, Andrei

    exist more complex oscillations that cannot be tracked with a polynomial-size colony. MMAS and (μ+1) EA on Maze We analyse the behaviour of a (μ + 1) EA with genotype diversity on a dynamic fitness function Maze, extended to a finite-alphabet search space. We prove that the (μ + 1) EA is able to track...... the dynamic optimum for finite alphabets up to size μ, while MMAS is able to do so for any finite alphabet size. Parallel Evolutionary Algorithms on Maze. We prove that while a (1 + λ) EA is unable to track the optimum of the dynamic fitness function Maze for offspring population size up to λ = O(n1-ε...... analysis showing how closely the EA can track the dynamically moving optimum over time. These results are also extended to a finite-alphabet search space....

  8. A new ant colony optimization model for complex graph-based problems

    OpenAIRE

    González-Pardo, Antonio

    2014-01-01

    Tesis doctoral inédita leída en la Universidad Autónoma de Madrid. Escuela Politécnica Superior, Departamento de Ingeniería Informática. Fecha de lectura: julio de 2014 Nowadays, there is a huge number of problems that due to their complexity have employed heuristic-based algorithms to search for near-to-optimal (or even optimal) solutions. These problems are usually NP-complete, so classical algorithms are not the best candidates to address these problems because they need a larg...

  9. Recruitment Strategies and Colony Size in Ants

    OpenAIRE

    Planqué, Robert; van den Berg, Jan Bouwe; Franks, Nigel R

    2010-01-01

    Ants use a great variety of recruitment methods to forage for food or find new nests, including tandem running, group recruitment and scent trails. It has been known for some time that there is a loose correlation across many taxa between species-specific mature colony size and recruitment method. Very small colonies tend to use solitary foraging; small to medium sized colonies use tandem running or group recruitment whereas larger colonies use pheromone recruitment trails. Until now, explana...

  10. Multi-Objective Ant Colony Optimization Based on the Physarum-Inspired Mathematical Model for Bi-Objective Traveling Salesman Problems.

    Science.gov (United States)

    Zhang, Zili; Gao, Chao; Lu, Yuxiao; Liu, Yuxin; Liang, Mingxin

    2016-01-01

    Bi-objective Traveling Salesman Problem (bTSP) is an important field in the operations research, its solutions can be widely applied in the real world. Many researches of Multi-objective Ant Colony Optimization (MOACOs) have been proposed to solve bTSPs. However, most of MOACOs suffer premature convergence. This paper proposes an optimization strategy for MOACOs by optimizing the initialization of pheromone matrix with the prior knowledge of Physarum-inspired Mathematical Model (PMM). PMM can find the shortest route between two nodes based on the positive feedback mechanism. The optimized algorithms, named as iPM-MOACOs, can enhance the pheromone in the short paths and promote the search ability of ants. A series of experiments are conducted and experimental results show that the proposed strategy can achieve a better compromise solution than the original MOACOs for solving bTSPs. PMID:26751562

  11. An ant colony approach for image texture classification

    Science.gov (United States)

    Ye, Zhiwei; Zheng, Zhaobao; Ning, Xiaogang; Yu, Xin

    2005-10-01

    Ant colonies, and more generally social insect societies, are distributed systems that show a highly structured social organization in spite of the simplicity of their individuals. As a result of this swarm intelligence, ant colonies can accomplish complex tasks that far exceed the individual capacities of a single ant. As is well known that aerial image texture classification is a long-term difficult problem, which hasn't been fully solved. This paper presents an ant colony optimization methodology for image texture classification, which assigns N images into K type of clusters as clustering is viewed as a combinatorial optimization problem in the article. The algorithm has been tested on some real images and performance of this algorithm is superior to k-means algorithm. Computational simulations reveal very encouraging results in terms of the quality of solution found.

  12. An Energy Consumption Optimized Clustering Algorithm for Radar Sensor Networks Based on an Ant Colony Algorithm

    OpenAIRE

    Ting Jiang; Wei Zang; Chenglin Zhao; Jiong Shi

    2010-01-01

    We optimize the cluster structure to solve problems such as the uneven energy consumption of the radar sensor nodes and random cluster head selection in the traditional clustering routing algorithm. According to the defined cost function for clusters, we present the clustering algorithm which is based on radio-free space path loss. In addition, we propose the energy and distance pheromones based on the residual energy and aggregation of the radar sensor nodes. According to bionic heuristic a...

  13. TestAnt: an ant colony system approach to sequential testing under precedence constraints

    OpenAIRE

    Çatay, Bülent; Catay, Bulent; Özlük, Özgür; Ozluk, Ozgur; Ünlüyurt, Tonguç; Unluyurt, Tonguc

    2011-01-01

    We consider the problem of minimum cost sequential testing (diagnosis) of a series (or parallel) system under precedence constraints. We model the problem as a nonlinear integer program. We develop and implement an ant colony algorithm for the problem. We demonstrate the performance of this algorithm for special type of instances for which the optimal solutions can be found in polynomial time. In addition, we compare the performance of the ant colony algorithm with a branch and bound algorith...

  14. Ant Colony Optimization Based Modified Termite Algorithm (MTA with Efficient Stagnation Avoidance Strategy for MANETs

    Directory of Open Access Journals (Sweden)

    Sharvani G S

    2012-10-01

    Full Text Available Designing an effective load balancing algorithm is difficult due to Dynamic topology of MANET. Toaddress the problem, a load balancing routing algorithm namely Modified Termite Algorithm (MTA hasbeen developed based on ant’s food foraging behavior. Stability of the link is determined based on nodestability factor ‘’. The stability factor “ “of the node is the ratio defined between the “hello sent” and“hello replied” by a node to its neighbors. This also indicates the link stability in relation to other pathstowards the destination. A higher ratio of “” indicates that the neighbor node is more stable. Using thisconcept pheromone evaporation for the stable node is fine tuned such that if the ratio “” is more, theevaporation is slow and if “” is less the evaporation is faster. This leads to decreasing of the pheromonecontent in an optimal path which may result in congestion. These paths can be avoided using efficientevaporation technique. The MTA developed by adopting efficient pheromone evaporation technique willaddress the load balancing problems and expected to enhance the performance of the network in terms ofthroughput, and reduces End-to-end delay and Routing overheads

  15. Identification of gene knockout strategies using a hybrid of an ant colony optimization algorithm and flux balance analysis to optimize microbial strains.

    Science.gov (United States)

    Lu, Shi Jing; Salleh, Abdul Hakim Mohamed; Mohamad, Mohd Saberi; Deris, Safaai; Omatu, Sigeru; Yoshioka, Michifumi

    2014-09-28

    Reconstructions of genome-scale metabolic networks from different organisms have become popular in recent years. Metabolic engineering can simulate the reconstruction process to obtain desirable phenotypes. In previous studies, optimization algorithms have been implemented to identify the near-optimal sets of knockout genes for improving metabolite production. However, previous works contained premature convergence and the stop criteria were not clear for each case. Therefore, this study proposes an algorithm that is a hybrid of the ant colony optimization algorithm and flux balance analysis (ACOFBA) to predict near optimal sets of gene knockouts in an effort to maximize growth rates and the production of certain metabolites. Here, we present a case study that uses Baker's yeast, also known as Saccharomyces cerevisiae, as the model organism and target the rate of vanillin production for optimization. The results of this study are the growth rate of the model organism after gene deletion and a list of knockout genes. The ACOFBA algorithm was found to improve the yield of vanillin in terms of growth rate and production compared with the previous algorithms. PMID:25462325

  16. Ant Colony Search Algorithm for Solving Unit Commitment Problem

    Directory of Open Access Journals (Sweden)

    M.Surya Kalavathi

    2013-07-01

    Full Text Available In this paper Ant Colony Search Algorithm is proposed to solve thermal unit commitment problem. Ant colony search (ACS studies are inspired from the behavior of real ant colonies that are used to solve function or combinatorial optimization problems. In the ACSA a set of cooperating agents called ants cooperates to find good solution of unit commitment problem of thermal units. The UC problem is to determine a minimal cost turn-on and turn-off schedule of a set of electrical power generating units to meet a load demand while satisfying a set of operational constraints. This proposed approach is a tested on 10 unit power system and compared to conventional methods.

  17. Biobjective Optimization of Vibration Performance of Steel-Spring Floating Slab Tracks by Four-Pole Parameter Method Coupled with Ant Colony Optimization

    Directory of Open Access Journals (Sweden)

    Hao Jin

    2015-01-01

    Full Text Available Steel-spring floating slab tracks are one of the most effective methods to reduce vibrations from underground railways, which has drawn more and more attention in scientific communities. In this paper, the steel-spring floating slab track located in Track Vibration Abatement and Control Laboratory was modeled with four-pole parameter method. The influences of the fastener damping ratio, the fastener stiffness, the steel-spring damping ratio, and the steel-spring stiffness were researched for the rail displacement and the foundation acceleration. Results show that the rail displacement and the foundation acceleration will decrease with the increase of the fastener stiffness or the steel-spring damping ratio. However, the rail displacement and the foundation acceleration have the opposite variation tendency for the fastener damping ratio and the steel-spring stiffness. In order to optimize the rail displacement and the foundation acceleration affected by the fastener damping ratio and the steel-spring stiffness at the same time, a multiobjective ant colony optimization (ACO was employed. Eventually, Pareto optimal frontier of the rail displacement and the foundation acceleration was derived. Furthermore, the desirable values of the fastener damping ratio and the steel-spring stiffness can be obtained according to the corresponding Pareto optimal solution set.

  18. Application of Ant-Colony-Optimization algorithm for improved management of first flush effects in urban wastewater systems.

    Science.gov (United States)

    Verdaguer, M; Clara, N; Gutiérrez, O; Poch, M

    2014-07-01

    The first flush effect in combined sewer systems during storm events often causes overflows and overloads of the sewage treatment, which reduces the efficiency of the sewage treatment and decreases the quality of the receiving waters due to the pollutants that are contributed. The use of retention tanks constitutes a widely used way to mitigate this effect. However, the management of the pollutant loads encounters difficulties when the retention tanks are emptied. A new approach is proposed to solve this problem by fulfilling the treatment requirements in real time, focussing on the characteristics of the wastewater. The method is based on the execution of an Ant Colony Optimisation algorithm to obtain a satisfactory sequence for the discharge of the retention tanks. The discharge sequence considers the volume of stormwater and its concentration of pollutants including Suspended Solids, Biological Oxygen Demand and Chemical Oxygen Demand, Total Nitrogen and Total Phosphorus. The Ant Colony Optimisation algorithm was applied successfully to a case study with overall reduction of pollutant loads stored in retention tanks. The algorithm can be adapted in a simple way to the different scenarios, infrastructures and controllers of sewer systems. PMID:24704965

  19. Modeling of Vector Quantization Image Coding in an Ant Colony System

    Institute of Scientific and Technical Information of China (English)

    LIXia; LUOXuehui; ZHANGJihong

    2004-01-01

    Ant colony algorithm is a newly emerged stochastic searching optimization algorithm in recent years. In this paper, vector quantization image coding is modeled as a stochastic optimization problem in an Ant colony system (ACS). An appropriately adapted ant colony algorithm is proposed for vector quantization codebook design. Experimental results show that the ACS-based algorithm can produce a better codebook and the improvement of Pixel signal-to-noise ratio (PSNR) exceeds 1dB compared with the conventional LBG algorithm.

  20. Meta-heuristic ant colony optimization technique to forecast the amount of summer monsoon rainfall: skill comparison with Markov chain model

    Science.gov (United States)

    Chaudhuri, Sutapa; Goswami, Sayantika; Das, Debanjana; Middey, Anirban

    2014-05-01

    Forecasting summer monsoon rainfall with precision becomes crucial for the farmers to plan for harvesting in a country like India where the national economy is mostly based on regional agriculture. The forecast of monsoon rainfall based on artificial neural network is a well-researched problem. In the present study, the meta-heuristic ant colony optimization (ACO) technique is implemented to forecast the amount of summer monsoon rainfall for the next day over Kolkata (22.6°N, 88.4°E), India. The ACO technique belongs to swarm intelligence and simulates the decision-making processes of ant colony similar to other adaptive learning techniques. ACO technique takes inspiration from the foraging behaviour of some ant species. The ants deposit pheromone on the ground in order to mark a favourable path that should be followed by other members of the colony. A range of rainfall amount replicating the pheromone concentration is evaluated during the summer monsoon season. The maximum amount of rainfall during summer monsoon season (June—September) is observed to be within the range of 7.5-35 mm during the period from 1998 to 2007, which is in the range 4 category set by the India Meteorological Department (IMD). The result reveals that the accuracy in forecasting the amount of rainfall for the next day during the summer monsoon season using ACO technique is 95 % where as the forecast accuracy is 83 % with Markov chain model (MCM). The forecast through ACO and MCM are compared with other existing models and validated with IMD observations from 2008 to 2012.

  1. Obstacles distance analysis based on evolution ant colony optimization%进化蚁群优化理论实现障碍距离分析

    Institute of Scientific and Technical Information of China (English)

    谭新莲; 武凤翔; 陆彦辉

    2009-01-01

    借鉴了机器人路径规划问题的解决思路,将遗传算法中交叉算子引入到蚁群优化算法的路径寻优过程,提出了一种基于进化蚁群优化算法的障碍距离分析算法.实验结果表明,该方法不仅能处理复杂形状的障碍,与基于遗传算法的障碍距离计算方法相比,具有较好的路径寻优能力,并且能够很好地降低搜索陷入局部最优的可能性.%On the basis of the paper used in robet path planning problem solving ideas,and the crossover operation of genetic algorithm is used in the ant colony system for path optimization.This paper proposes a novel analyse algorithm of obstacle distance using ant colony optimization.Experimental results show that the proposed algorithm is capable of handling any complex shape obstacles and has better path planning optimization ability than genetic algorithm,and it can reduce the probability of local optimum.

  2. Application of Job- Shop Scheduling Problem Based on Ant Colony Optimization Algorithm%车间作业调度问题的仿真研究

    Institute of Scientific and Technical Information of China (English)

    赵辉; 李杰; 王振夺

    2011-01-01

    研究车间作业调度优化问题,使资源、车辆调试、交通分配等达到优化配置,因此车间作业调度问题是一个多约束条件的目标优化问题,采用多项式求解方法不能获得最优解,导致车间作业调度效率低.为了提高车间作业调度效率,提出了一种蚁群算法的车间作业调度优化算法.首先以最小加工时间作为优化目标,蚂蚁爬行路径为作业调度方案,通过蚁群中个体间互相协作和信息交流获得最优车间作业调度方案.通过车间作业调度测试案例对算法进行验证性实验,实验结果表明,蚁群算法提高了车间作业调度效率,能在最短时间找到最优调度方案,为车间作业调度优化提供了依据.%Research job shop scheduling problem and make resources optimized configuration. The job-Shop scheduling problem is a NP-hard problem, and some polynomial solutions to the problem are not the best one, leading to low efficiency workshop scheduling problem. In order to improve the efficiency of job-Shop scheduling problem , a job-Shop scheduling method was put forward based on ant colony algorithm. Taking minimize processingtime as optimal objective, ants crawling path as a job scheduling schemes, individuals collaboration and information exchanging in ant colony were carried out to obltain the optimal workshop scheduling solutions. The method was tested by job-shop scheduling problem, and the results show that the ant colony algorithm improves the efficiency, shortens the optimization time, and is effective for solving Job-Shop scheduling problem.

  3. Study on vehicle routing problem based on heuristic ant colony optimization%基于启发式蚁群算法的VRP问题研究

    Institute of Scientific and Technical Information of China (English)

    刘晓勇; 付辉

    2011-01-01

    When Ant Colony Optimization algorithm (ACO) is applied to vehicle routing problem, it always spends much time and has worse solutions.This paper uses ACO based on a heuristic method for vehicle routing problem.This heuristic method combines distance matrix with saving route matrix to assign initial pheromone matrix.Three benchmark datasets are chosen to verify performance of the new algorithm. Experiments show that ant colony optimization based on heuristic information has better solution and spends less time.%针对蚁群算法求解VRP问题时收敛速度慢,求解质量不高的缺点,把城市和仓库间的距离矩阵和路径节约矩阵信息融入到初始信息素矩阵中作为启发式信息引入到蚁群算法中用于求解有容量限制的车辆路径规划问题(CVRP),在三个基准数据集上的实验研究表明,基于启发式信息的蚁群算法与基本蚁群算法相比能够以较快的速度收敛到较好的解.

  4. A Dynamic Job Shop Scheduling Method Based on Ant Colony Coordination System

    Institute of Scientific and Technical Information of China (English)

    ZHU Qiong; WU Li-hui; ZHANG Jie

    2009-01-01

    Due to the stubborn nature of dynamic job shop scheduling problem, a novel ant colony coordination mechanism is proposed in this paper to search for an optimal schedule in dynamic environment. In ant colony coordination mechanism, the dynamic .job shop is composed of several autonomous ants. These ants coordinate with each other by simulating the ant foraging behavior of spreading pheromone on the trails, by which they can make information available globally, and further more guide ants make optimal decisions. The proposed mechanism is tested by several instances and the results confirm the validity of it.

  5. Using ant colonies for solve the multiprocessor task graph scheduling

    OpenAIRE

    Bremang, Appah

    2006-01-01

    The problem of scheduling a parallel program presented by a weighted directed acyclic graph (DAG) to the set of homogeneous processors for minimizing the completion time of the program has been extensively studied as academic optimization problem which occurs in optimizing the execution time of parallel algorithm with parallel computer.In this paper, we propose an application of the Ant Colony Optimization (ACO) to a multiprocessor scheduling problem (MPSP). In the MPSP, no preemption is allo...

  6. Optimization of fuel reloads for a BWR using the ant colony system; Optimizacion de recargas de combustible para un BWR usando el sistema de colonia de hormigas

    Energy Technology Data Exchange (ETDEWEB)

    Esquivel E, J. [Universidad Autonoma del Estado de Mexico, Facultad de Ingenieria, Cerro de Coatepec s/n, Ciudad Universitaria, 50110 Toluca, Estado de Mexico (Mexico); Ortiz S, J. J. [ININ, Carretera Mexico-Toluca s/n, 52750 Ocoyoacac, Estado de Mexico (Mexico)], e-mail: jaime.es.jaime@gmail.com

    2009-10-15

    In this work some results obtained during the development of optimization systems are presented, which are employees for the fuel reload design in a BWR. The systems use the ant colony optimization technique. As first instance, a system is developed that was adapted at travel salesman problem applied for the 32 state capitals of Mexican Republic. The purpose of this implementation is that a similarity exists with the design of fuel reload, since the two problems are of combinatorial optimization with decision variables that have similarity between both. The system was coupled to simulator SIMULATE-3, obtaining good results when being applied to an operation cycle in equilibrium for reactors of nuclear power plant of Laguna Verde. (Author)

  7. An ant colony algorithm for solving Max-cut problem

    Institute of Scientific and Technical Information of China (English)

    Lin Gao; Yan Zeng; Anguo Dong

    2008-01-01

    Max-cut problem is an NP-complete and classical combinatorial optimization problem that has a wide range of appfications in dif-ferent domains,such as bioinformatics,network optimization,statistical physics,and very large scale integration design.In this paper we investigate the capabilities of the ant colony optimization(ACO)heuristic for solving the Max-cut problem and present an AntCut algo-rithm.A large number of simulation experiments show that the algorithm can solve the Max-cut problem more efficiently and effectively.

  8. 粒子群和蚁群融合算法的自主清洁机器人路径%Particle Swarm Optimization and Ant Colony Algorithm integration of auto-cleaning robot path

    Institute of Scientific and Technical Information of China (English)

    杨惠; 李峰

    2009-01-01

    为了克服粒子群算法和蚁群算法的缺陷,将改进的粒子群算法和蚁群算法进行融合,形成了PAAA算法,并将此算法应用于自主清洁机器人行为路径的仿真实验.结果表明:PAAA在求解性能上优于粒子群算法,在时间效率上优于蚁群算法.%In order to overcome the deficiencies of particle swarm optimization and ant colony algorithm,this paper integrates the improved particle swarm optimization and ant colony algorithm,formats the PAAA,this algorithm is applied to auto-cleaning robot simulation path.The results show that:PAAA superior performance in solving particle swarm optimization,in terms of time better than the ant colony algorithm efficiency.

  9. Optimization design of missile structure based on improved ant colony algorithm%基于改进型蚁群算法的导弹结构优化设计

    Institute of Scientific and Technical Information of China (English)

    邓建军; 韩晓明; 韩小斌

    2012-01-01

    简要探讨基本蚁群算法及改进型蚁群算法的原理,分别运用蚁群算法及改进型蚁群算法对导弹结构设计实例进行了优化计算,结果表明改进型蚁群算法比基本蚁群算法具有更优的计算结果,验证了改进型蚁群算法应用于导弹结构优化设计的合理性与有效性,该算法对复杂的结构优化设计亦有一定的参考价值。%The principle of basic ant colony algorithm and improved ant colony algorithm are briefly introduced. Both of the two algorithms are applied to an example of missile structure optimization. The results show that improved ant colony algo-rithm is much better than basic ant colony algorithm, it also verified improved ant colony algorithm is effective and feasible in missile structure optimization. The algorithm has a certain reference value for the design of complex structure optimization design.

  10. Viewpoint optimization based on ant colony algorithm for volume rendering%基于蚁群算法的体绘制视点优化

    Institute of Scientific and Technical Information of China (English)

    张尤赛; 辛莉

    2013-01-01

    针对体绘制的最佳视点问题,提出了一种基于蚁群算法的体绘制视点优化方法。该方法利用信息熵的形式,构造了一种基于体数据2维投影图像的不透明度及其结构信息的视点评价函数作为视点优化的依据;在体绘制的进程中,应用蚁群算法进行视点优化,自动、智能地实现全局最佳视点的选择。实验结果表明:应用该方法进行体绘制的视点优化,具有收敛速度快、精度高和性能稳定的特点,可以显著提高体绘制的效率。%In this paper , we presented a method of viewpoint optimization using ant colony algorithm for the opti-mal viewpoint of volume rendering .Utilizing the opacity and structure features of the two-dimensional projected image of volume data , a viewpoint evaluation function was constructed in the form of information-theoretic entropy and regarded as the criterion for optimizing viewpoint .During the process of volume rendering , ant colony algo-rithm was introduced to select the optimal viewpoint automatically and intelligently .Experimental results have shown this method can increase the convergence rate , accuracy and stability in viewpoint optimization , and sig-nificantly improve the efficiency of volume rendering .

  11. 基于蚁群算法优化软件测试策略%AN OPTIMIZED SOFTWARE TESTING STRATEGY BASED ON ANT COLONY ALGORITHM

    Institute of Scientific and Technical Information of China (English)

    查日军; 张德平

    2011-01-01

    It is an essential issue to improve the fault detecting ability and reduce the testing cost of software testings in the study of software testing optimization. Based on Markov decision model for software testing, targeting at reducing the software testing cost and improving the fault detection capability of testing, the paper makes use of the ant colony algorithm to offer a learning strategy for optimizing the testing profile, and applies the acquired optimal testing profile to optimizing software tests. Experiment results show that the learning strategy that uses the ant colony algorithm is far better than the random testing strategy with respect to significantly reducing the testing cost and improving the fault detecting capability. It is an important supplementary for heuristic methods of software testing optimization.%提高软件测试的缺陷检测能力,有效降低测试成本是软件测试优化研究中的关键问题.基于软件测试的Markov决策模型,以降低软件测试成本,提高测试的缺陷检测能力为目标,运用蚁群算法给出一种优化测试剖面的学习策略,将所得到的最优测试剖面用于优化软件测试.实验结果表明运用蚁群算法的学习策略要远优于随机测试策略,能显著降低测试成本和提高缺陷检测能力,是软件测试优化启发式方法的一个重要补充.

  12. BWR Fuel Lattice Design Using an Ant Colony Model

    Energy Technology Data Exchange (ETDEWEB)

    Montes, Jose L.; Ortiz, Juan J. [Instituto Nacional de Investigaciones Nucleares, Depto. de Sistemas Nucleares, Carretera Mexico Toluca S/N. La Marquesa Ocoyoacac. 52750, Estado de Mexico (Mexico); Francois, Juan L.; Martin-del-Campo, Cecilia [Depto. de Sistemas Energeticos, Facultad de Ingenieria, Universidad Nacional Autonoma de Mexico Paseo Cuauhnahuac 8532. Jiutepec, Mor. 62550 (Mexico)

    2008-07-01

    This paper deals with one of the steps of the nuclear fuel design: the radial fuel lattice design. It can be seen as a combinatorial optimization problem for determining the optimal 2D fuel rods enrichment and gadolinia distribution. In order to solve this optimization problem, the ant colony system technique is proposed. The main idea of the ant colony approach consists of emulating the real ant colony behaviour in their searching for minimum paths between two given points, usually between the nest and a food source. In this case, the environment where the artificial ants move is the space defined by the discrete possible values of Gd{sub 2}O{sub 3} contents, the U{sup 235} enrichment, and the valid locations inside the 10x10 BWR fuel lattice array. In order to assess any candidate fuel lattice in the optimization process, the HELIOS neutronic transport code is used. The results obtained in the application of the implemented model show that the proposed technique is a powerful tool to tackle this step of the fuel design. (authors)

  13. BWR Fuel Lattice Design Using an Ant Colony Model

    International Nuclear Information System (INIS)

    This paper deals with one of the steps of the nuclear fuel design: the radial fuel lattice design. It can be seen as a combinatorial optimization problem for determining the optimal 2D fuel rods enrichment and gadolinia distribution. In order to solve this optimization problem, the ant colony system technique is proposed. The main idea of the ant colony approach consists of emulating the real ant colony behaviour in their searching for minimum paths between two given points, usually between the nest and a food source. In this case, the environment where the artificial ants move is the space defined by the discrete possible values of Gd2O3 contents, the U235 enrichment, and the valid locations inside the 10x10 BWR fuel lattice array. In order to assess any candidate fuel lattice in the optimization process, the HELIOS neutronic transport code is used. The results obtained in the application of the implemented model show that the proposed technique is a powerful tool to tackle this step of the fuel design. (authors)

  14. Hierarchical interactive ant colony optimization algorithm and its application%分层交互式蚁群优化算法及其应用

    Institute of Scientific and Technical Information of China (English)

    黄永青; 郝国生; 张俊岭; 王剑

    2012-01-01

    Conventional ant colony optimization algorithm cannot effectively solve the systems whose optimization performance indices are difficult to be quantifiable. In order to overcome this weakness, a novel Hierarchical Interactive Ant Colony Optimization (HIACO) that the objective function values of the potential solutions are determined by subjective human evaluation is proposed. The structure of a primal Interactive Ant Colony Optimization (IACO) model is designed. Appropriate pheromone update rule and the characters of pheromone in IACO are presented. The ideal of hierarchy, the chance to hierarchy and the method of hierarchy are given. The evaluation way of user is so simple that he or she only needs selecting a mostly interesting individual of current generation and not evaluating quantization of every solution. So user fatigue is reduced efficiently. IACO and HIACO are applied to car styling design. The experimental results demonstrate that the proposed algorithm has good performance.%传统蚁群优化算法在求解优化性能指标难以数量化的定性系统问题时无能为力,为此提出一种利用人对问题解进行评价的分层交互式蚁群优化算法.设计了一个基本交互式蚁群优化模型结构,讨论了信息素的更新策略和性质.给出分层的思想、分层的时机和分层的具体实现方法.算法用户参与评价时,只需指出每一代中最感兴趣的解,而不必给出每个解的具体数量值,可以极大降低用户评价疲劳.将算法应用于汽车造型设计,实验结果表明所提出算法具有较高运行性能.

  15. Community Detection on Bipartite Networks Based on Ant Colony Optimization%基于蚁群优化的二分网络社区挖掘

    Institute of Scientific and Technical Information of China (English)

    徐永成; 陈崚

    2014-01-01

    Detecting communities from networks receives much attention in recent decades, especially from bipartite networks. Detecting communities from bipartite network is very important in the research on the theory and applications of complex network analysis. This paper proposes an algorithm based on ant colony optimization for detecting community structures from bipartite networks. The algorithm firstly transforms the problem of community detection into the problem of ant colony optimization, then constructs a graph model for ants foraging. Meanwhile, this paper redefines heuristic information according the degree of vertexes. Each ant chooses its path according to the pheromone and heuristic information on each path to construct a solution. The quality of solution obtained by each ant is measured by its bipartite modularity. The experimental results show that the proposed algorithm can not only accurately identify the number of communities of a network, but also obtain higher quality of community detection.%近年来,网络社区挖掘得到了极大的关注,尤其是针对二分网络的社区挖掘。二分网络社区挖掘对于研究复杂网络有非常重要的理论意义和实用价值。提出了一个基于蚁群优化的二分网络社区挖掘算法。该算法首先将二分网络社区挖掘问题转化成一个优化问题,建立一个可供蚂蚁搜索的图模型。同时,根据顶点的拓扑结构定义启发式信息。每只蚂蚁根据每条路径上的信息素和启发式信息选择路径,构造出一个社区的划分,再用二分模块度去衡量社区划分的优劣。实验结果表明,该算法不但可以较准确地识别二分网络的社区数,而且可以获得高质量的社区划分。

  16. Solution to the problem of ant being stuck by ant colony routing algorithm

    Institute of Scientific and Technical Information of China (English)

    ZHAO Jing; TONG Wei-ming

    2009-01-01

    Many ant colony routing (ACR) algorithms have been presented in recent years, but few have studied the problem that ants will get stuck with probability in any terminal host when they are searching paths to route packets around a network. The problem has to be faced when designing and implementing the ACR algorithm. This article analyzes in detail the differences between the ACR and the ant colony optimization (ACO). Besides, particular restrictions on the ACR are pointed out and the three causes of ant being-stuck problem are obtained. Furthermore, this article proposes a new ant searching mechanism through dual path-checking and online routing loop removing by every intermediate node an ant visited and the destination host respectively, to solve the problem of ant being stuck and routing loop simultaneously. The result of numerical simulation is abstracted from one real network. Compared with existing two typical ACR algorithms, it shows that the proposed algorithm can settle the problem of ant being stuck and achieve more effective searching outcome for optimization path.

  17. Ant Colony Optimisation for Backward Production Scheduling

    Directory of Open Access Journals (Sweden)

    Leandro Pereira dos Santos

    2012-01-01

    Full Text Available The main objective of a production scheduling system is to assign tasks (orders or jobs to resources and sequence them as efficiently and economically (optimised as possible. Achieving this goal is a difficult task in complex environment where capacity is usually limited. In these scenarios, finding an optimal solution—if possible—demands a large amount of computer time. For this reason, in many cases, a good solution that is quickly found is preferred. In such situations, the use of metaheuristics is an appropriate strategy. In these last two decades, some out-of-the-shelf systems have been developed using such techniques. This paper presents and analyses the development of a shop-floor scheduling system that uses ant colony optimisation (ACO in a backward scheduling problem in a manufacturing scenario with single-stage processing, parallel resources, and flexible routings. This scenario was found in a large food industry where the corresponding author worked as consultant for more than a year. This work demonstrates the applicability of this artificial intelligence technique. In fact, ACO proved to be as efficient as branch-and-bound, however, executing much faster.

  18. Classification of anti hepatitis peptides using Support Vector Machine with hybrid Ant Colony OptimizationThe Luxembourg database of trichothecene type B F. graminearum and F. culmorum producers.

    Science.gov (United States)

    Mishra, Gunjan; Ananth, Vivek; Shelke, Kalpesh; Sehgal, Deepak; Deepak, Jayaraman

    2016-01-01

    Hepatitis is an emerging global threat to public health due to associated mortality, morbidity, cancer and HIV co-infection. Available diagnostics and therapeutics are inadequate to intercept the course and transmission of the disease. Antimicrobial peptides (AMP) are widely studied and broad-spectrum host defense peptides are investigated as a targeted anti-viral. Therefore, it is of interest to describe the supervised identification of anti-hepatitis peptides. We used a hybrid Support Vector Machine (SVM) with Ant Colony Optimization (ACO) algorithm for simultaneous classification and domain feature selection. The described model shows a 10 fold cross-validation accuracy of 94 percent. This is a reliable and a useful tool for the prediction and identification of hepatitis specific drug activity. PMID:27212838

  19. Hybrid Ant Colony Optimization for Real-World Delivery Problems Based on Real Time and Predicted Traffic in Wide Area Road Network

    Directory of Open Access Journals (Sweden)

    Junichi Ochiai

    2014-02-01

    Full Text Available This paper presents a solution to real-world delive ry problems for home delivery services where a large number of roads exist in cities and the tra ffic on the roads rapidly changes with time. The methodology for finding the shortest-travel-tim e tour includes a hybrid meta-heuristic that combines ant colony optimization with Dijkstra’s al gorithm, a search technique that uses both real-time traffic and predicted traffic, and a way to use a real-world road map and measured traffic in Japan. Experimental results using a map of central Tokyo and historical traffic data indicate that the proposed method can find a better solution than conventional methods.

  20. Polyethism in a colony of artificial ants

    CERN Document Server

    Marriott, Chris

    2011-01-01

    We explore self-organizing strategies for role assignment in a foraging task carried out by a colony of artificial agents. Our strategies are inspired by various mechanisms of division of labor (polyethism) observed in eusocial insects like ants, termites, or bees. Specifically we instantiate models of caste polyethism and age or temporal polyethism to evaluated the benefits to foraging in a dynamic environment. Our experiment is directly related to the exploration/exploitation trade of in machine learning.

  1. 基于蚁群优化的ESP控制算法仿真%Simulation of ant colony optimization-based ESP algorithm

    Institute of Scientific and Technical Information of China (English)

    信瑛南; 张新; 曾志伟

    2012-01-01

    In order to accelerate the ESP system response time,improve the stability of the vehicle,this paper adopts fuzzy control theory to make feedback control of the ESP system.Four wheels vehicle model with eight degrees of freedom and Gim tire model are established,and in the good flexibility,robustness of fuzzy PID controller is introduced based on the ant colony algorithm,the design based on ant colony optimization of fuzzy PID control system structure and its calculation method,so as to achieve parameters optimization design,then a simulation model generated by Simulink software is used.Simulation experiment proves that this method can accelerate the speed of convergence system and shorten the system response time.%为了加快ESP系统的响应时间,提高车辆的稳定性,采用模糊控制理论对车辆ESP系统进行反馈控制.建立了八自由度四轮整车模型与Gim轮胎模型,并在具有较好的灵活性、鲁棒性的模糊PID控制器的基础上引入了蚁群算法,设计了基于蚁群优化的模糊PID控制系统的结构与计算方法,从而达到对参数kp,ki,kd的优化设计,同时利用Simulink软件进行仿真.仿真结果证明,引入蚁群算法的模糊PID控制系统可加快系统的收敛速度,缩短系统响应时间.

  2. Design of broadband omnidirectional antireflection coatings using ant colony algorithm.

    Science.gov (United States)

    Guo, X; Zhou, H Y; Guo, S; Luan, X X; Cui, W K; Ma, Y F; Shi, L

    2014-06-30

    Optimization method which is based on the ant colony algorithm (ACA) is described to optimize antireflection (AR) coating system with broadband omnidirectional characteristics for silicon solar cells incorporated with the solar spectrum (AM1.5 radiation). It's the first time to use ACA method for optimizing the AR coating system. In this paper, for the wavelength range from 400 nm to 1100 nm, the optimized three-layer AR coating system could provide an average reflectance of 2.98% for incident angles from Raveθ+ to 80° and 6.56% for incident angles from 0° to 90°. PMID:24978076

  3. Web Mining using Artificial Ant Colonies: A Survey

    OpenAIRE

    2014-01-01

    Web mining has been very crucial to any organization as it provides useful insights to business patterns. It helps the company to understand its customers better. As the web is growing in pace, so is its importance and hence it becomes all the more necessary to find useful patterns. Here in this paper, web mining using ant colony optimization has been reviewed with some of its experimental results.

  4. Predicting Multicomponent Protein Assemblies Using an Ant Colony Approach

    OpenAIRE

    Venkatraman, Vishwesh; Ritchie, David

    2011-01-01

    National audience Biological processes are often governed by functional modules of large protein assemblies such as the proteasomes and the nuclear pore complex, for example. However, atomic structures can be determined experimentally only for a small fraction of these multicomponent assemblies. In this article, we present an ant colony optimization based approach to predict the structure of large multicomponent complexes. Starting with pair-wise docking predictions, a multigraph consistin...

  5. Ant larval demand reduces aphid colony growth rates in an ant-aphid interaction

    OpenAIRE

    Cook, James M.; Leather, Simon R; Oliver, Tom H.

    2012-01-01

    Ants often form mutualistic interactions with aphids, soliciting honeydew in return for protective services. Under certain circumstances, however, ants will prey upon aphids. In addition, in the presence of ants aphids may increase the quantity or quality of honeydew produced, which is costly. Through these mechanisms, ant attendance can reduce aphid colony growth rates. However, it is unknown whether demand from within the ant colony can affect the ant-aphid interaction. In a factorial exper...

  6. Apply Ant Colony Algorithm to Search All Extreme Points of Function

    OpenAIRE

    Pang, Chao-Yang; Liu, Hui; Li, Xia; Wang, Yun-fei; Hu, Ben-Qiong

    2009-01-01

    To find all extreme points of multimodal functions is called extremum problem, which is a well known difficult issue in optimization fields. Applying ant colony optimization (ACO) to solve this problem is rarely reported. The method of applying ACO to solve extremum problem is explored in this paper. Experiment shows that the solution error of the method presented in this paper is less than 10^-8. keywords: Extremum Problem; Ant Colony Optimization (ACO)

  7. A Bayesian Network Learning Algorithm Based on Independence Test and Ant Colony Optimization%一种基于独立性测试和蚁群优化的贝叶斯网学习算法

    Institute of Scientific and Technical Information of China (English)

    冀俊忠; 张鸿勋; 胡仁兵; 刘椿年

    2009-01-01

    To solve the drawbacks of the ant colony optimization for learning Bayesian networks (ACO-B), this paper proposes an improved algorithm based on the conditional independence test and ant colony optimization (I-ACO-B). First, the I-ACO-B uses order-0 independence tests to effectively restrict the space of candidate solutions, so that many unnecessary searches of ants can be avoided. And then, by combining the global score increase of a solution and local mutual information between nodes, a new heuristic function with better heuristic ability is given to induct the process of stochastic searches. The experimental results on the benchmark data sets show that the new algorithm is effective and efficient in large scale databases, and greatly enhances convergence speed compared to the original algorithm.

  8. Enhanced Bee Colony Algorithm for Complex Optimization Problems

    OpenAIRE

    S.Suriya; R. Deepalakshmi; S.Suresh kannan; Dr.S.P.SHANTHARAJAH

    2012-01-01

    Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithmsavailable to solve optimization problems namely: Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, etc. The basic Bee Colony algorithm, a population based search algorithm, is analyzed to be a novel tool for complex optimization problems. The algorithm mimics the food fo...

  9. Advances on image interpolation based on ant colony algorithm.

    Science.gov (United States)

    Rukundo, Olivier; Cao, Hanqiang

    2016-01-01

    This paper presents an advance on image interpolation based on ant colony algorithm (AACA) for high resolution image scaling. The difference between the proposed algorithm and the previously proposed optimization of bilinear interpolation based on ant colony algorithm (OBACA) is that AACA uses global weighting, whereas OBACA uses local weighting scheme. The strength of the proposed global weighting of AACA algorithm depends on employing solely the pheromone matrix information present on any group of four adjacent pixels to decide which case deserves a maximum global weight value or not. Experimental results are further provided to show the higher performance of the proposed AACA algorithm with reference to the algorithms mentioned in this paper. PMID:27047729

  10. Improved Ant Colony Clustering Algorithm and Its Performance Study

    OpenAIRE

    Wei Gao

    2015-01-01

    Clustering analysis is used in many disciplines and applications; it is an important tool that descriptively identifies homogeneous groups of objects based on attribute values. The ant colony clustering algorithm is a swarm-intelligent method used for clustering problems that is inspired by the behavior of ant colonies that cluster their corpses and sort their larvae. A new abstraction ant colony clustering algorithm using a data combination mechanism is proposed to improve the computational ...

  11. An Improved Ant Colony Routing Algorithm for WSNs

    OpenAIRE

    Tan Zhi; Zhang Hui

    2015-01-01

    Ant colony algorithm is a classical routing algorithm. And it are used in a variety of application because it is economic and self-organized. However, the routing algorithm will expend huge amounts of energy at the beginning. In the paper, based on the idea of Dijkstra algorithm, the improved ant colony algorithm was proposed to balance the energy consumption of networks. Through simulation and comparison with basic ant colony algorithms, it is obvious that improved algorithm can effectively...

  12. Ant Colony Optimization Control in VAV System%蚁群优化控制在变风量空调系统中的应用

    Institute of Scientific and Technical Information of China (English)

    朱栋华; 李肇蕙; 田晓曦

    2012-01-01

    目的 寻找一种有效地解决系统惯性大、时间滞后及单独采用PID控制器产生效果不佳的方法,实现温度参量的优化控制.方法 根据变风量空调系统的结构,对变风量系统室内温度控制环节采用蚁群优化算法,经过Matlab软件进行仿真,使室内温度控制环节的上升时间、超调量及调整时间得以优化.结果 控制环节优化前PID阶跃响应的动态指标为:上升时间tr=50 s,调整时间ts=276 s,超调量σ=30%;经过蚁群优化的PID阶跃响应的动态指标为:上升时间tr=112.5 s,调整时间ts=88 s,超调量σ=3.5%,上升时间相对增加后调整时间和超调量大幅度减小,室内温度控制环节趋于稳定.结论 蚁群算法改善了控制环节的超调量、调整时间等问题,提高了系统的自适应性,保证了系统的稳定性和准确性.%Looking for a solution which could effectively solve the system's inertia,time lag and poor results that were produced by VAV system using PID controller alone, achieving temperature parameter optimization control. According to the VAV air conditioning system's structure,the ant colony algorithm is applied to the indoor temperature control link of the system along with using Matlab simulation software simulating in order to rise time, overshoot and adustment time can be optimized about the indoor temperature control link. And then,the dynamic indictors before PID step response of the control link optimization is,the rise time tr = 50 s,adustment time ts = 276 s,overshoot σ =30% ;dynamic indictors of PID step response for the ant colony algorithm,rise time tr = 112. 5 s,adustment time ts = 88 s,overshoot σ = 3. 5% . After the rise time increased relatively, adjustment time and overshoot reduced drastically, and the link of indoor temperature control has been stabilized. Therefore, Ant colony optimization algorithm can be further applied to the control aspect of the whole system,improving the self

  13. 基于粒子群-蚁群融合算法的移动机器人路径优化规划%The Optimal Path Planning for Mobile Robot Based on Ant Colony Algorithm Combined with Particle Swarm Optimization

    Institute of Scientific and Technical Information of China (English)

    张兴国; 周东健; 李成浩

    2014-01-01

    Aiming at the TSP problem,in order to research the optimal path planning for mobile robot,a new algo-rithm based on ant colony algorithm combined with particle swarm algorithm( PAAAA)has been proposed. Firstly, using the particle swarm optimization to search the global path,the second best solution is obtained. Then,after dis-tributing the pheromones on the second best solution paths,using ant colony algorithm to finish accurate searching. Last,the optimal solution of path planning is achieved. The simulation result shows that PAAA is better than single ant colony algorithm or single particle swarm optimization.%基于TSP问题,提出了一种基于粒子群-蚁群算法相互融合的综合优化算法对移动机器人路径规划问题进行研究。通过粒子群算法对全局路径实施粗略搜索,获得部分次优解,在获得次优解的路径上进行信息素分布,再采用蚁群算法进行精确搜索,得到路径规划的最优解。实验结果表明:粒子群-蚁群融合优化算法在路径寻优上优于蚁群算法及粒子群算法。

  14. Improved Ant Colony Clustering Algorithm and Its Performance Study.

    Science.gov (United States)

    Gao, Wei

    2016-01-01

    Clustering analysis is used in many disciplines and applications; it is an important tool that descriptively identifies homogeneous groups of objects based on attribute values. The ant colony clustering algorithm is a swarm-intelligent method used for clustering problems that is inspired by the behavior of ant colonies that cluster their corpses and sort their larvae. A new abstraction ant colony clustering algorithm using a data combination mechanism is proposed to improve the computational efficiency and accuracy of the ant colony clustering algorithm. The abstraction ant colony clustering algorithm is used to cluster benchmark problems, and its performance is compared with the ant colony clustering algorithm and other methods used in existing literature. Based on similar computational difficulties and complexities, the results show that the abstraction ant colony clustering algorithm produces results that are not only more accurate but also more efficiently determined than the ant colony clustering algorithm and the other methods. Thus, the abstraction ant colony clustering algorithm can be used for efficient multivariate data clustering. PMID:26839533

  15. Ant Colony Optimization as a Powerful Tool for Descriptor Selection in QSPR Study of Infinite Dilution Activity Coefficients of Halogenated Hydrocarbons in Water

    Institute of Scientific and Technical Information of China (English)

    Morteza Atabati

    2012-01-01

    A quantitative structure-property relationship (QSPR) study was suggested for the prediction of infinite dilution activity coefficients of halogenated hydrocarbons, γ∞ , in water at 298.15 K. After optimization of 3D geometry of the halogenated hydrocarbons with semi-empirical quantum chemical calculations at the AM1 level, different descriptors (1514 descriptors) were calculated by the HyperChem and Dragon softwares. A major problem of QSPR is the high dimensionality of the descriptor space; therefore, descriptor selection is the most important step. In this paper, an ant colony optimization (ACO) algorithm was proposed to select the best descriptors. Then the selected descriptors were applied for model development using multiple linear regression. The average absolute relative deviation and correlation coefficient for the training set were obtained as 4.36% and 0.951, respectively, while the corresponding values for the test set were 5.96% and 0.929, respectively. The results showed that the applied procedure is suitable for the prediction of γ∞ of halogenated hydrocarbons in water.

  16. Nest- and colony-mate recognition in polydomous colonies of meat ants ( Iridomyrmex purpureus)

    Science.gov (United States)

    van Wilgenburg, E.; Ryan, D.; Morrison, P.; Marriott, P. J.; Elgar, M. A.

    2006-07-01

    Workers of polydomous colonies of social insects must recognize not only colony-mates residing in the same nest but also those living in other nests. We investigated the impact of a decentralized colony structure on colony- and nestmate recognition in the polydomous Australian meat ant ( Iridomyrmex purpureus). Field experiments showed that ants of colonies with many nests were less aggressive toward alien conspecifics than those of colonies with few nests. In addition, while meat ants were almost never aggressive toward nestmates, they were frequently aggressive when confronted with an individual from a different nest within the same colony. Our chemical analysis of the cuticular hydrocarbons of workers using a novel comprehensive two-dimensional gas chromatography technique that increases the number of quantifiable compounds revealed both colony- and nest-specific patterns. Combined, these data indicate an incomplete transfer of colony odor between the nests of polydomous meat ant colonies.

  17. A Method for Mounting Elevator Guide Rail with Ant Colony Optimization%基于蚁群算法的电梯导轨选择装配

    Institute of Scientific and Technical Information of China (English)

    叶小丽; 刘向勇; 何展翅

    2013-01-01

    The elevator ride comfort greatly depends on the quality of elevator guide rail mounting. The standard rail length is 5 m, the clearance size will affect the rail between the elevator car vibration level. How to choose the assembly guide rail, so that the clearance between the guide rails is uniformity and meets the requirements of national standards, this is a very important topic. The method of assembly guide with an ant colony algorithm based computer assisted selection can well solve the problem. Ant Colony ptimization (ACO) is a novel simulated evolutionary algorithm based on population, belongs to random search algorithm. In order to optimize the track, the mathematical model is put forward, the comprehensive index of assembly quality is the optimization goal. This method is the manufacturers allocate basis before packaging. The actual project application verifies the effectiveness of the proposed method.%电梯运行的舒适度很大程度上取决于电梯导轨安装质量,由于标准导轨长度为5 m,因此导轨间的配合间隙大小就会影响电梯轿厢运行过程的振动程度。如何进行选择装配导轨,以使导轨间的间隙均匀且满足国标要求,是一个非常重要的课题。提出一种基于蚁群算法的计算机辅助选择装配导轨的方法,能够很好地解决该问题。蚁群算法(ACO)是一种新型的基于种群的模拟进化算法,属于随机搜索算法。为了对各导轨进行组合优化,提出一个以装配质量综合指标为优化目标的数学模型,作为厂家在包装之前的调配依据。通过实际项目应用,验证了该方法的实效性。

  18. Application of Ant Colony Algorithm in the Optimization Model of Land Use Structure%蚁群算法在土地利用结构优化模型中的应用

    Institute of Scientific and Technical Information of China (English)

    李明

    2011-01-01

    将蚁群优化算法引入土地资源规划,构建基于蚁群算法的资源规划数学模型,克服了传统优化模型的缺陷,选择张家口地区进行实证分析,得出了该地区最佳的土地利用结构优化方案.%This paper introduces the ant colony optimization into the land resources planning, constructs a mathematic model of resources planning based on the ant colony algorithm, overcomes the shortcomings of traditional optimization model, conducts an empirical analysis of Zhangjiakou region, and proposes the best optimization model of land use structure.

  19. A Novel Algorithm for Manets using Ant Colony

    Directory of Open Access Journals (Sweden)

    Javad Pashaei Barbin

    2012-01-01

    Full Text Available Mobile Ad-hoc Networks have recently attracted a lot of attention in the research community as well as the industry. Quality of Service support for MANETs is an exigent task due to dynamic topology and limited resource. Routing, the act of moving information across network from a source to a destination. Conventional routing algorithms are difficult to be applied to a dynamic network topology, therefore modeling and design an efficient routing protocol in such dynamic networks is an important issue. It is important that MANETs should provide QoS support routing, such as acceptable delay, jitter and energy in the case of multimedia and real time applications. One of the meta-heuristic algorithms which are inspired by the behavior of real ants is called Ant Colony Optimization algorithm. In this paper we propose a new on demand QoS routing algorithm "Ant Routing for Mobile Ad Hoc Networks" based on ant colony. The proposed algorithm will be highly adaptive, efficient and scalable and mainly reduces end-to-end delay in high mobility cases.

  20. M ultiple ant colony cooperative evolution for optimization of taxiw ay scheduling%多蚁群协同进化的滑行道调度优化

    Institute of Scientific and Technical Information of China (English)

    冯兴杰; 杜姗姗

    2015-01-01

    针对当前机场滑行道调度效率较低的问题,提出一种基于协同进化的多蚁群算法。利用蚁群算法在解决复杂的组合优化问题方面的显著优势,在种群内部搜索滑行时间短且没有冲突的路径,在种群间利用蚁群算法良好的协同能力同时进行多个航班的调度,解决滑行的路径搜索问题,实现调度顺序的优化调整。冲突解决是解决滑行道调度问题的关键,采用基于两段锁的思想解决冲突。利用公共数据集对该算法进行验证,实验结果表明了该算法的有效性。%Aiming at the inefficiency problem of taxiway scheduling ,a multiple ant colony algorithm based on cooperative evolu‐tion was proposed .The ant colony algorithm (ACA) is good at solving the complex combinatorial optimization problem .Taking advantage of this feature ,ACA was used for searching routes with the short slide time and without conflicts inside the popula‐tion .Meanwhile ,among the populations ,the good synergy of ACA was used for scheduling of multiple flights simultaneously , which not only solved the problem of path search ,but achieved the adjustments of scheduling order .Conflict resolution is the key to solving the taxiway scheduling problems ,which was resolved with a solution based on two‐phase locking .Finally ,the algo‐rithm was validated by using the public data sets .The experimental results show that the algorithm is effective .

  1. 基于蚁群算法的贝叶斯网结构学习%Learning Bayesian Network Structure Based on Ant Colony Optimization Algorithms

    Institute of Scientific and Technical Information of China (English)

    冀俊忠; 张鸿勋; 胡仁兵; 刘椿年

    2011-01-01

    To learn Bayesian Network (BN) structure from incomplete data, this paper proposed an approach combined with both processes of data completing and Ant Colony Optimization (ACO). First, unobserved data are randomly initialized, thus a complete data is got. Based on such a data set, an initialization BN is learned by Ant Colony Algorithm. Second, in light of the current best structure of evolutionary process, Expectation Maximization (EM)estimating and randomly sampling are performed to complete the data. Third, on the basis of the new complete data set, the BN structure is evolved by an improved ACO process. Finally, the second and third steps are iterated until the global best structure is obtained. Experimental results show the approach can effectively learn BN structure form incomplete data, and is more accurate than MS-EM 、EGA 、BN-GS algorithms.%针对具有丢失数据的贝叶斯网结构学习问题,提出了一种将数据的完备化与结构的蚁群优化相结合的学习方法.随机初始化未观察到的数据,得到完整的数据集,并利用蚁群算法学习得到初始网络结构;然后进行迭代学习,在每次迭代中根据当前最好的贝叶斯网结构,利用EM估计和随机的采样插入对数据进行完备化,在完备数据下,利用改进的蚁群优化过程使结构不断进化,直到获得全局最优解.实验结果表明,该方法能有效地从不完备数据中学习贝叶斯网结构且与新近的MS-EM、EGA、BN-GS方法相比,具有更高的学习精度.

  2. A hybrid of ant colony optimization and minimization of metabolic adjustment to improve the production of succinic acid in Escherichia coli.

    Science.gov (United States)

    Chong, Shiue Kee; Mohamad, Mohd Saberi; Mohamed Salleh, Abdul Hakim; Choon, Yee Wen; Chong, Chuii Khim; Deris, Safaai

    2014-06-01

    This paper presents a study on gene knockout strategies to identify candidate genes to be knocked out for improving the production of succinic acid in Escherichia coli. Succinic acid is widely used as a precursor for many chemicals, for example production of antibiotics, therapeutic proteins and food. However, the chemical syntheses of succinic acid using the traditional methods usually result in the production that is far below their theoretical maximums. In silico gene knockout strategies are commonly implemented to delete the gene in E. coli to overcome this problem. In this paper, a hybrid of Ant Colony Optimization (ACO) and Minimization of Metabolic Adjustment (MoMA) is proposed to identify gene knockout strategies to improve the production of succinic acid in E. coli. As a result, the hybrid algorithm generated a list of knockout genes, succinic acid production rate and growth rate for E. coli after gene knockout. The results of the hybrid algorithm were compared with the previous methods, OptKnock and MOMAKnock. It was found that the hybrid algorithm performed better than OptKnock and MOMAKnock in terms of the production rate. The information from the results produced from the hybrid algorithm can be used in wet laboratory experiments to increase the production of succinic acid in E. coli. PMID:24763079

  3. Bionic cutter of cutter suction dredger with ant colony optimization%绞吸式挖泥船仿生绞刀刀齿的蚁群优化

    Institute of Scientific and Technical Information of China (English)

    穆乃超; 许焕敏; 邬同舟

    2014-01-01

    为了提高绞吸式挖泥船仿生绞刀减粘降阻的效果,获得更高的生产效率和经济效益,应用蚁群算法对仿生绞刀的凸包的几何尺寸及其分布进行优化,得到对于不同类型的土壤和在一定的压力范围内所需的凸包形仿生绞刀的结构尺寸。%In order to reduce the adhesion and friction of soil, the effect of the adhesion and resistance, and gain higher productivity and economic efficiency. The application of ant colony algorithm for bionic cutter geometry and distribution of the convex hull is optimized to obtain the desired convex hull-shaped cutter biomimetic structure within different types of soil and a certain pressure range.

  4. Multi-objective Numeric Association Rules Mining via Ant Colony Optimization for Continuous Domains without Specifying Minimum Support and Minimum Confidence

    Directory of Open Access Journals (Sweden)

    Parisa Moslehi

    2011-09-01

    Full Text Available Currently, all search algorithms which use discretization of numeric attributes for numeric association rule mining, work in the way that the original distribution of the numeric attributes will be lost. This issue leads to loss of information, so that the association rules which are generated through this process are not precise and accurate. Based on this fact, algorithms which can natively handle numeric attributes would be interesting. Since association rule mining can be considered as a multi-objective problem, rather than a single objective one, a new multi-objective algorithm for numeric association rule mining is presented in this paper, using Ant Colony Optimization for Continuous domains (ACOR. This algorithm mines numeric association rules without any need to specify minimum support and minimum confidence, in one step. In order to do this we modified ACOR for generating rules. The results show that we have more precise and accurate rules after applying this algorithm and the number of rules is more than the ones resulted from previous works.

  5. Simultaneous partial topology and size optimization of a wing structure using ant colony and gradient based methods

    OpenAIRE

    Wang, W.; Guo, Shijun J.; Yang, W.

    2011-01-01

    This article presents a methodology and process for a combined wing configuration partial topology and structure size optimization. It is aimed at achieving a minimum structural weight by optimizing the structure layout and structural component size simultaneously. This design optimization process contains two types of design variables and hence was divided into two sub- problems. One is structure layout topology to obtain an optimal number and location of spars with discret...

  6. Remote Sensing Image Feature Extracting Based Multiple Ant Colonies Cooperation

    Directory of Open Access Journals (Sweden)

    Zhang Zhi-long

    2014-02-01

    Full Text Available This paper presents a novel feature extraction method for remote sensing imagery based on the cooperation of multiple ant colonies. First, multiresolution expression of the input remote sensing imagery is created, and two different ant colonies are spread on different resolution images. The ant colony in the low-resolution image uses phase congruency as the inspiration information, whereas that in the high-resolution image uses gradient magnitude. The two ant colonies cooperate to detect features in the image by sharing the same pheromone matrix. Finally, the image features are extracted on the basis of the pheromone matrix threshold. Because a substantial amount of information in the input image is used as inspiration information of the ant colonies, the proposed method shows higher intelligence and acquires more complete and meaningful image features than those of other simple edge detectors.

  7. 改进蚁群算法求解多目标雷达干扰资源优化分配%Improved Ant Colony Algorithm to Solve Multi-objective Optimization of Radar Interference Resource Distribution

    Institute of Scientific and Technical Information of China (English)

    何凡; 祁世民; 谢贵武; 吴桐

    2014-01-01

    Ant colony algorithm is a population intelligent optimization algorithm,and its theory is based on the nature of the ant search for make. For surface-to-air multi-target radar jamming system in actual combat target more cases of interference resource allocation problem, and a model of distribution optimization based on ant colony algorithm is put forward,to solve the traditional ant colony algorithm optimization speed slow,easy to fall into local optimal solutions,such as faults,in the ant routing strategy,pheromone volatilization,pheromone updating and elite reservation etc. The corresponding improvement strategy is put forward, the concrete realization steps of the improved algorithm is given,finally cite the actual case,through the simulation experiment,the superiority of the algorithm is proved.%蚁群算法是一种群智能优化算法,其理论来源于自然界中蚂蚁群的寻径行为。针对地对空多目标雷达干扰系统在实战中目标较多情况下的干扰资源分配问题,提出了一种基于蚁群算法的分配优化模型,为解决传统蚁群算法寻优速度慢,容易陷入局部最优解等缺点,在蚂蚁路径选择策略、信息素挥发、信息素更新和精英保留等方面提出相应改进策略,给出改进后算法的具体实现步骤,最后举出实际算例,通过仿真实验,证明了算法的优越性。

  8. JOB SHOP METHODOLOGY BASED ON AN ANT COLONY

    Directory of Open Access Journals (Sweden)

    OMAR CASTRILLON

    2009-01-01

    Full Text Available The purpose of this study is to reduce the total process time (Makespan and to increase the machines working time, in a job shop environment, using a heuristic based on ant colony optimization. This work is developed in two phases: The first stage describes the identification and definition of heuristics for the sequential processes in the job shop. The second stage shows the effectiveness of the system in the traditional programming of production. A good solution, with 99% efficiency is found using this technique.

  9. 基于改进ACO与PSO算法的结构可靠度分析%Structural reliability analysis based on the improved ant colony algorithm and particle swarm optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    李彦苍; 恒北北; 彭双红; 程秋月; 伴晨光

    2012-01-01

    针对基本蚁群算法的过早收敛问题,引入信息熵,通过优化参数,对基本蚁群算法进行改进,进而寻找结构的最短失效路径.从可靠指标的几何意义出发,利用罚函数法,将结构可靠指标的求解问题转化成相应的无约束优化问题,采用粒子群算法对结构可靠指标进行求解计算.以十杆桁架为例,采用响应面法、遗传算法与本算法对结构可靠指标进行对比计算,结果表明改进蚁群与粒子群算法的收敛速度快,计算精度高.%In view of the premature convergence problem of the basic Ant Colony Optimization Algorithm , the basic ant colony algorithm was improved through the introduction of information entropy and the improvement of parameter T , and the improved ant colony algorithm was used to find the structure of the weakest failure path. On the basis of the geometrical meaning of structural reliability index, the problem of structural reliability index was converted to the corresponding unconstrained optimization problem by use of the penalty function method, and then the Particle Swarm Optimization algorithm was used to calculate the structural reliability index. Taking 10 -bar truss for example, its reliability index calculation was compared respectively by means of response surface method, the improved genetic algorithm and this algorithm, it is concluded that particle swarm algorithm and ant colony algorithm has high convergent rapid and high precision for solving reliability index.

  10. Optimization of travel salesman problem using the ant colony system and Greedy search; Optimizacion del problema del agente viajero usando el sistema de colonia de hormigas y busqueda Greedy

    Energy Technology Data Exchange (ETDEWEB)

    Esquivel E, J.; Ordonez A, A. [Universidad Autonoma del Estado de Mexico, Facultad de Ingenieria, Cerro de Coatepec s/n, Toluca, Estado de Mexico (Mexico); Ortiz S, J. J. [Departamento de Sistemas Nucleares, ININ, Carretera Mexico-Toluca s/n, Ocoyoacac 52750, Estado de Mexico (Mexico)

    2008-07-01

    In this paper we present some results obtained during the development of optimization systems that can be used to design refueling and patterns of control rods in a BWR. These systems use ant colonies and Greedy search. The first phase of this project is to be familiar with these optimization techniques applied to the problem of travel salesman problem (TSP). The utility of TSP study is that, like the refueling design and pattern design of control rods are problems of combinative optimization. Even, the similarity with the problem of the refueling design is remarkable. It is presented some results for the TSP with the 32 state capitals of Mexico country. (Author)

  11. The Comparison between Adaptive Approach and Max-min Ant Colony Algorithm for Logistics Vehicle Routing Optimization%自适应和最大最小蚁群算法的物流车辆路径优化比较

    Institute of Scientific and Technical Information of China (English)

    陈昌敏; 谢维成; 范颂颂

    2011-01-01

    Aiming at the drawbacks of slow convergence speed and being easy to fall into local optimal point for basic ant colony algorithm in logistics vehicle routing optimization issue, this paper adopted an adaptive ant colony algorithm and the max-min ant colony algorithm to overcome the basic ant colony' s shortcomings.The analysis and comparison for the two algorithms were conducted,and the simulation of vehicle routing optimization in Matlab environment using adaptive and max-min ant colony algorithm was performed as well.Experimental results show that the max-min ant colony algorithm is better than adaptive ant colony algorithm in convergence speed and shortest path search, so max-min ant colony algorithm is superior to adaptive ant colony algorithm for logistics vehicle routing optimization.%针对物流车辆路径优化问题,考虑到基本蚁群算法有收敛速度慢、易陷入局部最优的缺点,采用了自适应蚁群算法和最大最小蚁群算法进行车辆路径优化,分析、比较了这两种算法的不同并在Matlab上做了仿真.仿真实验结果显示自适应蚁群算法在收敛速度和寻找最短路径上都略逊于最大最小蚁群算法,最大最小蚁群算法在物流车辆路径优化上优于适应蚁群算法.

  12. Text clustering based on fusion of ant colony and genetic algorithms

    Institute of Scientific and Technical Information of China (English)

    Yun ZHANG; Boqin FENG; Shouqiang MA; Lianmeng LIU

    2009-01-01

    Focusing on the problem that the ant colony algorithm gets into stagnation easily and cannot fully search in solution space,a text clustering approach based on the fusion of the ant colony and genetic algorithms is proposed.The four parameters that influence the performance of the ant colony algorithm are encoded as chromosomes,thereby the fitness function,selection,crossover and mutation operator are designed to find the combination of optimal parameters through a number of iteration,and then it is applied to text clustering.The simulation.results show that compared with the classical k-means clustering and the basic ant colony clustering algorithm,the proposed algorithm has better performance and the value of F-Measure is enhanced by 5.69%,48.60% and 69.60%,respectively,in 3 test datasets.Therefore,it is more suitable for processing a larger dataset.

  13. 改进遗传蚁群算法及其在电机结构优化中的研究%Improved genetic ant colony algorithm and research on motor structure optimization

    Institute of Scientific and Technical Information of China (English)

    谢颖; 李吉兴; 杨忠学; 张岩

    2015-01-01

    To optimize the structural parameters of the 4-pole 7. 5 kW line-start permanent magnet synchro-nous motor, an improved binary genetic ant colony algorithm which combined the advantages of genetic al-gorithm with ant colony algorithm and solved the problem of continuous space optimization was used. The basic idea of binary genetic ant colony algorithm and its features were presented, and the specific imple-mentation method of binary genetic ant colony algorithm in motor optimization design was mainly discussed. Language was used to realize the algorithm and results of simulation and calculation were obtained to prove its global convergence property. Finite element method was used to simulate the optimized electromagnetic design. The result slows that the optimization design of motor based on improved binary genetic ant colony algorithm may effectively improve the starting and running performance of the motor.%针对电机的优化设计问题,采用一种改进的二进制遗传蚁群算法,对一台4极7.5 kW的自起动永磁同步电动机的结构参数进行优化,该算法结合遗传算法和蚁群算法各自的优点,并且能解决连续空间优化问题。介绍了改进二进制遗传蚁群算法的基本思想及其特点,重点论述该算法在电机优化设计中的具体实现方法。采用编程语言实现该算法,通过大量的仿真计算验证算法的全局收敛能力。利用有限元方法对优化后的电磁设计方案进行仿真,结果表明该算法可以使自起动永磁同步电动机得到较好的优化,有可能提高电机的起动性能和运行性能。

  14. An Improved Ant Colony Routing Algorithm for WSNs

    Directory of Open Access Journals (Sweden)

    Tan Zhi

    2015-01-01

    Full Text Available Ant colony algorithm is a classical routing algorithm. And it are used in a variety of application because it is economic and self-organized. However, the routing algorithm will expend huge amounts of energy at the beginning. In the paper, based on the idea of Dijkstra algorithm, the improved ant colony algorithm was proposed to balance the energy consumption of networks. Through simulation and comparison with basic ant colony algorithms, it is obvious that improved algorithm can effectively balance energy consumption and extend the lifetime of WSNs.

  15. 基于蚁群算法的桁架结构布局离散变量优化方法%The method of truss structure layout discrete variable optimization based on Ant Colony Optimization

    Institute of Scientific and Technical Information of China (English)

    张卓群; 李宏男

    2013-01-01

    The purpose of the truss structure layout optimization method is that cross-section,topology and shape variables unified discrete variables.The discrete variables have been transformed into the TSP problem variables to adapt the ant colony optimization algorithm.The MATLAB procedure of Truss Structure layout optimization has been developed to solve this problem.By checking some classical plane and space truss structure of the layout optimization examples by the MATLAB simplified procedure,in discrete system,it is considered that the result of layout optimization has much greater efficiency,compared to separate cross-section optimization,topology optimization and shape optimization,and is better than the other layout optimization algorithms.Although this paper presented that the method of truss structure layout optimization based on ant colony optimization is preliminary research in truss layout optimization method,the idea has shown good performance in program design,solution speed,solution space,and generality and so on.This algorithm is very simple,practical and suitable for engineering.%提出的布局优化方法是将桁架结构的截面变量、拓扑变量及形状变量统一为离散变量.将离散变量转化为适应于蚁群算法求解TSP问题的离散变量,应用MATLAB语言编写求解桁架结构布局优化程序,最终实现对问题的分析与求解.通过对几个经典的平面、空间桁架结构布局优化算例的验算表明:本文设计的基于蚁群算法的桁架结构布局离散变量优化方法较单独处理截面优化、拓扑优化及形状优化问题具有更大的效益,相对于其他布局优化方法也展现出更好的优化效果.“基于蚁群算法的桁架结构布局离散变量优化方法”在程序设计、求解速度、求解空间及其方法通用性等方面都表现出良好的性能,并且简单、实用,适应于实际工程应用.

  16. Ant colony algorithm based on genetic method for continuous optimization problem%基于遗传机制的蚁群算法求解连续优化问题

    Institute of Scientific and Technical Information of China (English)

    朱经纬; 蒙陪生; 王乘

    2007-01-01

    A new algorithm is presented by using the ant colony algorithm based on genetic method (ACG) to solve the continuous optimization problem. Each component has a seed set. The seed in the set has the value of component, trail information and fitness. The ant chooses a seed from the seed set with the possibility determined by trail information and fitness of the seed. The genetic method is used to form new solutions from the solutions got by the ants. Best solutions are selected to update the seeds in the sets and trail information of the seeds. In updating the trail information, a diffusion function is used to achieve the diffuseness of trail information. The new algorithm is tested with 8 different benchmark functions.

  17. An adaptive ant colony optimization framework for scheduling environmental flow management alternatives under varied environmental water availability conditions

    Science.gov (United States)

    Szemis, J. M.; Maier, H. R.; Dandy, G. C.

    2014-10-01

    Human water use is increasing and, as such, water for the environment is limited and needs to be managed efficiently. One method for achieving this is the scheduling of environmental flow management alternatives (EFMAs) (e.g., releases, wetland regulators), with these schedules generally developed over a number of years. However, the availability of environmental water changes annually as a result of natural variability (e.g., drought, wet years). To incorporate this variation and schedule EFMAs in a operational setting, a previously formulated multiobjective optimization approach for EFMA schedule development used for long-term planning has been modified and incorporated into an adaptive framework. As part of this approach, optimal schedules are updated at regular intervals during the planning horizon based on environmental water allocation forecasts, which are obtained using artificial neural networks. In addition, the changes between current and updated schedules can be minimized to reduce any disruptions to long-term planning. The utility of the approach is assessed by applying it to an 89km section of the River Murray in South Australia. Results indicate that the approach is beneficial under a range of hydrological conditions and an improved ecological response is obtained in a operational setting compared with previous long-term approaches. Also, it successfully produces trade-offs between the number of disruptions to schedules and the ecological response, with results suggesting that ecological response increases with minimal alterations required to existing schedules. Overall, the results indicate that the information obtained using the proposed approach potentially aides managers in the efficient management of environmental water.

  18. An Improved Multi-Objective Ant Colony Optimization Algorithm%一种改进的多目标蚁群优化算法

    Institute of Scientific and Technical Information of China (English)

    黄坤; 吴俊

    2011-01-01

    For the characteristics of multi-objective optimization problems is proposed for multi-objective optimization problems ant colony algorithm.Definition of evolutionary algorithms selected from the population when a certain number of individual sources as the center of pheromone diffusion,more than the distance between the centers of intervals;group of other individuals in accordance with the distance from the nearest source of the principle of individual ownership in one of the Pheromone diffusion source;each spread source of pheromone pheromone diffusion algorithm in accordance with the individual to obtain from the center of the pheromone;each generation groups in the center point to the next generation population retained to ensure convergence and maintenance groups Diversity.Finally,multi-objective knapsack problem to test algorithm performance,and with the MOA and the NSGA-II algorithm was simulated compared.Results show that the search efficiency,the true Pareto front approximation to good effect,to obtain the spread of a wide range of solutions,is a multi-objective optimization problem solving and effective method.%提出了一种改进的多目标优化问题的蚁群算法.算法选择进化算法的定义的时候,种群中一定数量的个体信息来源作为中心的扩散,多个中心点之间有一定的距离;群体中的其他个体按照离源个体最近的距离的原则归属于其中一个信息素扩散源;按照信息素扩散算法,每一信息素扩散源中的个体获得源于中心点的信息素;保留每一代群体中的中心点到下一代种群中,确保了收敛性和维护种群的多样性.最后利用多目标背包问题来测试算法的性能,并与MOA和NSGA-II算法进行了分析比较.结果表明,该搜索效率高,向真实Pareto前沿逼近效果好,得到传播的多种解决方案,是一个多目标优化问题的解决和有效的方法.

  19. Optimal Power Flow Solution Using Ant Manners for Electrical Network

    Directory of Open Access Journals (Sweden)

    ALLAOUA, B.

    2009-02-01

    Full Text Available This paper presents ant manners and the collective intelligence for electrical network. Solutions for Optimal Power Flow (OPF problem of a power system deliberate via an ant colony optimization metaheuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of transmission lines. Simulation results on the IEEE 30-bus electrical network show that the ant colony optimization method converges quickly to the global optimum.

  20. A Hybrid Routing Algorithm Based on Ant Colony and ZHLS Routing Protocol for MANET

    Science.gov (United States)

    Rafsanjani, Marjan Kuchaki; Asadinia, Sanaz; Pakzad, Farzaneh

    Mobile Ad hoc networks (MANETs) require dynamic routing schemes for adequate performance. This paper, presents a new routing algorithm for MANETs, which combines the idea of ant colony optimization with Zone-based Hierarchical Link State (ZHLS) protocol. Ant colony optimization (ACO) is a class of Swarm Intelligence (SI) algorithms. SI is the local interaction of many simple agents to achieve a global goal. SI is based on social insect for solving different types of problems. ACO algorithm uses mobile agents called ants to explore network. Ants help to find paths between two nodes in the network. Our algorithm is based on ants jump from one zone to the next zones which contains of the proactive routing within a zone and reactive routing between the zones. Our proposed algorithm improves the performance of the network such as delay, packet delivery ratio and overhead than traditional routing algorithms.

  1. Incremental Web Usage Mining Based on Active Ant Colony Clustering

    Institute of Scientific and Technical Information of China (English)

    SHEN Jie; LIN Ying; CHEN Zhimin

    2006-01-01

    To alleviate the scalability problem caused by the increasing Web using and changing users' interests, this paper presents a novel Web Usage Mining algorithm-Incremental Web Usage Mining algorithm based on Active Ant Colony Clustering. Firstly, an active movement strategy about direction selection and speed, different with the positive strategy employed by other Ant Colony Clustering algorithms, is proposed to construct an Active Ant Colony Clustering algorithm, which avoid the idle and "flying over the plane" moving phenomenon, effectively improve the quality and speed of clustering on large dataset. Then a mechanism of decomposing clusters based on above methods is introduced to form new clusters when users' interests change. Empirical studies on a real Web dataset show the active ant colony clustering algorithm has better performance than the previous algorithms, and the incremental approach based on the proposed mechanism can efficiently implement incremental Web usage mining.

  2. Brief Announcement: Distributed Task Allocation in Ant Colonies

    OpenAIRE

    Dornhaus, Anna; Lynch, Nancy; Radeva, Tsvetomira; Su, and Hsin-Hao

    2015-01-01

    International audience A common problem in both distributed computing and insect biology is designing a model that accurately captures the behavior of a given distributed system or an ant colony, respectively. While the challenges involved in modeling computer systems and ant colonies are quite different from each other, a common approach is to explore multiple variations of different models and compare the results in terms of the simplicity of the model and the quality of the results. We ...

  3. Road Traffic System: Optimization Using Ant Systems

    OpenAIRE

    Yeong, Kim Ming

    2003-01-01

    Let us look at these social insects, which are relatively simple however, they can perform effective strategy following the simple, adaptive to local rules, which allows them to change according to the environment for survival. This uniqueness of the insect world helps us to understand that complex situation does have solution. The study of ant colonies behavior is an interesting issue that provides good modeling solution for difficult optimization and distributed control problems. Transporta...

  4. Ant colony based routing in wireless sensor networks

    Directory of Open Access Journals (Sweden)

    Varnika Bains

    2012-09-01

    Full Text Available Wireless Sensor Networks comprises of small sensor nodes communicating with each other in a network topology which keeps on varying. The wireless sensor nodes also known as motes have limited energy resources along with constraints on its computational and storage capabilities. Due to these restrictions coupled with its dynamic topology, routing in Wireless Sensor Networks (WSN is a very challenging task. Routing protocols for WSN’s have to ensure reliable multi-hop communication under these conditions. A wide range of adhoc routing algorithms are available for WSN’s. In this paper an adaptation of Ant Colony Optimization (ACO technique is demonstrated for network routing. This approach belongs to the class of routing algorithms inspired by the behavior of the ant colonies in locating and storing food. The effectiveness of the heuristic algorithm is supported by the performance evaluations. PROWLER, a MATLAB based probabilistic wireless network simulator is used for the calculations. This simulator simulates the transmissions including collisions in ad-hoc radio networks, and the operation of the MAC-layer. The performance metrics are evaluated on RMASE, an application built in PROWLER.

  5. 基于蚁群优化算法的 SAR 图像舰船检测研究%Study on SAR image ship detection based on ant colony optimization algorithm

    Institute of Scientific and Technical Information of China (English)

    李琳琳; 王纪奎; 宋艳芳

    2014-01-01

    边缘检测作为提取图像边缘的重要方法在舰船检测中占有重要位置。采用蚁群优化算法通过调整动态阈值进行边缘检测。与传统边缘检测算子和小波变换算法对比采用蚁群优化算法进行舰船检测大大的减少了计算时间和代价,同时有效地提取了SAR图像的舰船目标和结构信息,保证了检测结果的准确性。蚁群优化算法在处理图像边缘检测等离散优化问题上具有很大的优越性,在图像处理中具有广阔的应用前景。%Edge detection as an important image edge extraction method plays an important part in ship detection .Ant Colony Optimization algorithm was adopted in edge detection by adjusting threshold dynamically.Compared with the traditional edge detection operators and wavelet transform, ant colony optimization algorithm greatly reduces the ship detection computing time and cost,and extracts the targets and ship structure information in SAR image,ensures result accuracy effectively.Ant Colony Optimization algorithm has a lot of advantages in dealing with image edge detection and so on discrete optimization problems,it performs very broad prospect in image processing .

  6. Enhanced Bee Colony Algorithm for Complex Optimization Problems

    Directory of Open Access Journals (Sweden)

    S.Suriya

    2012-01-01

    Full Text Available Optimization problems are considered to be one kind of NP hard problems. Usually heuristic approaches are found to provide solutions for NP hard problems. There are a plenty of heuristic algorithmsavailable to solve optimization problems namely: Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, etc. The basic Bee Colony algorithm, a population based search algorithm, is analyzed to be a novel tool for complex optimization problems. The algorithm mimics the food foraging behavior of swarmsof honey bees. This paper deals with a modified fitness function of Bee Colony algorithm. The effect of problem dimensionality on the performance of the algorithms will be investigated. This enhanced Bee Colony Optimization will be evaluated based on the well-known benchmark problems. The testing functions like Rastrigin, Rosenbrock, Ackley, Griewank and Sphere are used to evaluavate the performance of the enhanced Bee Colony algorithm. The simulation will be developed on MATLAB.

  7. Ant Colony Algorithm for Solving QoS Routing Problem

    Institute of Scientific and Technical Information of China (English)

    SUN Li-juan; WANG Liang-jun; WANG Ru-chuan

    2004-01-01

    Based on the state transition rule, the local updating rule and the global updating rule of ant colony algorithm, we propose an improved ant colony algorithm of the least-cost quality of service (QoS) unicast routing. The algorithm is used for solving the routing problem with delay, delay jitter, bandwidth, and packet loss-constrained. In the simulation, about 52.33% ants find the successful QoS routing , and converge to the best. It is proved that the algorithm is efficient and effective.

  8. Ant colonies prefer infected over uninfected nest sites.

    Science.gov (United States)

    Pontieri, Luigi; Vojvodic, Svjetlana; Graham, Riley; Pedersen, Jes Søe; Linksvayer, Timothy A

    2014-01-01

    During colony relocation, the selection of a new nest involves exploration and assessment of potential sites followed by colony movement on the basis of a collective decision making process. Hygiene and pathogen load of the potential nest sites are factors worker scouts might evaluate, given the high risk of epidemics in group-living animals. Choosing nest sites free of pathogens is hypothesized to be highly efficient in invasive ants as each of their introduced populations is often an open network of nests exchanging individuals (unicolonial) with frequent relocation into new nest sites and low genetic diversity, likely making these species particularly vulnerable to parasites and diseases. We investigated the nest site preference of the invasive pharaoh ant, Monomorium pharaonis, through binary choice tests between three nest types: nests containing dead nestmates overgrown with sporulating mycelium of the entomopathogenic fungus Metarhizium brunneum (infected nests), nests containing nestmates killed by freezing (uninfected nests), and empty nests. In contrast to the expectation pharaoh ant colonies preferentially (84%) moved into the infected nest when presented with the choice of an infected and an uninfected nest. The ants had an intermediate preference for empty nests. Pharaoh ants display an overall preference for infected nests during colony relocation. While we cannot rule out that the ants are actually manipulated by the pathogen, we propose that this preference might be an adaptive strategy by the host to "immunize" the colony against future exposure to the same pathogenic fungus. PMID:25372856

  9. Ant colonies prefer infected over uninfected nest sites.

    Directory of Open Access Journals (Sweden)

    Luigi Pontieri

    Full Text Available During colony relocation, the selection of a new nest involves exploration and assessment of potential sites followed by colony movement on the basis of a collective decision making process. Hygiene and pathogen load of the potential nest sites are factors worker scouts might evaluate, given the high risk of epidemics in group-living animals. Choosing nest sites free of pathogens is hypothesized to be highly efficient in invasive ants as each of their introduced populations is often an open network of nests exchanging individuals (unicolonial with frequent relocation into new nest sites and low genetic diversity, likely making these species particularly vulnerable to parasites and diseases. We investigated the nest site preference of the invasive pharaoh ant, Monomorium pharaonis, through binary choice tests between three nest types: nests containing dead nestmates overgrown with sporulating mycelium of the entomopathogenic fungus Metarhizium brunneum (infected nests, nests containing nestmates killed by freezing (uninfected nests, and empty nests. In contrast to the expectation pharaoh ant colonies preferentially (84% moved into the infected nest when presented with the choice of an infected and an uninfected nest. The ants had an intermediate preference for empty nests. Pharaoh ants display an overall preference for infected nests during colony relocation. While we cannot rule out that the ants are actually manipulated by the pathogen, we propose that this preference might be an adaptive strategy by the host to "immunize" the colony against future exposure to the same pathogenic fungus.

  10. Ant Colony System Algorithm for Real-Time Globally Optimal Path Planning of Mobile Robots%基于ACS算法的移动机器人实时全局最优路径规划

    Institute of Scientific and Technical Information of China (English)

    谭冠政; 贺欢; SLOMAN Aaron

    2007-01-01

    A novel method for the real-time globally optimal path planning of mobile robots is proposed based on the ant colony system (ACS) algorithm. This method includes three steps: the first step is utilizing the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is utilizing the Dijkstra algorithm to find a sub-optimal collision-free path,and the third step is utilizing the ACS algorithm to optimize the location of the sub-optimal path so as to generate the globally optimal path. The result of computer simulation experiment shows that the proposed method is effective and can be used in the real-time path planning of mobile robots. It has been verified that the proposed method has better performance in convergence speed, solution variation, dynamic convergence behavior, and computational efficiency than the path planning method based on the genetic algorithm with elitist model.

  11. Ant Colony Based Path Planning Algorithm for Autonomous Robotic Vehicles

    Directory of Open Access Journals (Sweden)

    Yogita Gigras

    2012-11-01

    Full Text Available The requirement of an autonomous robotic vehicles demand highly efficient algorithm as well as software. Today’s advanced computer hardware technology does not provide these types of extensive processing capabilities, so there is still a major space and time limitation for the technologies that are available for autonomous robotic applications. Now days, small to miniature mobile robots are required for investigation, surveillance and hazardous material detection for military and industrial applications. But these small sized robots have limited power capacity as well as memory and processing resources. A number of algorithms exist for producing optimal path for dynamically cost. This paper presents a new ant colony based approach which is helpful in solving path planning problem for autonomous robotic application. The experiment of simulation verified its validity of algorithm in terms of time.

  12. 云环境下基于改进蚁群算法的网络路由优化%Network Routing Optimization in Cloud Based on Improved Ant Colony Algorithm

    Institute of Scientific and Technical Information of China (English)

    刘伯红; 赵浚尧; 王刚; 阎英

    2013-01-01

    Aimed at diversified and complex network structure environment in cloud, an ant colony optimization algorithm is proposed to improve the network routing quanlity. Based on the original intelligent optimization ant colony algorithm, the new algorithm adopts an network node review mechanism which can judge the network node is online or not in real time, and then select the optimal solution network routing path. Simulation result shows that improved algorithm can effectively improve the network routing quanlity when partial network path has no effect caused by the variability of the network nodes in the network, and so solve some network congestion problems.%针对云计算多元化复杂的网络结构环境,提出一种旨在改善网络路由的蚁群优化算法.新算法在原有蚁群算法智能寻优的基础上,加入网络节点在网审查机制,实时判断网络节点是否在网,选择最优解路径.仿真实验表明,改进算法能有效的改善因为网络节点在网情况的多变性而造成的部分路径失效的情况,进而缓解网络拥塞.

  13. 蚁群算法在选煤厂产品结构优化中的应用%Application of Ant Colony Algorithm in Product Structure Optimization of Coal Preparation Plant

    Institute of Scientific and Technical Information of China (English)

    孙伟; 王宜雷; 王慧; 曾盈

    2012-01-01

    Mathematical model of product structure optimization was established according to characteristics of process of coal preparation plant, and steps of optimizing the product structure by ant colony algorithm were given. Nantun Coal Preparation Plant was used for example to simulate, and the best yields of products under various constraints were obtained. The simulation results showed the feasibility of ant colony algorithm for product structure optimization of coal preparation plant.%根据选煤厂生产流程特点建立了产品结构优化数学模型,给出了应用蚁群算法优化产品结构的步骤;并以南屯选煤厂为例进行仿真,得到了满足各种约束条件下的各产品的最佳产量.仿真结果说明了蚁群算法在选煤厂产品结构优化中应用的可行性.

  14. 基于演化蚁群算法的多目标物流网络优化%Optimization of Multi-objective Logistics Network Based on Evolved Ant Colony Algorithm

    Institute of Scientific and Technical Information of China (English)

    杨名

    2013-01-01

    物流网络优化中普遍存在着多目标优化的问题.传统的多目标优化算法容易陷入局部最优,采用了多种群相关的蚁群算法求解多目标物流网络优化问题,两个种群分别针对总运费最小和最大单程距离最小两个优化目标,考虑蚁群算法的收敛速度,采用遗传算法对蚁群算法的多个初始参数进行优化选择.实验结果证明,该模型算法可以有效迅速地求得最佳路径,为决策者提供多个可选择的优化方案,避免局部最优解.%In this paper, In order to solve the optimization problem of multi-objective logistics networks, we adopted the the ant colony algorithm in correlation with two colonies, respectively being the two optimization objectives of minimizing total transportation cost and maximizing the distance of a single travel. Then considering the speed of convergence of the ant colony algorithm, we used the genetic algorithm to optimize and select its initial parameters. Through an experiment, we found that this model and algorithm could quickly derive the optimal path,, provide multiple options for the decision-makers and avoid local optimal solutions.

  15. Solving Optimal Path Problem Based on Improved Ant Colony Algorithm%基于改进型蚁群算法的最优路径问题求解

    Institute of Scientific and Technical Information of China (English)

    张志协; 曹阳

    2012-01-01

    如何高效的向用户提供最优路径是蚁群算法大规模应用于导航系统的关键问题,针对现有最优路径问题研究中蚁群算法收敛速度慢及容易发生停滞的缺点,利用A*算法的启发式信息改进蚁群算法的路径选择策略,加快算法收敛速度.同时引入遗传算法的双种群策略和蚁群系统信息素更新策略,增加全局搜索能力,避免算法出现停滞现象.仿真实验结果表明,该改进算法具有较好的稳定性和全局优化性,且收敛速度较快.%Efficient optimal path is the key issue of the Ant Colony Algorithm used in road traffic navigation system. Aiming at the problem of slow convergence and stagnation phenomenon of Ant Colony Algorithm, this paper introduce path selection strategy which is based on the heuristic factor of A* algorithm to speed up the convergence. Meanwhile the Double-population strategy of the Genetic algorithm and the pheromone update rules of the Ant Colony System (ACS) are introduced in the algorithm, which avoid stagnation of the algorithm of the algorithm and speed up convergence. The results of the simulation experiment show that the improved algorithm has good stability, global optimization and fast convergence.

  16. Multi-population binary ant colony algorithm with concrete behaviors for multi-objective optimization problem%多目标优化的多种群混合行为二元蚁群算法

    Institute of Scientific and Technical Information of China (English)

    叶青; 熊伟清; 李纲

    2011-01-01

    针对二元蚁群算法在求解多目标问题时难以同时得到多个解和难以得到Pareto曲面的缺陷,使用多种群策略,改善算法的全局搜索能力,引入环境评价/奖励因子和蚁群混合行为搜索机制,提出了多种群混合行为二元蚁群算法.通过对几个不同带约束多目标函数的测试,实验结果表明该算法在保证全局搜索能力的基础上,拥有很好的多目标求解能力.%Aiming at solving the drawbacks of the original binary ant colony algorithm on multi-objective optimization problems:easy to fall into the local optimization and difficult to get the Pareto optimal solutions,Multi-Population Binary Ant colony algorithm with Concrete Behaviors(MPBACB) is proposed.This algorithm introduces multi-population method to ensure the global optimization ability, and uses environmental evaluation/reward model to improve the searching efficiency.Furthermore, concrete ant behaviors are defined to stabilize the performance of the algorithm.Experimental results on several constrained multi-objective functions prove that the algorithm ensures the good global search ability,and has better effect on the multi-objective problems.

  17. Introduction to Ant Colony Algorithm and Its Application in CIMS

    Institute of Scientific and Technical Information of China (English)

    2002-01-01

    Ant colony algorithm is a novel simulated ecosystem e volutionary algorithm, which is proposed firstly by Italian scholars M.Dorigo, A . Colormi and V. Maniezzo. Enlightened by the process of ants searching for food , scholars bring forward this new evolutionary algorithm. This algorithm has sev eral characteristics such as positive feedback, distributed computing and stro nger robustness. Positive feedback and distributed computing make it easier to find better solutions. Based on these characteristics...

  18. A clustering routing algorithm based on improved ant colony clustering for wireless sensor networks

    Science.gov (United States)

    Xiao, Xiaoli; Li, Yang

    Because of real wireless sensor network node distribution uniformity, this paper presents a clustering strategy based on the ant colony clustering algorithm (ACC-C). To reduce the energy consumption of the head near the base station and the whole network, The algorithm uses ant colony clustering on non-uniform clustering. The improve route optimal degree is presented to evaluate the performance of the chosen route. Simulation results show that, compared with other algorithms, like the LEACH algorithm and the improve particle cluster kind of clustering algorithm (PSC - C), the proposed approach is able to keep away from the node with less residual energy, which can improve the life of networks.

  19. MAS Equipped with Ant Colony Applied into Dynamic Job Shop Scheduling

    Science.gov (United States)

    Kang, Kai; Zhang, Ren Feng; Yang, Yan Qing

    This paper presents a methodology adopting the new structure of MAS(multi-agent system) equipped with ACO(ant colony optimization) algorithm for a better schedule in dynamic job shop. In consideration of the dynamic events in the job shop arriving indefinitely schedules are generated based on tasks with ant colony algorithm. Meanwhile, the global objective is taken into account for the best solution in the actual manufacturing environment. The methodology is tested on a simulated job shop to determine the impact with the new structure.

  20. Weapon target assignment problem satisfying expected damage probabilities based on ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    Wang Yanxia; Qian Longjun; Guo Zhi; Ma Lifeng

    2008-01-01

    A weapon target assignment (WTA) model satisfying expected damage probabilities with an ant colony algorithm is proposed.In order to save armament resource and attack the targets effectively,the strategy of the weapon assignment is that the target with greater threat degree has higher priority to be intercepted.The effect of this WTA model is not maximizing the damage probability but satisfying the whole assignment result.Ant colony algorithm has been successfully used in many fields,especially in combination optimization.The ant colony algorithm for this WTA problem is described by analyzing path selection,pheromone update,and tabu table update.The effectiveness of the model and the algorithm is demonstrated with an example.

  1. Core Business Selection Based on Ant Colony Clustering Algorithm

    Directory of Open Access Journals (Sweden)

    Yu Lan

    2014-01-01

    Full Text Available Core business is the most important business to the enterprise in diversified business. In this paper, we first introduce the definition and characteristics of the core business and then descript the ant colony clustering algorithm. In order to test the effectiveness of the proposed method, Tianjin Port Logistics Development Co., Ltd. is selected as the research object. Based on the current situation of the development of the company, the core business of the company can be acquired by ant colony clustering algorithm. Thus, the results indicate that the proposed method is an effective way to determine the core business for company.

  2. Optimal Power Flow Solution Using Ant Manners for Electrical Network

    OpenAIRE

    ALLAOUA, B.; LAOUFI, A.

    2009-01-01

    This paper presents ant manners and the collective intelligence for electrical network. Solutions for Optimal Power Flow (OPF) problem of a power system deliberate via an ant colony optimization metaheuristic method. The objective is to minimize the total fuel cost of thermal generating units and also conserve an acceptable system performance in terms of limits on generator real and reactive power outputs, bus voltages, shunt capacitors/reactors, transformers tap-setting and power flow of tra...

  3. Blackboard Mechanism Based Ant Colony Theory for Dynamic Deployment of Mobile Sensor Networks

    Institute of Scientific and Technical Information of China (English)

    Guang-ping Qi; Ping Song; Ke-jie Li

    2008-01-01

    A novel bionic swarm intelligence algorithm, called ant colony algorithm based on a blackboard mechanism, is proposed to solve the autonomy and dynamic deployment of mobiles sensor networks effectively. A blackboard mechanism is introduced into the system for making pheromone and completing the algorithm. Every node, which can be looked as an ant, makes one information zone in its memory for communicating with other nodes and leaves pheromone, which is created by ant itself in nature. Then ant colony theory is used to find the optimization scheme for path planning and deployment of mobile Wireless Sensor Network (WSN). We test the algorithm in a dynamic and unconfigurable environment. The results indicate that the algorithm can reduce the power consumption by 13% averagely, enhance the efficiency of path planning and deployment of mobile WSN by 15% averagely.

  4. Design of the Logistics Distribution Optimization System Based on Ant Colony Algorithm%基于蚁群算法的物流配送优化系统设计

    Institute of Scientific and Technical Information of China (English)

    符志强; 刘磊安

    2014-01-01

    随着物流业的快速发展,配送路径优化成为研究热点,而路径优化是NP难问题,传统的算法不能在有限的时间内给出最优解。使用蚁群算法并对其参数进行优化,从而解决车辆配送路径优化问题,使得配送路径实时最优化,并应用在物流配送系统中,降低物流配送成本和企业经营成本。基于蚁群算法的物流配送系统采用模块化设计,实现对物流管理、数据统计、货物配送、实时生成最优路径的功能。系统具有结构清晰,易于扩展的优点。%With the rapid development of the logistics industry, distribution optimization has become a research hotspot. Path optimization is a NP hard problem and traditional algorithms can not be given an optimal solution in finite time. Uses ant colony optimization and adjusts the parameters to solve the optimization of vehicle routing problem. It can reduce logistics cost and the operation cost of enterprises. Designs logistics distribution system based on ant colony algorithm based on modular. The system can give the service of logistics management, data statistics, goods distribution, real-time generation of optimal path. The system has the advantages of clear structure and easy to ex-pand.

  5. A Novel Approach to the Convergence Proof of Ant Colony Algorithm and Its MATLAB GUI-Based Realization

    Institute of Scientific and Technical Information of China (English)

    DUAN Hai-bin; WANG Dao-bo; YU Xiu-fen

    2006-01-01

    Although ant colony algorithm for the heuristic solution of hard combinational optimization problems enjoy a rapidly growing popularity, but little is known about its convergence properties. Based on the introduction of the basic principle and mathematical model, a novel approach to the convergence proof that applies directly to the ant colony algorithm is proposed in this paper. Then, a MATLAB GUI- based ant colony algorithm simulation platform is developed, and the interface of this simulation platform is very friendly, easy to use and to modify.

  6. Ant Colonies Prefer Infected over Uninfected Nest Sites

    OpenAIRE

    Luigi Pontieri; Svjetlana Vojvodic; Riley Graham; Jes Søe Pedersen; Linksvayer, Timothy A

    2014-01-01

    During colony relocation, the selection of a new nest involves exploration and assessment of potential sites followed by colony movement on the basis of a collective decision making process. Hygiene and pathogen load of the potential nest sites are factors worker scouts might evaluate, given the high risk of epidemics in group-living animals. Choosing nest sites free of pathogens is hypothesized to be highly efficient in invasive ants as each of their introduced populations is often an open n...

  7. MOEA/D-ACO: a multiobjective evolutionary algorithm using decomposition and AntColony.

    Science.gov (United States)

    Ke, Liangjun; Zhang, Qingfu; Battiti, Roberto

    2013-12-01

    Combining ant colony optimization (ACO) and the multiobjective evolutionary algorithm (EA) based on decomposition (MOEA/D), this paper proposes a multiobjective EA, i.e., MOEA/D-ACO. Following other MOEA/D-like algorithms, MOEA/D-ACO decomposes a multiobjective optimization problem into a number of single-objective optimization problems. Each ant (i.e., agent) is responsible for solving one subproblem. All the ants are divided into a few groups, and each ant has several neighboring ants. An ant group maintains a pheromone matrix, and an individual ant has a heuristic information matrix. During the search, each ant also records the best solution found so far for its subproblem. To construct a new solution, an ant combines information from its group's pheromone matrix, its own heuristic information matrix, and its current solution. An ant checks the new solutions constructed by itself and its neighbors, and updates its current solution if it has found a better one in terms of its own objective. Extensive experiments have been conducted in this paper to study and compare MOEA/D-ACO with other algorithms on two sets of test problems. On the multiobjective 0-1 knapsack problem,MOEA/D-ACO outperforms the MOEA/D with conventional genetic operators and local search on all the nine test instances. We also demonstrate that the heuristic information matrices in MOEA/D-ACO are crucial to the good performance of MOEA/D-ACO for the knapsack problem. On the biobjective traveling salesman problem, MOEA/D-ACO performs much better than the BicriterionAnt on all the 12 test instances. We also evaluate the effects of grouping, neighborhood, and the location information of current solutions on the performance of MOEA/D-ACO. The work in this paper shows that reactive search optimization scheme, i.e., the "learning while optimizing" principle, is effective in improving multiobjective optimization algorithms. PMID:23757576

  8. Bait distribution among multiple colonies of Pharaoh ants (hymenoptera: Formicidae).

    Science.gov (United States)

    Oi, D H; Vail, K M; Williams, D F

    2000-08-01

    Pharaoh ant, Monomorium pharaonis (L.), infestations often consist of several colonies located at different nest sites. To achieve control, it is desirable to suppress or eliminate the populations of a majority of these colonies. We compared the trophallactic distribution and efficacy of two ant baits, with different modes of action, among groups of four colonies of Pharaoh ants. Baits contained either the metabolic-inhibiting active ingredient hydramethylnon or the insect growth regulator (IGR) pyriproxyfen. Within 3 wk, the hydramethylnon bait reduced worker and brood populations by at least 80%, and queen reductions ranged between 73 and 100%, when nests were in proximity (within 132 cm) to the bait source. However, these nest sites were reoccupied by ants from other colonies located further from the bait source. The pyriproxyfen bait was distributed more thoroughly to all nest locations with worker populations gradually declining by 73% at all nest sites after 8 wk. Average queen reductions ranged from 31 to 49% for all nest sites throughout the study. Even though some queens survived, brood reductions were rapid in the pyriproxyfen treatment, with reductions of 95% at all locations by week 3. Unlike the metabolic inhibitor, the IGR did not kill adult worker ants quickly, thus, more surviving worker ants were available to distribute the bait to all colonies located at different nest sites. Thus, from a single bait source, the slow-acting bait toxicant provided gradual, but long-term control, whereas the fast-acting bait toxicant provided rapid, localized control for a shorter duration. PMID:10985038

  9. Dynamic Continuous Ant Colony Optimization and Its Application to Space-based Warning System%动态连续蚁群系统及其在天基预警中的应用

    Institute of Scientific and Technical Information of China (English)

    胡崇海; 李一军; 姜维; 王铁军

    2011-01-01

    存在监控冲突的天基中段预警传感器调度优化是一个动态、高维、复杂多约束的非线性优化问题,其解空间的高维度与状态复杂性直接制约了智能优化算法的运用.本文以任务分解与任务复合优先权计算为基础,通过二级分离机制将解空间维度与状态复杂性降低至适于连续蚁群(continuous ant-colony optimization,CACO)处理的全局优化形态,构建出相应的优化子路径集.在此基础上,针对监控冲突导致的状态变化特性,从局部搜索递进与募集的角度提出适于传感器调度优化的MG-DCACO(double direction continuous ant-colony optimization based mass recruitment and group recruitment)算法,成功将智能优化算法应用于基于低轨星座的天基中段预警中.最后对算法的收敛性进行论证,并通过与已有规则调度算法的对比得出MG-DCACO算法可获得优于规则调度算法的全局最优解.%The scheduling method of sensors on space-based warning in middle age is a dynamic, multi-dimensional, complex-constraints nonlinear optimization problem.Considering the monitoring conflict, it is nearly impossible to use intelligent optimization algorithms in this problem.On the basis of task decomposition and task multiplex priority, by means of second-stage separating, this paper reduces the multi-dimensional and complexconstraints to a suitable area.Then, through the angles of monitoring conflict, area searching and collecting, the author puts forward a MG-DCACO ( double direction continuous ant-colony optimization based mass recruitment and group recruitment) algorithm which can be used in sensors scheduling.At last, it is proved that, the MG-DCACO is convergence and outperforming the other algorithms of sensors scheduling.

  10. Research of genetic algorithm and ant colony optimization on path planning for oceanography survey%遗传算法与蚁群算法在海洋调查路径规划中的应用

    Institute of Scientific and Technical Information of China (English)

    张寒野; 凌建忠

    2016-01-01

    分别以遗传算法与蚁群算法对23个站位的海洋渔业资源调查路径进行规划,寻找其最优路径.求解结果表明,遗传算法和蚁群算法都能找到同样的最短路径,比实际路径缩短了8.32%的里程.蚁群算法求得的平均路径长度小于遗传算法,但所耗时间比遗传算法多一倍左右.%Searching for the optimal path is one of the most important combinatorial optimization problems. Since this problem belongs to NP-hard problems,an exact algorithm could not solve the large-scale problems in time,some metaheuristic approaches have been used to solve it in recent years.Genetic algorithm works in a way similar to the process of natural evolution,such as inheritance,mutation,selection and crossover.A basic GA starts with a randomly generated population of candidate solutions.After the evolution of several generations,the optimal solution for the problem is obtained.Ant colony optimization algorithm is to mimic the movements of ants.Ants leave a trail of pheromones when they search for food,and the pheromone density becomes higher on shorter paths than longer ones.As more ants use a particular trail,the pheromone concentration on it increases,hence attracting more ants.Consequently,all ants follow a best path.This article presented GA and ACO for solving the path planning of 23 stations for a fishing resource survey.The results indicate that both algorithm are able to find out the same shortest path,which is 8.32% shorter than the actual path.The average path length obtained by ACO is less than that by GA,but it takes nearly twice as long.It is suggested that ACO has better convergence and more acurate calculation results,as well as GA is suitable for fastsolving and roughly estimating the problems.

  11. Hybrid ant colony algorithm for traveling salesman problem

    Institute of Scientific and Technical Information of China (English)

    2003-01-01

    A hybrid approach based on ant colony algorithm for the traveling salesman problem is proposed, which is an improved algorithm characterized by adding a local search mechanism, a cross-removing strategy and candidate lists. Experimental results show that it is competitive in terms of solution quality and computation time.

  12. Ant Colony Approach to Predict Amino Acid Interaction Networks

    OpenAIRE

    Gaci, Omar; Balev, Stefan

    2009-01-01

    In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. We consider the problem of reconstructing protein's interaction network from its amino acid sequence. An ant colony approach is used to solve this problem.

  13. Local Optimal Design Method of Transmission Tower Structure Based on Ant Colony Optimization%基于蚁群算法的输电塔结构局部优化设计

    Institute of Scientific and Technical Information of China (English)

    张卓群; 任宗栋; 李宏男; 李宁; 王稳

    2016-01-01

    提出了一种可同时求解结构截面、拓扑、形状和布局优化问题的基于蚁群算法的输电塔结构局部优化设计方法。在统一所有优化变量的基础上,将4类不同层次的优化问题统一为适用于蚁群算法求解的标准化旅行商问题,再采用MATLAB系统平台实现输电塔结构的优化设计和程序化,并以某实际工程为算例对局部优化方法进行验证。结果表明:提出的方法不仅可以简单高效地求解输电塔结构塔身局部的截面、拓扑、形状和布局优化问题,而且具有非常好的实用性和通用性,有望应用于完整的输电塔结构优化设计中。%A new local optimal design method of transmission tower structure ,which could apply in cross‐section ,topology ,shape and layout optimization problems ,was proposed based on ant colony optimization (ACO ) algorithm . With unifying the multiple type variables into discrete variables , the four optimal problems with different levels were transformed into the standardization traveling salesman problem ,and it also was realized in programmed control by MATLAB system platform ,then an actual example was calculated to verify the local optimal design method . The results show that the proposed optimal design method has a good performance in cross‐section ,topology ,shape and layout optimal problem with generality and programmed pattern ,and it also has a good application prospect in optimal design of transmission power structure .

  14. Using pleometrosis (multiple queens) and pupae transplantation to boost weaver ant (Oecophylla smaragdina) colony growth in ant nurseries

    DEFF Research Database (Denmark)

    Offenberg, Hans Joachim; Nielsen, Mogens Gissel; Peng, Renkang

    2011-01-01

    Weaver ants (Oecophylla spp.) are increasingly being used for biocontrol and are targeted for future production of insect protein in ant farms. An efficient production of live ant colonies may facilitate the utilization of these ants but the production of mature colonies is hampered by the long...... and no transplantation. Thus, in ant nurseries the use of multiple queens during nest founding as well as transplantation of pupae from foreign colonies may be utilised to decrease the time it takes to produce a colony ready for implementation....... time it takes for newly established colonies to grow to a suitable size. In this study we followed the growth of newly founded O. smaragdina colonies with 2, 3 or 4 founding queens during 12 days of development, following the transplantation of 0, 30 or 60 pupae from a mature donor colony. Colony...

  15. 基于改进蚁群算法的薄壁件柔性工装布局优化%Flexible Tooling Layout Optimization for Thin-Walled Workpieces Based on Improved Ant Colony Algorithm

    Institute of Scientific and Technical Information of China (English)

    周涛; 熊珍琦; 姚为; 秦英

    2016-01-01

    In order to reduce the elastic deformation of thin-walled workpieces with poor rigidity,when it is under the clamping force of tooling during the manufacturing process,a method of flexible tooling layout opti⁃mization for the thin-walled workpieces based on the improved ant colony algorithm is presented. Tooling layout optimization of positioning/supporting array is realized by combining finite element analysis with ant colony-ge⁃netic hybrid algorithm. The verification of examples shows that the optimal state of the topological configuration and distribution density of positioning/supporting array in the flexible tooling system can be achieved through opti⁃mization by the improved genetic-ant colony algorithm,thus obtaining the optimal flexible tooling layout for the thin-walled workpieces. The maximum deformation of the thin-walled workpieces can be reduced by 47%.%为解决薄壁件刚性差,在制造过程中易因工装夹紧力产生弹性变形等问题,提出了一种基于改进蚁群算法的薄壁件柔性工装布局优化方法,对薄壁件的柔性工装进行了布局优化。该方法通过有限元分析与蚁群/遗传混合算法相结合的方法进行了工装定位/支承阵列的布局优化。实例验证表明,采用改进遗传蚁群算法对工装布局进行优化,可使柔性工装系统中定位/支承阵列布局的拓扑形态和分布密度处于最优状态,使薄壁件最大变形量缩小47%。

  16. Emigration of a colony of the leaf-cutting ant Acromyrmex heyeri Forel (Hymenoptera, Formicidae

    Directory of Open Access Journals (Sweden)

    Mariane Aparecida Nickele

    2012-09-01

    Full Text Available Emigration of a colony of the leaf-cutting ant Acromyrmex heyeri Forel (Hymenoptera, Formicidae. Colony migration is a poorly studied phenomenon in leaf-cutting ants. Here we report on the emigration of a colony of the leaf-cutting ant A. heyeri in Brazil. The colony emigrated to a new location 47.4 m away from the original nest site, possibly because it had undergone considerable stress due to competitive interactions with a colony of Acromyrmex crassispinus.

  17. Emigration of a colony of the leaf-cutting ant Acromyrmex heyeri Forel (Hymenoptera, Formicidae)

    OpenAIRE

    Mariane Aparecida Nickele; Marcio Roberto Pie; Wilson Reis Filho

    2012-01-01

    Emigration of a colony of the leaf-cutting ant Acromyrmex heyeri Forel (Hymenoptera, Formicidae). Colony migration is a poorly studied phenomenon in leaf-cutting ants. Here we report on the emigration of a colony of the leaf-cutting ant A. heyeri in Brazil. The colony emigrated to a new location 47.4 m away from the original nest site, possibly because it had undergone considerable stress due to competitive interactions with a colony of Acromyrmex crassispinus.

  18. Structure Learning Algorithm for DBN Transition Networks Based on Ant Colony Optimization%基于蚁群优化的DBN转移网络结构学习算法

    Institute of Scientific and Technical Information of China (English)

    胡仁兵; 翼俊忠; 张鸿勋; 刘椿年

    2009-01-01

    Aiming at the characteristics of dynamic Bayesian transition networks, this paper proposes a structure learning algorithm based on Ant Colony Optimization(ACO) named ACO-DBN-2S by extending the static Bayesian networks structure leaning algorithm I-ACO-B. In ACO-DBN-2S, ants select arcs from the inter-ares between time slices before from the intra-arcs in one slice, and the interval optimization strategy is improved by decreasing the times of optimizatien operation. A number of experiments under standard datasets demonstrate the algorithm can handle large data, and the precision and speed of learning are improved.%针对动态贝叶斯转移网络的特点,以I-ACO-B为基础,提出基于蚁群优化的分步构建转移网络的结构学习算法ACO-DBN-2S.算法将转移网络的结构学习分为时间片之间和时间片内2个步骤进行,通过改进隔代优化策略,减少无效优化次数.标准数据集下的大量实验结果证明,该算法能更有效地处理大规模数据,学习精度和速度有较大改进.

  19. Ant Colonies Do Not Trade-Off Reproduction against Maintenance.

    Directory of Open Access Journals (Sweden)

    Boris H Kramer

    Full Text Available The question on how individuals allocate resources into maintenance and reproduction is one of the central questions in life history theory. Yet, resource allocation into maintenance on the organismic level can only be measured indirectly. This is different in a social insect colony, a "superorganism" where workers represent the soma and the queen the germ line of the colony. Here, we investigate whether trade-offs exist between maintenance and reproduction on two levels of biological organization, queens and colonies, by following single-queen colonies of the ant Cardiocondyla obscurior throughout the entire lifespan of the queen. Our results show that maintenance and reproduction are positively correlated on the colony level, and we confirm results of an earlier study that found no trade-off on the individual (queen level. We attribute this unexpected outcome to the existence of a positive feedback loop where investment into maintenance (workers increases the rate of resource acquisition under laboratory conditions. Even though food was provided ad libitum, variation in productivity among the colonies suggests that resources can only be utilized and invested into additional maintenance and reproduction by the colony if enough workers are available. The resulting relationship between per-capita and colony productivity in our study fits well with other studies conducted in the field, where decreasing per-capita productivity and the leveling off of colony productivity have been linked to density dependent effects due to competition among colonies. This suggests that the absence of trade-offs in our laboratory study might also be prevalent under natural conditions, leading to a positive association of maintenance, (= growth and reproduction. In this respect, insect colonies resemble indeterminate growing organisms.

  20. 一种蚁群优化的WSN分布式入侵检测模型%Distributed intrusion detection model based on ant colony optimization for wireless sensor networks

    Institute of Scientific and Technical Information of China (English)

    余小华; 黄灿辉; 陈瑛

    2012-01-01

    针对无线传感器网络中入侵者能在多个节点上移动并隐藏攻击源头的特点,提出了一种基于蚁群优化的无线传感器网络分布式入侵检测模型.分析了现有入侵检测对未知攻击检测率和误报率方面的不足,在此基础上提出了分布式入侵检测的体系结构,设计了基于蚁群优化的入侵检测算法.仿真实验表明提出的方案能够提高无线传感器网络对未知攻击的检测率和降低对正常网络流量的误报率,较好地解决了路由攻击、Sinkhole攻击问题,能够降低入侵检测的能耗.%Considering wireless sensor network for intruders to move on multiple nodes and hide the source of the attacks, a distributed intrusion detection model based on ant colony optimization is proposed for wireless sensor networks. The drawback of the existing intrusion detection for unknown attack detection rate and false-positive rate is analyzed. A distributed intrusion detection architecture is put forward and designed based on ant colony optimization algorithm for intrusion detection. Simulation results show that the proposed scheme can improve the intrusion detection accuracy rate of the unknown attack, and reduce the false-positive rate of normal network traffic, solve the problem of routing attacks and Sinkhole attacks, as well as reduce energy consumption for intrusion detection in wireless sensor networks.

  1. Order Picking Optimization of Automated Warehouses Based on the Ant Colony Genetic Algorithm%基于蚁群遗传算法的自动化立体仓库拣选路径优化

    Institute of Scientific and Technical Information of China (English)

    庞龙; 陆金桂

    2012-01-01

    Optimizing the order picking is a useful way to improve the efficiency of automated warehouses. According to analyzing the process and characteristics of picking in automated warehouses, a new mathematic model is proposed for automated warehouses. Firstly, we make an excellent initial population by the ant colony algorithm, and then optimize and solve the model with the genetic algorithms. The simulation results show that the model is feasible, and the mix of the ant colony and genetic algorithms is not only feasible but also accelerate the speed of the algorithm, and then improve the efficiency of order picking.%合理优化货物的拣选路径是提高自动化立体仓库运行效率的一种有效方法.通过分析自动化立体仓库拣选作业的工作流程与特点,为自动化仓库拣选作业建立优化数学模型,首先利用蚁群算法生成优异的初始种群,然后通过遗传算法对该数学模型进行优化求解.仿真结果表明该模型是可行的,蚁群遗传算法的混合不仅得到更精确的结果而且加速了算法的求解速度,从而能够改善拣选作业的效率.

  2. 结合局部优化的蚁群优化算法的研究与实现%Research and Implementation of Ant Colony Optimization Algorithm Combining with Local Optimization

    Institute of Scientific and Technical Information of China (English)

    刘景巍; 张迪; 唐向辉; 曲大鹏

    2014-01-01

    蚁群算法是一种成功的启发式算法,但在解决TSP问题时存在着收敛速度慢和易陷入局部最优解的问题。本文针对这两个问题,提出了定期交流和模范带头学习模型,前者是在蚂蚁每走过一定城市后,进行学习交流,选出所走路径相对较短的蚂蚁进行信息素影响,从而加快总体的收敛速度;后者是当所有蚂蚁都旅行一圈后,选出最优秀的蚂蚁,在其走过的路径上释放大量信息素,对下一周期蚂蚁的旅行进行引导,避免陷入局部最优解。实验结果表明新算法在求解质量上比传统蚁群算法有了明显提高。本文也通过实验分析了蚂蚁数量等参数对算法性能的影响。%Ant colony algorithm is a successful heuristic algorithm, but it has two disadvantages in solving Traveling Salesman Problem (TSP), that is slow convergence and easy to fall into local optima ion. In this paper, the authors propose a regular exchange model and an exemplary model of learning. The former is that each ant walking in certain cities, learning exchanges, the path chosen by the relatively short walk pheromone ant influence, thus speeding up the overall speed of convergence; the latter is that when all the ants are traveling around after selection of the most outstanding ants, release large amounts of pheromone on its path traversed for the next cycle of ants traveling to boot, to avoid falling into local optima. After comparison with the conventional ant colony algorithm found that the new algorithm has been significantly improved in the solution quality. The paper analyzes the influence of the parameters, such as ant population, on the algorithm performance.

  3. 蚁群优化支持向量机的物流需求预测%Logistics Demand Forecasting Based on Least Support Vector Machine Optimized by Ant Colony Optimization Algorithm

    Institute of Scientific and Technical Information of China (English)

    孙志刚

    2013-01-01

    In order to improve the forecasting accuracy of logistics demand,this paper puts forward a logistics demand forecasting model based on least support vector machines optirmized by ant colony op timization algorithm (ACOLSSVM).Firstly,the data of logistics demand are reconstructed,and then the complex nonlinear change rule of logistics demand is explained through LSSVM,and the parameters of LSSVM model are optimized by ACO,and lastly,the performance of mode are tested by logistics demand data.The simulation results show that ACO-LSSVM has improved the forecasting accuracy of logistics demand,and which is an effective method for logistics demand forecasting.%为了提高物流需求预测精度,针对物流需求的复杂变化特性,提出一种蚁群算法ACO)优化最小二乘支持向量机的(LSSVM)的物流需求预测模型(ACO-LSSVM).首先对物流需求数据进行重构,然后采用LSSVMY刻画物流需求的复杂非线性变化特性,并通过ACO算法优化选择LSSVM参数,采用物流需求预测实例对ACO-LSSVM性能进行测试.结果表明,ACO-LSSVM提高了物流需求预测精度,是一种有效的物流需求预测方法.

  4. An improved ant colony algorithm with diversified solutions based on the immune strategy

    OpenAIRE

    Qin, Ling; Pan, Yi; Chen, Ling; Chen, Yixin

    2006-01-01

    Background Ant colony algorithm has emerged recently as a new meta-heuristic method, which is inspired from the behaviours of real ants for solving NP-hard problems. However, the classical ant colony algorithm also has its defects of stagnation and premature. This paper aims at remedying these problems. Results In this paper, we propose an adaptive ant colony algorithm that simulates the behaviour of biological immune system. The solutions of the problem are much more diversified than traditi...

  5. Modal parameters estimation using ant colony optimisation algorithm

    Science.gov (United States)

    Sitarz, Piotr; Powałka, Bartosz

    2016-08-01

    The paper puts forward a new estimation method of modal parameters for dynamical systems. The problem of parameter estimation has been simplified to optimisation which is carried out using the ant colony system algorithm. The proposed method significantly constrains the solution space, determined on the basis of frequency plots of the receptance FRFs (frequency response functions) for objects presented in the frequency domain. The constantly growing computing power of readily accessible PCs makes this novel approach a viable solution. The combination of deterministic constraints of the solution space with modified ant colony system algorithms produced excellent results for systems in which mode shapes are defined by distinctly different natural frequencies and for those in which natural frequencies are similar. The proposed method is fully autonomous and the user does not need to select a model order. The last section of the paper gives estimation results for two sample frequency plots, conducted with the proposed method and the PolyMAX algorithm.

  6. AN ANT COLONY ALGORITHM FOR MINIMUM UNSATISFIABLE CORE EXTRACTION

    Institute of Scientific and Technical Information of China (English)

    Zhang Jianmin; Shen Shengyu; Li Sikun

    2008-01-01

    Explaining the causes of infeasibility of Boolean formulas has many practical applications in electronic design automation and formal verification of hardware. Furthermore,a minimum explanation of infeasibility that excludes all irrelevant information is generally of interest. A smallest-cardinality unsatisfiable subset called a minimum unsatisfiable core can provide a succinct explanation of infea-sibility and is valuable for applications. However,little attention has been concentrated on extraction of minimum unsatisfiable core. In this paper,the relationship between maximal satisfiability and mini-mum unsatisfiability is presented and proved,then an efficient ant colony algorithm is proposed to derive an exact or ncarly exact minimum unsatisfiable core based on the relationship. Finally,ex-perimental results on practical benchmarks compared with the best known approach are reported,and the results show that the ant colony algorithm strongly outperforms the best previous algorithm.

  7. 多叉树蚁群算法及在区位选址中的应用研究%An Ant Colony Algorithm Based on Multi-way Tree for Optimal Site Location

    Institute of Scientific and Technical Information of China (English)

    赵元; 张新长; 康停军

    2011-01-01

    Site location by brute-force method is difficult for optimization due to massive spatial data and huge solution space under the constraint condition of multi-objective and large spatial resolutions. In this study, an improved ant colony optimization (ACO) based on multi-way tree is introduced to solve site location problem. Better solutions can be obtained swiftly according to the density of pheromone the ants leave on the search paths constructed in nested subspaces divided by means of the multi-way tree algorithm. First, the algorithm derived from ACO is aiming to search for an optimal path in space regardless of initial distribution, based on the behavior of ants seeking a path at a specific probability. Second, the multi-way tree algorithm's growth rate between search size and spatial scale is logarithmic, so the cost of searching increases slowly as the size of its input grows. The study area, located in Guangzhou city, is a densely populated region. The raster layers have a resolution of 92 m×92 m with a size of 512 × 512 pixels. This optimization problem consists of two factors:population distribution and spatial distance. Comparison experiment between ACO based on multi-way tree and the simple search algorithm indicates that this method can produce closely related results with a greater convergence rate and spend less computing time. In conclusion,the proposed algorithm is important and suitable for solving site search problems.%本文提出了基于多叉树蚁群算法(ant colony optimization based on multi-way tree)的区位选址优化方法.在多目标和大型空间尺度约束条件下,地理区位选址的解决方案组合呈现海量规模、空间搜索量庞大,难以求出理想解.基于多叉树的蚁群算法对地理空间进行多叉树划分,在多叉树的层上构造蚂蚁路径(ant path),让蚂蚁在多叉树的搜索路径上逐步留下信息素,借助信息素的通讯来间接协作获得理想的候选解.采用该方法用于

  8. Reconstructing Amino Acid Interaction Networks by an Ant Colony Approach

    OpenAIRE

    Gaci, Omar; Balev, Stefan

    2009-01-01

    In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. We consider the problem of reconstructing protein's interaction network from its amino acid sequence. We rely on a probability that two amino acids interact as a function of their physico-chemical properties coupled to an ant colony system to solve this problem.

  9. Cooperation-based Ant Colony Algorithm in WSN

    Directory of Open Access Journals (Sweden)

    Jianbin Xue

    2013-04-01

    Full Text Available This paper proposed a routing algorithm based on ant colony algorithm. The traditional ant colony algorithm updates pheromone according to the path length, to get the shortest path from the initial node to destination node. But MIMO system is different from the SISO system. The distance is farther but the energy is not bigger. Similarly, the closer the distance, the smaller the energy is not necessarily. So need to select the path according to the energy consumption of the path. This paper is based on the energy consumption to update the pheromone which from the cluster head node to the next hop node. Then, can find a path which the communication energy consumption is least. This algorithm can save more energy consumption of the network. The simulation results of MATLAB show that the path chosen by the algorithm is better than the simple ant colony algorithm, and the algorithm can save the network energy consumption better and can prolong the life cycle of the network.

  10. Research of BP neural network optimizing method based on Ant Colony Algorithm%一种基于蚁群算法的BP神经网络优化方法研究

    Institute of Scientific and Technical Information of China (English)

    王沥; 邝育军

    2012-01-01

    BP 神经网络是人工神经网络中应用最广泛的一种多层前馈神经网络。针对它容易陷入局部极小值及隐层节点大多利用经验试凑来确定的缺点,本文提出了一种基于蚁群算法的BP神经网络结构及参数优化方法,利用蚁群算法的全局寻优能力克服BP神经网络存在的不足。最后,将该方法用于短时交通流预测,实验结果表明:利用蚁群算法优化神经网络是有效的,预测结果也有较高精度。%BP neural network is the most widely used multilayer feedforward artificial neural networks, however,it is vulnerable to be trapped in local minimum and there is no systematic method to determine the number of hidden layer nodes thus usually done empirically. This paper introduces a method to optimize the structure and parameters of BP neural network which integrates ant colony algorithm with BP neural network to overcome shortcomings of traditional BP neural networks. The proposed method has been applied in short-term traffic flow forecasting. Simulation results demonstrate that the new BP neural network based on ant colony algorithm is more effective and can provide higher precision in traffic flow forecasting.

  11. 基于All-In-Roulette选择算法的GPU并行加速蚁群优化算法%Parallel Ant Colony Optimization Algorithm with GPU-Acceleration Based on All-In-Roulette Selection

    Institute of Scientific and Technical Information of China (English)

    付杰; 周国华

    2011-01-01

    蚁群优化算法应用于复杂问题的求解是非常耗时的.文章在MATLAB环境下实现了一个基于GPU+CPU的并行MAX-MIN蚁群系统,并将其应用于旅行商问题的求解.让全部蚂蚁共享一个伪随机数矩阵,一个信息素矩阵,一个禁忌矩阵和一个概率矩阵,并运用了一个全新的基于这些矩阵的随机选择算法-AIR(All-In-Roulette).文章还介绍了如何使用这些矩阵来构造并行蚁群优化算法,并与相应串行算法进行了比较.计算结果表明新的并行算法比相应串行算法要高效很多.%Ant colony optimization is computationally expensive when it comes to complex problems. This paper presents and implements a parallel MAX-MIN Ant System(MMAS) based on a GPU+CPU hardware platform under the MATLAB environment solve Traveling Salesman Problem(TSP). The key idea is to let all ants share only one pseudorandom number matrix, one pheromone matrix, one taboo matrix, and one probability matrix. A new selection approach based on those matrices, named AIR(All-In-Roulette) has been used. The main contribution of this paper is the description of how to design parallel MMAS based on those ideas and the comparison to the relevant sequential version. The computational results show that our parallel algorithm is much more efficient than the sequential version.

  12. An ant colony algorithm for the sequential testing problem under precedence constraints

    OpenAIRE

    Çatay, Bülent; Catay, Bulent; Özlük, Özgür; Ozluk, Ozgur; Ünlüyurt, Tonguç; Unluyurt, Tonguc

    2008-01-01

    We consider the problem of minimum cost sequential testing of a series (parallel) system under precedence constraints that can be modeled as a nonlinear integer program. We develop and implement an ant colony algorithm for the problem. We demonstrate the performance of this algorithm for special type of instances for which the optimal solutions can be found in polynomial time. In addition, we compare the performance of the algorithm with a special branch and bound algo...

  13. The Role of Non-Foraging Nests in Polydomous Wood Ant Colonies

    OpenAIRE

    Samuel Ellis; Robinson, Elva J. H.

    2015-01-01

    A colony of red wood ants can inhabit more than one spatially separated nest, in a strategy called polydomy. Some nests within these polydomous colonies have no foraging trails to aphid colonies in the canopy. In this study we identify and investigate the possible roles of non-foraging nests in polydomous colonies of the wood ant Formica lugubris. To investigate the role of non-foraging nests we: (i) monitored colonies for three years; (ii) observed the resources being transported between non...

  14. TABU SEARCH SEBAGAI LOCAL SEARCH PADA ALGORITMA ANT COLONY UNTUK PENJADWALAN FLOWSHOP

    Directory of Open Access Journals (Sweden)

    Iwan Halim Sahputra

    2009-01-01

    Full Text Available Ant colony optimization (ACO is one of the meta-heuristic methods developed for finding solutions to optimization problems such as scheduling. Local search method is one part of the ACO which determines the quality of the resulting solution. In this paper, Tabu Search was proposed as a method of local search in ACO to solve the problem of flowshop scheduling. The purpose of this scheduling was to minimize the makespan. Makespan and computation time of the proposed method were compared to the ACO that implemented Job-Index as local search method. Using proposed algorithm, makespan values obtained were not significantly different than solutions of ACO using Job-Index method, and had computation time shorter. Abstract in Bahasa Indonesia: Ant colony optimization (ACO adalah salah satu metode meta-heuristic yang dikembangkan untuk mencari solusi bagi permasalahan optimasi seperti penjadwalan. Metode local search merupakan salah satu bagian dari ACO yang menentukan kualitas solusi yang dihasilkan. Dalam makalah ini Tabu Search diusulkan sebagai metode local search dalam algoritma ACO untuk menyelesaikan masalah penjadwalan flowshop. Tujuan dari penjadwalan ini adalah untuk meminimalkan makespan. Hasil makespan dan computation time dari metode usulan ini akan dibandingkan dengan algoritma ACO yang menggunakan Job-Index sebagai metode local search. Dengan menggunakan algoritma Tabu Search sebagai local search didapat nilai makespan yang tidak berbeda secara signifikan dibandingkan yang menggunakan metode Job-Index, dengan kelebihan computation time yang lebih singkat. Kata kunci: Tabu Search, Ant Colony Algorithm, Local Search, Penjadwalan Flowshop.

  15. Ant colony system (ACS with hybrid local search to solve vehicle routing problems

    Directory of Open Access Journals (Sweden)

    Suphan Sodsoon

    2016-02-01

    Full Text Available This research applied an Ant Colony System algorithm with a Hybrid Local Search to solve Vehicle Routing Problems (VRP from a single depot when the customers’ requirements are known. VRP is an NP-hard optimization problem and has usually been successfully solved optimum by heuristics. A fleet of vehicles of a specific capacity are used to serve a number of customers at minimum cost, without violating the constraints of vehicle capacity. There are meta-heuristic approaches to solve these problems, such as Simulated Annealing, Genetic Algorithm, Tabu Search and the Ant Colony System algorithm. In this case a hybrid local search was used (Cross-Exchange, Or-Opt and 2-Opt algorithm with an Ant Colony System algorithm. The Experimental Design was tested on 7 various problems from the data set online in the OR-Library. There are five different problems in which customers are randomly distributed with the depot in an approximately central location. The customers were grouped into clusters. The results are evaluated in terms of optimal routes using optimal distances. The experimental results are compared with those obtained from meta-heuristics and they show that the proposed method outperforms six meta-heuristics in the literature.

  16. Dealing with water deficit in Atta ant colonies: large ants scout for water while small ants transport it

    Directory of Open Access Journals (Sweden)

    Antonio Carlos Da-Silva

    2012-07-01

    Leafcutter ants (Atta sexdens rubropilosa (Forel 1908 have an elaborate social organization, complete with caste divisions. Activities carried out by specialist groups contribute to the overall success and survival of the colony when it is confronted with environmental challenges such as dehydration. Ants detect variations in humidity inside the nest and react by activating several types of behavior that enhance water uptake and decrease water loss, but it is not clear whether or not a single caste collects water regardless of the cost of bringing this resource back to the colony. Accordingly, we investigated water collection activities in three colonies of Atta sexdens rubropilosa experimentally exposed to water stress. Specifically, we analyzed whether or not the same ant caste foraged for water, regardless of the absolute energetic cost (distance of transporting this resource back to the colony. Our experimental design offered water sources at 0 m, 1 m and 10 m from the nest. We studied the body size of ants near the water sources from the initial offer of water (time  =  0 to 120 min, and tested for specialization. We observed a reduction in the average size and variance of ants that corroborated the specialization hypothesis. Although the temporal course of specialization changed with distance, the final outcome was similar among distances. Thus, we conclude that, for this species, a specialist (our use of the word “specialist” does not mean exclusive task force is responsible for collecting water, regardless of the cost of transporting water back to the colony.

  17. The Relationship between Canopy Cover and Colony Size of the Wood Ant Formica lugubris - Implications for the Thermal Effects on a Keystone Ant Species

    OpenAIRE

    Yi-Huei Chen; Robinson, Elva J. H.

    2014-01-01

    Climate change may affect ecosystems and biodiversity through the impacts of rising temperature on species' body size. In terms of physiology and genetics, the colony is the unit of selection for ants so colony size can be considered the body size of a colony. For polydomous ant species, a colony is spread across several nests. This study aims to clarify how climate change may influence an ecologically significant ant species group by investigating thermal effects on wood ant colony size. The...

  18. Hybrid chaotic ant swarm optimization

    International Nuclear Information System (INIS)

    Chaotic ant swarm optimization (CASO) is a powerful chaos search algorithm that is used to find the global optimum solution in search space. However, the CASO algorithm has some disadvantages, such as lower solution precision and longer computational time, when solving complex optimization problems. To resolve these problems, an improved CASO, called hybrid chaotic swarm optimization (HCASO), is proposed in this paper. The new algorithm introduces preselection operator and discrete recombination operator into the CASO; meanwhile it replaces the best position found by own and its neighbors' ants with the best position found by preselection operator and discrete recombination operator in evolution equation. Through testing five benchmark functions with large dimensionality, the experimental results show the new method enhances the solution accuracy and stability greatly, as well as reduces the computational time and computer memory significantly when compared to the CASO. In addition, we observe the results can become better with swarm size increasing from the sensitivity study to swarm size. And we gain some relations between problem dimensions and swam size according to scalability study.

  19. Serial Monodomy in the Gypsy Ant, Aphaenogaster araneoides: Does Nest Odor Reduction Influence Colony Relocation?

    OpenAIRE

    McGlynn, Terry

    2010-01-01

    Serial monodomy is the nesting behavior in which a colony of animals maintains multiple nests for its exclusive use, occupying one nest at a time. Among serially monodomous ants, the availability of unoccupied nests reduces the probability and costs of army ant attacks. It has been proposed that nest odors mediate serial monodomy in the gypsy ant, Aphaenogaster araneoides Emery (Hymenoptera: Formicidae), and that colonies avoid returning to previously occupied nests that harbor colony odors. ...

  20. Joint Strength Based Ant Colony Optimization Clustering Algorithm for PPI Networks%基于连接强度的PPI网络蚁群优化聚类算法

    Institute of Scientific and Technical Information of China (English)

    雷秀娟; 黄旭; 吴爽; 郭玲

    2012-01-01

    由于PPI网络数据的无尺度和小世界特性,使得目前对此类数据的聚类算法效果不理想.根据PPI网络的拓扑结构特性,本文提出了一种基于连接强度的蚁群优化(Joint Strength based Ant Colony Optimization,JSACO)聚类算法,该算法引入了连接强度的概念对蚁群聚类算法中的拾起/放下规则加以改进,以连接强度作为拾起规则,对结点进行聚类,并根据放下规则放弃部分不良数据,产生最终聚类结果.最后采用了MIPS数据库中的PPI数据进行实验,将JSACO算法与PPI网络数据的其他聚类算法进行比较,聚类结果表明JSACO算法正确率高,时间开销低.%Due to the sale-free and small-world characters of Protein-Protein Interaction (PPI) network data,current clustering algorithms did not perform well.According to the topological structural characters of PP1 networks,this paper proposed an ant colony optimization clustering algorithm based on joint strength (JSACO).This method modified the pickup/drop rules of ACO algorithm by means of introducing the concept of joint strength,which regarded the joint strength as pickup rule to cluster the protein nodes.In addition,the protein nodes which had the low joint strength were abandoned in accordance with drop rule and the final clustering result was obtained.Finally the PP1 data in MIPS database was used to test the algorithm and the clustering result was compared with other PPI clustering methods.The simulation results show that JSACO algorithm performs better in terms of precision value and consumes less time.

  1. Layout optimization of a satellite module using a parallel genetic-Powell-ant colony hybrid algorithm%用并行遗传/Powell/蚁群混合算法求解卫星舱布局问题

    Institute of Scientific and Technical Information of China (English)

    霍军周; 李广强; 滕弘飞

    2006-01-01

    The problem of the layout design of a satellite module (LDSM) belongs to NP-hard problem in mathematics;one effectie way to sole this problem is to explore hybrid eolutionary algorithms. Based on the framework of parallel genetic algorithm (PGA), a parallel genetic-Powell-ant colony hybrid algorithm (PGPAHA) is gien, in which the migration moment of sub-populations is decided according to their conergence rate, and Powell method is taken as one of operator of PGA to accelerate their conergence rate at the later period of the searching, then ant colony optimization (ACO) algorithm is used to enhance the computational accuracy. The gien algorithm is used to sole optimal layout design of a simplified international commercial communication satellite module. The numerical experiment results show that the gien algorithm is superior to the PGA in computational precision, efficiency and stability.%卫星舱布局优化设计问题数学上属NP-hard问题. 较有效的求解途径之一是研究混合算法,为此构造了并行混合PGA-Powell-蚁群算法(简称PGPAHA). 该算法以并行遗传算法为基本框架,根据各子群体收敛速率的快慢来决定它们之间迁移的时机,在收敛后期加入Powell法作为并行遗传算法的算子来加快收敛速度,并利用蚁群优化算法提高计算的精度. 最后应用该算法求解了简化的三维带性能约束的国际商用通讯卫星的卫星舱布局设计问题,数值实验结果表明,该算法与并行遗传算法(PGA)相比,在计算精度、计算效率及计算稳定性方面较优.

  2. Feature selection for surface electromyography signal based on ant colony optimization%基于蚁群算法的表面肌电信号特征选择

    Institute of Scientific and Technical Information of China (English)

    黄虎; 谢洪波

    2012-01-01

    Objective To improve the classification performance of the surface electromyography (Semg) -based prosthesis and reduce the dimensions of features extracted from the Semg signals, a modified ant colony optimization (ACO) was employed to select the best feature subset. Methods The relationship between features and target classes was calculated as the heuristic function and the best feature subset was selected by ACO, and the trained artificial nerve net was utilized to verify the classification performance. Results Ten healthy subjects participated in the experiment on classification of hand and wrist motion using Semg signals. Compared to the principle component analysis (PCA) -based feature subsets, the ACO-reduced feature subsets not only improved the classification accuracy but greatly reduced the number of features in the original feature set, which subsequently simplified the structure of the classifier and reduced the computational cost. Conclusions The proposed method exhibits a great potential in the real-time applications, such as Semg-based prosthesis control.%目的为提高假肢系统对动作信号的识别速度,设计了基于优化蚁群算法(ant colony optimization,ACO)的特征选择法,对表面肌电信号(surface electromyography,sEMG)高维特征向量降维以减少计算负担.方法 以特征与目标类型之间互信息关系作为启发函数,通过蚁群算法选出最佳特征子集,最后用已训练好的人工神经网络检验其分类性能.结果 对10名健康受试者进行了手腕部动作的肌电信号模式分类实验.与传统主成分分析法(principle component analysis,PCA)相比,该算法选出的特征子集提高了识别准确率,并显著降低了原始特征集的特征维数,进而简化分类器的结构,减少计算开销.结论 本方法在实时性要求高的肌电控制假肢等系统中具有良好的应用前景.

  3. Stacking sequence optimization of filament wound composite case based on ant colony algorithm%基于蚁群算法的复合材料缠绕壳体铺层顺序优化

    Institute of Scientific and Technical Information of China (English)

    栾宇; 丁文辉; 林天军; 王路仙; 关振群

    2011-01-01

    In order to improve the buckling stability, this paper employs the methodology of solving salesman traveling problems by ant colony algorithm to optimize the stacking-sequence of the filament wounded case.First, this paper explains the essence of stacking sequence optimization is adjusting the stiffness distribution along the thickness direction to improve the bending stiffness and the load path, thru which the stability of the composite structure can be enhanced.Then, an automatic grouping and coding technique is proposed, which adapts the classic ant colony algorithm to the process technics constraint and improves the computational efficiency by reducing the number of cities.The validity and the superiority of the method are verified via a classic example.Finally, the program developed has been successfully used to improve the buckling stability of a composite case.%为了提高纤维复合材料缠绕壳体结构的屈曲稳定性,本文将蚁群算法(ACA)求解旅行商问题(TSP)的方法引入到缠绕层顺序优化的计算中.阐明铺层顺序优化的本质是调整沿板厚方向的刚度分布以提高版的抗弯刚度,同时改善荷载的传递路径,以降低由偏心而产生的附加弯矩,从而提高结构的抗屈曲能力;扩展了经典蚁群算法,提出一种分组编解码方法,既可描述缠绕工艺对铺层排列组合的约束,又可降低城市数目以提高优化效率;通过与经典算例的比较,验证了本文方法的有效性和优越性;并研发了复合材料缠绕壳体铺层顺序优化程序系统,实现了壳体结构的屈曲稳定性优化设计.

  4. AGNOSCO - Identification of Infected Nodes with artificial Ant Colonies

    CERN Document Server

    Hilker, Michael

    2008-01-01

    If a computer node is infected by a virus, worm or a backdoor, then this is a security risk for the complete network structure where the node is associated. Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of support for the identification of such infected nodes but suffer from the need of plenty of communication and computational power. In this article, we present a novel approach called AGNOSCO to support the identification of infected nodes through the usage of artificial ant colonies. It is shown that AGNOSCO overcomes the communication and computational power problem while identifying infected nodes properly.

  5. 基于遗传蚁群混合算法的孔群加工路径优化%Holes Machining Path Optimization Based on a Hybrid Algorithm Integrated Genetic Algorithm with Ant Colony Optimization

    Institute of Scientific and Technical Information of China (English)

    王春香; 郭晓妮

    2011-01-01

    In order to improve the efficiency of holes NC machining, with the shortest path to holes machining as the objective function, a hybrid algorithm (HA) integrated genetic algorithm (GA) with ant colony optimization (ACO) for solving holes machining path optimization was studied. The GA was run first and then ACO in the hybrid algorithm. A new strategy called GSA was proposed aiming at the key link in the "HA" that converted genetic solution from GA into information pheromone to distribute in ACO. The new matrix was taken by the GSA, which was formed by the combination of the former 90% of individual from genetic solution and 10% of individual by random generation as the basis of transformation of pheromone value. The best combination of genetic operators in GA was also discussed. The experimental results show that with the traditional processing route by numbers compared, by the HA using optimal combination operator and GSA transformation strategy, the length can be shortened for 70. 9% , and has higher precision than a single genetic algorithm. The NC machining efficiency of holes can be obviously improved theoretically.%为了提高孔群的数控加工效率,以孔群加工路径最短为目标函数,采用遗传蚁群混合算法对孔群加工路径规划问题进行研究.该混合优化算法的前期采用遗传算法、后期采用蚁群算法.在遗传算法向蚁群算法转换过程中,提出一种GSA遗传解到信息素转化策略.该策略以在遗传解endpop中选取前90%个个体和再随机产生的10%个个体合并后组成的新矩阵作为信息素值的转化依据;同时探讨了遗传算法中遗传算子的最佳组合问题.实例计算结果表明:与传统分批按编号加工的路径相比较,采用最佳组合算子和GSA转化策略后的遗传蚁群混合算法求解问题所获得的孔群加工路径缩短了70.9%,比单一遗传算法具有更高的求解精度,理论上可以明显地提高孔群的数控加工效率.

  6. 基于改进蚁群算法的梯式轨道多目标优化研究%Multi-objective optimization for ladder track based on improved ant colony algorithm

    Institute of Scientific and Technical Information of China (English)

    金浩; 刘维宁

    2014-01-01

    鉴于梯式轨道在实际应用过程中,需要同时优化钢轨振动加速度和道床振动加速度,利用MO-FHACO(多目标觅食-返巢机制连续域蚁群算法)对其进行双目标优化。利用四端参数法建立对应的梯式轨道数学模型,将1~80 Hz频段钢轨振动加速度级和道床振动加速度级作为优化目标,枕下减振垫刚度和数量作为设计变量。经过MO-FHACO双目标优化,成功得到梯式轨道双目标优化解。结果表明,采用MO-FHACO对梯式轨道进行多目标优化具有工程应用价值。%In order to optimize rail vibration acceleration and foundation vibration acceleration for the ladder track, MO-FHACO(multi-objective foraging-homing ant colony algorithm)is employed in this paper. The ladder track is sim-plified using four-pole parameter method. Vibration acceleration level of rail and vibration acceleration level of foundation ranging from 1 Hz to 80 Hz are set objective functions. Stiffness and number of sleeper bearings are set designing variables. After several optimizations by MO-FHACO, optimization solutions of bi-objective for the ladder track are obtained. Results show that, it’s an efficient method for multi-objective optimization of the ladder track with MO-FHACO.

  7. Optimization for members of concrete -filled steel tube based on improved Ant Colony Algorithm%基于改进蚁群算法的钢管混凝土构件的优化

    Institute of Scientific and Technical Information of China (English)

    周书敬; 潘靖

    2011-01-01

    The volatile coefficient was adjusted according to the defect of slow convergence rate and trapping in local optimum of Ant Colony Algorithm ( ACA). Volatile coefficient was initially endowed with a greater value to make the ants search for the better path, later, was decreased and self-adjusted by degrees to avoid the local convergence and obtain the global optimal path. The improved algorithm was used for the optimization design of concrete - filled steel tubular structure and the design model was established, in which the design parameter is section' s character and the aiming function is the minimal cost. The pure flexural and axial - compressed members of concrete - filled steel tubular structure were used as the examples which were optimized for the design model. The results were compared with the ones of improved Genetic Algorithm in literate [4]. The results showed that the column and the beam obtained the global optimal solution after 58 and 52 iterations separately. The algorithm jumped out of the analysis of the complicated - interactive mechanism between steel tube and confined - concrete, was simple and efficient.%针对基本蚁群算法收敛速度慢和容易陷入局部最优的不足,在算法初期赋予挥发系数一个较大的初始值,使蚂蚁搜索到较优路径;后期不断减小和自调整挥发系数,避免局部收敛,在搜索到的较优路径中获得全局最优路径.将改进后的蚁群算法应用到钢管混凝土构件的优化设计中,建立了以梁、柱构件截面特征为设计变量,造价最低为目标函数的优化设计模型.以钢管混凝土纯弯、轴压构件为例,进行模型优化分析,并与文献[4]中改进遗传算法的优化结果进行对比.结果表明,柱和梁分别在58次和52次迭代后求得较好的全局最优解,算法跳过了钢管与套箍混凝土之间复杂作用机理的分析,简单高效.

  8. 附带翻转工位双边装配线蚁群算法优化设计%Ant Colony Optimization for two sided assembly line balancing with station flipping task

    Institute of Scientific and Technical Information of China (English)

    朱小平; 张则强

    2014-01-01

    双边装配线应用广泛,翻转工位操作能有效降低部分零件装配难度与操作风险,但增加了设计难度。基于此,研究了附带翻转工位操作的挖掘机底盘双边装配线规划设计问题,针对该问题提出了一种改进蚁群算法求解。给出了问题求解的启发式任务分配规则,提出可采用启发式任务选择规则以提高算法收敛速率。进而分析某型挖掘机底盘装配线得出先后约束关系图,将问题抽象为双边装配线优化设计问题。随后,采用两种蚁群算法进行附带翻转工位的装配线优化,分析比较了两种算法因结构差异对优化结果所造成的影响。%An improved ant colony optimization is proposed for solving the two sided excavator chassis’s assembly lines with station flipping tasks. The flipping task can decrease the assembly difficulty and operational risk but will greatly in-crease the planning and design difficulty. A heuristic task assignment method is presented for solving distributing the station flipping tasks. The heuristic task selection method is used to accelerate to find a feasible solution. The tasks’priority diagram is proposed after studying the assembly relationship between the tasks and the problem is abstracted into two sided assembly line balancing problem. The standard and improved ant colony algorithms are used for contradistinction on solving this problem. And this paper studies the inference brought by the inner structure of this two algorithms.

  9. Automatic Sea-route Generation Based on the Combination of Ant Colony Searching and Genetic Optimization%蚁群搜索与遗传优化结合的航线自动生成

    Institute of Scientific and Technical Information of China (English)

    李启华; 李晓阳; 吴国华

    2014-01-01

    This article researches an automatic sea-route generation problem,introduces grid settings and attribute structure of navigation area,discusses computational method and model of grid attribute,some issues including ant colony search strategy,genetic optimizing method and computation model of sea-route performance,route smoothing method and model are discussed. The feasibility of the method and the accuracy of the model are verified by a series of examples.%本文研究航线自动生成问题,介绍了海图网格的设置和网格的属性结构,讨论了网格属性的计算方法、模型,论述了蚁群搜索的策略,遗传优化的方法和航线性能计算模型,航线平滑的方法和模型,用示例验证了方法的可行性和模型的准确性。

  10. Ant Colony Based Node Disjoint Hybrid Multi-path Routing for Mobile Ad Hoc Network

    Directory of Open Access Journals (Sweden)

    B. Kalaavathi

    2008-01-01

    Full Text Available Mobile Ad hoc Networks are characterized by multi-hop wireless links, without any infrastructure and frequent node mobility. A class of ant colony based routing protocols has recently gained attention because of their adaptability to the network changes. AntHocNet is ant colony based hybrid algorithm, which combines reactive path setup with proactive path probing, maintenance and improvement. Multi-path routing represents a promising routing method for mobile ad hoc network. Multi-path routing achieves load balancing and is more resilient to route failures. This research introduces node disjoint multi-path property to AntHocNet routing algorithm. A virtual class room is one that can be established by using mobile devices and whose members can be dynamically added or removed. The implementation of virtual class room for lesson handling and query discussion using mobile ad hoc network is analyzed. The data are spread among the N (here N = 3 node disjoint routes from the beginning of the data transmission session. The performance metrics, average end-to-end delay, packet delivery ratio and load balancing have been analyzed for various pause times. The average end-to-end delay and packet delivery ratio have not varied significantly. Optimal load distribution is achieved by spreading the load among different node disjoint routes.

  11. 复杂网络簇结构探测——基于随机游走的蚁群算法%Ant Colony Optimization Based on Random Walk for Community Detection in Complex Networks

    Institute of Scientific and Technical Information of China (English)

    金弟; 杨博; 刘杰; 刘大有; 何东晓

    2012-01-01

    网络簇结构是复杂网络最普遍和最重要的拓扑属性之一,网络聚类问题就是要找出给定网络中的所有类簇.有很多实际应用问题可被建模成网络聚类问题.尽管目前已有许多网络聚类方法被提出,但如何进一步提高聚类精度,特别是在没有先验知识(如网络簇个数)的情况下如何发现合理的网络簇结构,仍是一个未能很好解决的难题.针对该问题,在马尔可夫随机游走思想的启发下,从仿生角度出发提出一种全新的网络聚类算法——基于随机游走的蚁群算法RWACO.该算法将蚁群算法的框架作为RWACO的基本框架,对于每一代,以马尔可夫随机游走模型作为启发式规则;基于集成学习思想,将蚂蚁的局部解融合为全局解,并用其更新信息素矩阵.通过“强化簇内连接,弱化簇间连接”这一进化策略,使网络簇结构逐渐地呈现出来.实验结果表明,对一些典型的计算机生成网络和真实网络,该算法能够较准确地探测出网络的真实类簇数与一些有代表性的算法相比,具有较高的聚类精度.%Community structure is one of the most important topological properties in complex networks. The network clustering problem (NCP) refers to the detection of network community structures, and many practical problems can be modeled as NCPs. So far, lots of network clustering algorithms have been proposed. However, further improvements in the clustering accuracy, especially when discovering reasonable community structure without prior knowledge, still constitute an open problem. Building on Markov random walks, the paper addresses this problem with a novel ant colony optimization strategy, named as RWACO, which improves prior results on the NCPs and does not require knowledge of the number of communities present on a given network. The framework of ant colony optimization is taken as the basic framework in the RWACO algorithm. In each iteration, a Markov

  12. Pupae transplantation to boost early colony growth in the weaver ant Oecophylla longinoda Latreille (Hymenoptera: Formicidae)

    DEFF Research Database (Denmark)

    Ouagoussounon, Issa; Sinzogan, Antonio; Offenberg, Joachim;

    2013-01-01

    Oecophylla ants are currently used for biological control in fruit plantations in Australia, Asia and Africa and for protein production in Asia. To further improve the technology and implement it on a large scale, effective and fast production of live colonies is desirable. Early colony development...... capita brood production by the resident queen, triggered by the adopted pupae. Thus pupae transplantation may be used to shorten the time it takes to produce weaver ant colonies in ant nurseries, and may in this way facilitate the implementation of weaver ant biocontrol in West Africa....

  13. Application of chaotic ant swarm optimization in electric load forecasting

    International Nuclear Information System (INIS)

    Support vector regression (SVR) had revealed strong potential in accurate electric load forecasting, particularly by employing effective evolutionary algorithms to determine suitable values of its three parameters. Based on previous research results, however, these employed evolutionary algorithms themselves have several drawbacks, such as converging prematurely, reaching slowly the global optimal solution, and trapping into a local optimum. This investigation presents an SVR-based electric load forecasting model that applied a novel algorithm, namely chaotic ant swarm optimization (CAS), to improve the forecasting performance by searching its suitable parameters combination. The proposed CAS combines with the chaotic behavior of single ant and self-organization behavior of ant colony in the foraging process to overcome premature local optimum. The empirical results indicate that the SVR model with CAS (SVRCAS) results in better forecasting performance than the other alternative methods, namely SVRCPSO (SVR with chaotic PSO), SVRCGA (SVR with chaotic GA), regression model, and ANN model.

  14. Application of chaotic ant swarm optimization in electric load forecasting

    Energy Technology Data Exchange (ETDEWEB)

    Hong, Wei-Chiang [Department of Information Management, Oriental Institute of Technology, 58, Section 2, Sichuan Rd., Panchiao, Taipei County 220 (China)

    2010-10-15

    Support vector regression (SVR) had revealed strong potential in accurate electric load forecasting, particularly by employing effective evolutionary algorithms to determine suitable values of its three parameters. Based on previous research results, however, these employed evolutionary algorithms themselves have several drawbacks, such as converging prematurely, reaching slowly the global optimal solution, and trapping into a local optimum. This investigation presents an SVR-based electric load forecasting model that applied a novel algorithm, namely chaotic ant swarm optimization (CAS), to improve the forecasting performance by searching its suitable parameters combination. The proposed CAS combines with the chaotic behavior of single ant and self-organization behavior of ant colony in the foraging process to overcome premature local optimum. The empirical results indicate that the SVR model with CAS (SVRCAS) results in better forecasting performance than the other alternative methods, namely SVRCPSO (SVR with chaotic PSO), SVRCGA (SVR with chaotic GA), regression model, and ANN model. (author)

  15. Blind noisy image quality evaluation using a deformable ant colony algorithm

    Science.gov (United States)

    Chen, Li; Huang, Xiaotong; Tian, Jing; Fu, Xiaowei

    2014-04-01

    The objective of blind noisy image quality assessment is to evaluate the quality of the degraded noisy image without the knowledge of the ground truth image. Its performance relies on the accuracy of the noise statistics estimated from homogenous blocks. The major challenge of block-based approaches lies in the block size selection, as it affects the local noise derivation. To tackle this challenge, a deformable ant colony optimization (DACO) approach is proposed in this paper to adaptively adjust the ant size for image block selection. The proposed DACO approach considers that the size of the ant is adjustable during foraging. For the smooth image blocks, more pheromone is deposited, and then the size of ant is increased. Therefore, this strategy enables the ants to have dynamic food-search capability, leading to more accurate selection of homogeneous blocks. Furthermore, the regression analysis is used to obtain image quality score by exploiting the above-estimated noise statistics. Experimental results are provided to justify that the proposed approach outperforms conventional approaches to provide more accurate noise statistics estimation and achieve a consistent image quality evaluation performance for both the artificially generated and real-world noisy images.

  16. Power Efficient Resource Allocation for Clouds Using Ant Colony Framework

    CERN Document Server

    Chimakurthi, Lskrao

    2011-01-01

    Cloud computing is one of the rapidly improving technologies. It provides scalable resources needed for the ap- plications hosted on it. As cloud-based services become more dynamic, resource provisioning becomes more challenging. The QoS constrained resource allocation problem is considered in this paper, in which customers are willing to host their applications on the provider's cloud with a given SLA requirements for performance such as throughput and response time. Since, the data centers hosting the applications consume huge amounts of energy and cause huge operational costs, solutions that reduce energy consumption as well as operational costs are gaining importance. In this work, we propose an energy efficient mechanism that allocates the cloud resources to the applications without violating the given service level agreements(SLA) using Ant colony framework.

  17. Road Network Vulnerability Analysis Based on Improved Ant Colony Algorithm

    Directory of Open Access Journals (Sweden)

    Yunpeng Wang

    2014-01-01

    Full Text Available We present an improved ant colony algorithm-based approach to assess the vulnerability of a road network and identify the critical infrastructures. This approach improves computational efficiency and allows for its applications in large-scale road networks. This research involves defining the vulnerability conception, modeling the traffic utility index and the vulnerability of the road network, and identifying the critical infrastructures of the road network. We apply the approach to a simple test road network and a real road network to verify the methodology. The results show that vulnerability is directly related to traffic demand and increases significantly when the demand approaches capacity. The proposed approach reduces the computational burden and may be applied in large-scale road network analysis. It can be used as a decision-supporting tool for identifying critical infrastructures in transportation planning and management.

  18. Automatic fault extraction using a modified ant-colony algorithm

    International Nuclear Information System (INIS)

    The basis of automatic fault extraction is seismic attributes, such as the coherence cube which is always used to identify a fault by the minimum value. The biggest challenge in automatic fault extraction is noise, including that of seismic data. However, a fault has a better spatial continuity in certain direction, which makes it quite different from noise. Considering this characteristic, a modified ant-colony algorithm is introduced into automatic fault identification and tracking, where the gradient direction and direction consistency are used as constraints. Numerical model test results show that this method is feasible and effective in automatic fault extraction and noise suppression. The application of field data further illustrates its validity and superiority. (paper)

  19. 网络搜索中的“死胡同”现象及蚁群改进算法%The Problem of Blind Alley in Net Searching and an Improved Ant Colony Optimization with Backing

    Institute of Scientific and Technical Information of China (English)

    穆克; 陈涛; 褚俊霞; 葛延峰

    2013-01-01

    For the ant colony algorithms we discuss a phenomenon,that a single ant falls into the taboo table set up their own "loop"in a process of searching path,and propose an improved ant colony algorithm.In the new algorithm,if an ant falls into one blind alley,it can back and search another path,such that the success rate of search of ants is improved.We analyze parameters of the algorithm and compare with three other algorithms by simulation experiments.The result of experiments show that the new algorithm is effective.%针对网络搜索时常会出现蚂蚁陷入所设置的禁忌表中,无路可寻的现象,提出了所谓“死胡同”现象并加以解决,给出了基于返回思想的改进蚁群算法.当蚂蚁走进了死胡同后,沿着原路返回,并寻找其他的路径绕过死胡同,继续向目标位置搜索,以提高蚂蚁寻找路径的成功率.对改进蚁群算法的参数进行了实验分析,并与其他三种算法进行了比较,仿真结果验证了本文所提出方法的有效性.

  20. COLONY INSULARITY THROUGH QUEEN CONTROL ON WORKER SOCIAL MOTIVATION IN ANTS

    Science.gov (United States)

    We investigated the relative contribution of the queen and workers to colony nestmate recognition cues and on colony territoriality in the ant Camponotus fellah. Workers were either individually isolated, preventing contact with both queen and workers (Colony Deprived, CD), kept in queenless groups,...

  1. An improving hybrid ant colony optimization for solving incident traveling salesman problem%改进混合蚁群算法求解关联旅行商问题

    Institute of Scientific and Technical Information of China (English)

    朱君; 蔡延光; 汤雅连

    2014-01-01

    由于蚁群算法搜索初期信息匮乏,导致信息素累积时间长,求解速度慢,所以结合具有快速全局搜索能力的遗传算法,同时引入混沌搜索和平滑机制,采用混沌搜索产生初始种群可以克服生成大量非可行解的缺陷,加速染色体向最优解收敛,平滑机制有助于对搜索空间进行更有效的搜索,构成 IHACO。针对50个城市的关联旅行商问题,建立数学模型,应用 IHACO 与 PSOGA、ACO、GA 和 TS 求解 ITSP 和 TSP ,算例证明 IHACO 优于其他4种算法,能收敛到最优解,提高了进化效率,而由于关联因素的制约,解也发生了变化。通过应用 IHACO 和 ACO 求解 TSPlib 的3个算例,进一步证明了 IHACO 优于 ACO ,能搜索到近优解。%Due to lack of information when ant colony optimization (ACO) started to search at the early period, the accumulation time of pheromone is long, the speed of solving is slow, so combining genetic algorithm (GA) with rapid global search ability, at the same time, chaos search and smooth mechanism are introduced, initial population is generated by chaotic search can overcome the defect of generating a large number of infeasible solution, accelerating chromosome convergence to the optimal solution, moreover, a smooth mechanism helps to search for more effective search space, thus constituting an IHACO. Aiming at 50 cities incident traveling salesman problem (ITSP), to establish mathematical model, using IHACO, PSOGA, ACO, GA and TS to solve TSP and ITSP. The results of numerical examples prove that IHACO is better than the other four kinds of algorithms, it can also converge to the optimal solution and improve the efficiency of the evolution, because of the incident factor, solution have also changed. By applying IHACO and ACO to solve three examples of TSPlib, further prove IHACO is better than ACO, and it can search the near optimal solution.

  2. Demand elasticity algorithm for cloud computing based on ant colony optimization algorithm%基于蚁群算法的云计算需求弹性算法

    Institute of Scientific and Technical Information of China (English)

    范杰; 彭舰; 黎红友

    2011-01-01

    There is no corresponding standard of valuation for cloud computing at home for the moment, so the price directly affects the network's availability and profits. Traditional Ant Colony Optimization (ACO) algorithm can simulate the load of network, but it has some disadvantages in solving the problem of network congestion and load balance. As these problems above, an improved ACO algorithm was proposed. This algorithm considered the factor of price for network load when valuing. It utilized demand elasticity theory and controlled the load of network through price indirectly. And it solved the problem of low availability or decreased profits caused by computing congestion or resource unemployment. The experimental results indicate that the improved ACO algorithm achieves load balance of the whole network. Therefore, the lifetime of network system is prolonged and more profits can be made.%目前,国内并没有相应的云计算计价标准,价格高低直接影响网络利用率和收益.传统蚁群算法(AC0)能模拟网络负载情况,但在解决网络拥塞和负载均衡问题方面存在不足.针对以上问题,提出一种改进的蚁群算法,在计价时考虑价格因素对网络负载的影响,利用需求弹性理论,以价格手段间接控制网络负载,辅助解决计算拥塞或计算资源闲置导致的网络利用率低下和收益减少问题.实验表明,改进后的算法使整体网络负载均衡,延长了网络寿命并获得一定利润.

  3. WSN中基于改进蚁群算法的移动Agent路径规划%Ant Colony Optimization Algorithms-Based Routing Planning of Mobile Agent in WSN*

    Institute of Scientific and Technical Information of China (English)

    王佳

    2011-01-01

    在无线传感器网络(Wireless Sensor Networks,简写为WSN)系统中增加了移动Agent,能提高系统的整体性能及工作效率.参考Sink节点的功能及特点,移动Agent具有收集和简单处理信息数据并将其传输到上一级单位的功能,它的移动功能提高了网络的连通性、传感覆盖率及使用寿命等性能.采用传感覆盖率高,能耗相对较小的正六边形网格划分方法部署传感器节点.Sink节点只能在通信范围内收集信息,根据这一特点,在此网络结构中利用蚁群优化算法为移动Agent寻找移动路径,从而达到有效改善网络性能的目的.仿真结果说明了此方法的有效性及特点.%For the purpose of performance improvement of WSN ( Wireless Sensor Networks), mobile agent were considered, which are a kind of special nodes-sinks in charge of data collection in WSN. Mobility of agent can improve the performance of whole system, such as connectedness, sense coverage, and energy efficient. An effective structure of regular hexagonal grid plot is chosen, which is suitable for improving connectedness and sense coverage. A route planning for mobile agent is proposed by applying a well designed ant colony optimization algorithms. Finally, the advantages and effectiveness of mobile agent in WSN are illustrated by an example.

  4. T-QoS-aware based parallel ant colony algorithm for services composition

    Institute of Scientific and Technical Information of China (English)

    Lin Zhang; Kaili Rao; Ruchuan Wang

    2015-01-01

    In order to make cloud users get credible, high-quality composition of services, the trust quality of service aware (T-QoS-aware) based paral el ant colony algorithm is proposed. Our approach takes the service credibility as the weight of the quality of service, then calculates the trust service quality T-QoS for each service, making the service composition situated in a credible environment. Through the establishment on a per-service T-QoS initialization pheromone matrix, we can reduce the colony’s initial search time. By modifying the pheromone updating rules and intro-ducing two ant colonies to search from different angles in paral el, we can avoid fal ing into the local optimal solution, and quickly find the optimal combination of global solutions. Experiments show that our approach can combine high-quality services and the improve-ment of the operational success rate. Also, the convergence rate and the accuracy of optimal combination are improved.

  5. A New Constructive Method for Electric Power System Reconfiguration Using Ant Colony

    Directory of Open Access Journals (Sweden)

    Habib HAMDAOUI

    2008-06-01

    Full Text Available This electric power distribution system delivers power to the customers from a set of distribution substations. While the transmission lines are configured in a meshed network, the distribution feeders are configured radially in almost all cases. The proposed problem in this work is to determine the optimal topology among a various alternatives. This problem is known as a problem of total investment-cost minimization, subject to power constraints. In fact, the paper addresses an ant colony met-heuristic optimization method to solve this combinatorial problem. Due to the variation of demand, the reconfiguration may be considered in two different situations: in the system planning or system design stage. The proposed met-heuristic determines the minimal investment-cost system configuration during the considered study period to satisfy power transit constraints. The algorithm of ant colony approach (ACA is required to identify the optimal combination of adding or cut off feeders with different parameters for the new topology design.

  6. 3D sensor placement strategy using the full-range pheromone ant colony system

    Science.gov (United States)

    Shuo, Feng; Jingqing, Jia

    2016-07-01

    An optimized sensor placement strategy will be extremely beneficial to ensure the safety and cost reduction considerations of structural health monitoring (SHM) systems. The sensors must be placed such that important dynamic information is obtained and the number of sensors is minimized. The practice is to select individual sensor directions by several 1D sensor methods and the triaxial sensors are placed in these directions for monitoring. However, this may lead to non-optimal placement of many triaxial sensors. In this paper, a new method, called FRPACS, is proposed based on the ant colony system (ACS) to solve the optimal placement of triaxial sensors. The triaxial sensors are placed as single units in an optimal fashion. And then the new method is compared with other algorithms using Dalian North Bridge. The computational precision and iteration efficiency of the FRPACS has been greatly improved compared with the original ACS and EFI method.

  7. Ant colony clustering with fitness perception and pheromone diffusion for community detection in complex networks

    Science.gov (United States)

    Ji, Junzhong; Song, Xiangjing; Liu, Chunnian; Zhang, Xiuzhen

    2013-08-01

    Community structure detection in complex networks has been intensively investigated in recent years. In this paper, we propose an adaptive approach based on ant colony clustering to discover communities in a complex network. The focus of the method is the clustering process of an ant colony in a virtual grid, where each ant represents a node in the complex network. During the ant colony search, the method uses a new fitness function to percept local environment and employs a pheromone diffusion model as a global information feedback mechanism to realize information exchange among ants. A significant advantage of our method is that the locations in the grid environment and the connections of the complex network structure are simultaneously taken into account in ants moving. Experimental results on computer-generated and real-world networks show the capability of our method to successfully detect community structures.

  8. An Efficient Multi-criteria Routing Algorithm using Ant Colony with Colored Pheromones in Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Fatemeh Rismanian

    2013-07-01

    Full Text Available Considering the features of non-uniformly distributed traffic load and possibly existing of the traffics requiring different performance in wireless sensor networks, this study proposes , a novel routing protocol based on an improved Ant colony optimization routing algorithm. The algorithm concentrates on the provision of Quality of Service in multi-criteria routing algorithm such as hop count, energy consumption, resident power, bandwidth and end to end delay. These metrics are used by means of colored pheromones of the ant colony system. There are different ants with colored pheromones, which each color is for a level of service. Simulation experiments show that the proposed algorithm has many advantages comparing with existing algorithm: proposing different service classes such as Real time and Best effort traffic; achieve slower delay and longer lifetime; besides, the proposed method behaves more scalable and robust.

  9. A Novel Polymorphic Ant Colony -Based Clustering Mechanism for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Min Xiang

    2012-10-01

    Full Text Available In wireless sensor networks, sensor nodes are extremely power constrained, so energy efficient clustering mechanism is mainly considered in the network topology management. A new clustering mechanism based on the polymorphic ant colony (PAC is designed for dynamically controlling the networks clustering structure. According to different functions, the nodes of the networks are respectively defined as the queen ant, the scout ant and worker ant. Based on the calculated cost function and real-time pheromone, the queen ant restructures an optimum clustering structure. Furthermore, the worker ants and the scout ants can send or receive sensing data with optional communication path based on their pheromones. With the mechanism, the energy consumption in inter-cluster and intra-cluster communication for the worker ants and scout ants can be reduced. The simulation results demonstrate that the proposed mechanism can effectively remodel the clustering structure and improve the energy efficiency of the networks.

  10. An Improved Ant Colony Algorithm for a Single-machine Scheduling Problem with Setup Times

    Institute of Scientific and Technical Information of China (English)

    YE Qiang; LIU Xinbao; LIU Lin; YANG Shanglin

    2006-01-01

    Motivated by industrial applications we study a single-machine scheduling problem in which all the jobs are mutually independent and available at time zero. The machine processes the jobs sequentially and it is not idle if there is any job to be processed. The operation of each job cannot be interrupted. The machine cannot process more than one job at a time. A setup time is needed if the machine switches from one type of job to another. The objective is to find an optimal schedule with the minimal total jobs' completion time. While the sum of jobs' processing time is always a constant, the objective is to minimize the sum of setup times. Ant colony optimization (ACO) is a meta-heuristic that has recently been applied to scheduling problem. In this paper we propose an improved ACO-Branching Ant Colony with Dynamic Perturbation (DPBAC) algorithm for the single-machine scheduling problem. DPBAC improves traditional ACO in following aspects: introducing Branching Method to choose starting points; improving state transition rules; introducing Mutation Method to shorten tours; improving pheromone updating rules and introducing Conditional Dynamic Perturbation Strategy. Computational results show that DPBAC algorithm is superior to the traditional ACO algorithm.

  11. Information cascade, Kirman's ant colony model, and kinetic Ising model

    CERN Document Server

    Hisakado, Masato

    2014-01-01

    In this paper, we discuss a voting model in which voters can obtain information from a finite number of previous voters. There exist three groups of voters: (i) digital herders and independent voters, (ii) analog herders and independent voters, and (iii) tanh-type herders. In our previous paper, we used the mean field approximation for case (i). In that study, if the reference number r is above three, phase transition occurs and the solution converges to one of the equilibria. In contrast, in the current study, the solution oscillates between the two equilibria, that is, good and bad equilibria. In this paper, we show that there is no phase transition when r is finite. If the annealing schedule is adequately slow from finite r to infinite r, the voting rate converges only to the good equilibrium. In case (ii), the state of reference votes is equivalent to that of Kirman's ant colony model, and it follows beta binomial distribution. In case (iii), we show that the model is equivalent to the finite-size kinetic...

  12. Parallelization Strategies for Ant Colony Optimisation on GPUs

    CERN Document Server

    Cecilia, Jose M; Ujaldon, Manuel; Nisbet, Andy; Amos, Martyn

    2011-01-01

    Ant Colony Optimisation (ACO) is an effective population-based meta-heuristic for the solution of a wide variety of problems. As a population-based algorithm, its computation is intrinsically massively parallel, and it is there- fore theoretically well-suited for implementation on Graphics Processing Units (GPUs). The ACO algorithm comprises two main stages: Tour construction and Pheromone update. The former has been previously implemented on the GPU, using a task-based parallelism approach. However, up until now, the latter has always been implemented on the CPU. In this paper, we discuss several parallelisation strategies for both stages of the ACO algorithm on the GPU. We propose an alternative data-based parallelism scheme for Tour construction, which fits better on the GPU architecture. We also describe novel GPU programming strategies for the Pheromone update stage. Our results show a total speed-up exceeding 28x for the Tour construction stage, and 20x for Pheromone update, and suggest that ACO is a po...

  13. Obstacle avoidance planning of space manipulator end-effector based on improved ant colony algorithm.

    Science.gov (United States)

    Zhou, Dongsheng; Wang, Lan; Zhang, Qiang

    2016-01-01

    With the development of aerospace engineering, the space on-orbit servicing has been brought more attention to many scholars. Obstacle avoidance planning of space manipulator end-effector also attracts increasing attention. This problem is complex due to the existence of obstacles. Therefore, it is essential to avoid obstacles in order to improve planning of space manipulator end-effector. In this paper, we proposed an improved ant colony algorithm to solve this problem, which is effective and simple. Firstly, the models were established respectively, including the kinematic model of space manipulator and expression of valid path in space environment. Secondly, we described an improved ant colony algorithm in detail, which can avoid trapping into local optimum. The search strategy, transfer rules, and pheromone update methods were all adjusted. Finally, the improved ant colony algorithm was compared with the classic ant colony algorithm through the experiments. The simulation results verify the correctness and effectiveness of the proposed algorithm. PMID:27186473

  14. Channeler Ant Model: 3 D segmentation of medical images through ant colonies

    International Nuclear Information System (INIS)

    In this paper the Channeler Ant Model (CAM) and some results of its application to the analysis of medical images are described. The CAM is an algorithm able to segment 3 D structures with different shapes, intensity and background. It makes use of virtual and colonies and exploits their natural capabilities to modify the environment and communicate with each other by pheromone deposition. Its performance has been validated with the segmentation of 3 D artificial objects and it has been already used successfully in lung nodules detection on Computer Tomography images. This work tries to evaluate the CAM as a candidate to solve the quantitative segmentation problem in Magnetic Resonance brain images: to evaluate the percentage of white matter, gray matter and cerebrospinal fluid in each voxel.

  15. Diversity, prevalence and virulence of fungal entomopathogens in colonies of the ant Formica selysi

    OpenAIRE

    Reber A.; Chapuisat M.

    2012-01-01

    The richness of the parasitic community associated with social insect colonies has rarely been investigated. Moreover, understanding how hosts and pathogens interact in nature is important to interpret results from laboratory experiments. Here, we assessed the diversity, prevalence and virulence of fungal entomopathogens present around and within colonies of the ant Formica selysi. We detected eight fungal species known to be entomopathogenic in soil sampled from the habitat of ants. Six of t...

  16. A study into ant colony optimisation, evolutionary computation and constraint programming on binary constraint satisfaction problems.

    OpenAIRE

    Hemert, van, M.C.; Solnon, C.

    2004-01-01

    We compare two heuristic approaches, evolutionary computation and ant colony optimisation, and a complete tree-search approach, constraint programming, for solving binary constraint satisfaction problems. We experimentally show that, if evolutionary computation is far from being able to compete with the two other approaches, ant colony optimisation nearly always succeeds in finding a solution, so that it can actually compete with constraint programming. The resampling ratio is used to provide...

  17. An ant colony optimization algorithm for home security robot path planning%一种家庭安保机器人运动路径规划的蚁群算法

    Institute of Scientific and Technical Information of China (English)

    龙珑; 邓伟; 胡秦斌; 黄智海

    2012-01-01

    由于家庭居住环境复杂,家庭安保机器人导航问题难于解决。使用传统蚁群算法,家庭安保机器人容易陷入搜索家庭环境局部极值的困境,无法找出在复杂环境下家庭最优的运动路径。因此,家庭安保机器人设计方案引入混沌理论改良局部个体的质量,利用混沌扰动,能够避免家庭机器人陷入搜索家庭环境局部极值的困境,由最初的混沌行为过渡到群体智能行为,使家庭安保机器人找到最优的运动路径。经仿真实验表明,在复杂的家庭环境下,家庭安保机器人也可以安全避障。%Because domestic living environment is very complex, and family security robot navigation problems are very difficult to solve. It is difficult problem to research family security robot navigates in a complicated environment. If security robot uses the traditional colony ant algorithm, family security robot would search family environment in local extremes trouble, and could not find out the best path under the complex environment family. Therefore, this paper family security robot algorithm introduces chaos theo- ry to improve the quality of local individual, thus to avoid family robot to fall into searching family environment in local extremes trouble, and the initial chaos behavior transition swarms intelligence behavior, eventually family security robot find the optimal path of the movement. The simulation experiment shows that the robot can succeed avoid obstacle in complex family environment

  18. Aplicación del Método de la Colonia de Hormigas Mixto a la optimización de intercambiadores de calor de tubo y coraza//Application of the Mixed Ant Colony Method to the optimization of tube and shell heat exchangers

    Directory of Open Access Journals (Sweden)

    Maida Bárbara Reyes‐Rodríguez

    2014-05-01

    Full Text Available Los procesos de transferencia de calor sonuno de los problemas más importantes a resolver en el campo de la Ingeniería. Entre los equipos más usados en la industria para realizar la transferencia de calor están los intercambiadores de calor de tubo y coraza. En el presente trabajo se desarrolla el procedimiento para la optimización del diseño de estos equipos utilizando el método de Kern y aplicando el algoritmo de la colonia de hormigas. Se aplica el mismo a tres ejemplos concretos y los resultados obtenidos se comparan con los obtenidos aplicando otros métodos de la inteligencia artificial. Se optimizan los principales parámetros geométricos de los intercambiadores de calor de tubo y coraza para lograr un menor costo de los mismos. Se demuestra la eficacia del nuevo procedimiento MACO (Mixed Ant Colony Optimization, en el proceso de optimización desde el punto de vista económico utilizando diferentes casos de estudios.Palabras claves: intercambiadores de calor, colonia de hormigas, método de Kern.______________________________________________________________________________AbstractHeat transfer processes are one of the most important problems to be solved in the field of Engineering. Among the most widely used equipment for heat transfer in the industry are the shell and tube heat exchangers. This paper develops the procedure for optimizing the design of shell and tube heat exchangers using the method of Kern and applying the ant colony algorithm. The procedure has been applied to three specific examples and the results obtained are compared with those obtained by applying other methods of artificial intelligence. The main geometric parameters of shell and tube heat exchangers are optimized, to achieve a lower cost of the exchanger. The efficacy of the new procedure MACO (Mixed Ant Colony Optimization for the optimization process from economically point of view was demonstrated, using different case studies.Key words: heat

  19. Simulation of land use change of Erhai Lake Basin based on ant colony optimization%基于蚁群算法的洱海流域土地利用变化模拟

    Institute of Scientific and Technical Information of China (English)

    许泉立; 杨昆; 王桂林; 杨玉莲

    2014-01-01

    为了研究社会经济和城市化快速发展作用下的洱海流域土地利用/覆被变化过程,以促进流域用地结构与配置的优化。基于智能体建模理论,结合GIS的数据处理和空间分析技术,利用蚁群智能算法模拟土地利用变化。针对洱海流域的现状,该文选取流域土地利用变化的影响因子,建立了智能体分类体系及其行为决策规则;基于Java语言和Repast J建模平台,完成了模型的程序设计、实现、模拟过程;针对模型的模拟结果进行了分析和验证。结果表明:蚁群算法提升了智能体模型模拟结果的精度,且基本与实际情况的空间格局保持一致。基于模拟结果分析了未来10 a(2010-2020年)洱海流域的人地关系矛盾主要表现为农业生产性用地(耕地和园地)的持续性减少与建设用地的不断增长,现有政策下的城镇化用地成本呈上升趋势。而生态用地中,湿地的增长最快,表明政府的用地规划和策略对流域的生态用地保护起到较好的宏观调控作用。%Studies of Erhai Basin indicate that Land use change by human activities in the watershed is the leading cause of regional climate, hydrology, water quality and ecological changes. Therefore, it is necessary to study the relationships between human activities and land use/cover change (LUCC), which is beneficial to offer the scientific decision support for reasonable land planning and land use. Combined with GIS technologies of spatial analysis and using the artificial intelligence algorithm Ant Colony Optimization(ACO) for optimizing, in this paper, we applied the method of Agent-based modeling to establish the spatiotemporal process model of LUCC in order to simulating the dynamic change of land use in whole watershed. Firstly, we made a choice and evaluation for impact factors of land use changes, as well as constructions of the cost of land use change equations in order to

  20. Application of the ant colony search algorithm to reactive power pricing in an open electricity market

    International Nuclear Information System (INIS)

    Reactive power management is essential to transfer real energy and support power system security. Developing an accurate and feasible method for reactive power pricing is important in the electricity market. In conventional optimal power flow models the production cost of reactive power was ignored. In this paper, the production cost of reactive power and investment cost of capacitor banks were included into the objective function of the OPF problem. Then, using ant colony search algorithm, the optimal problem was solved. Marginal price theory was used for calculation of the cost of active and reactive power at each bus in competitive electric markets. Application of the proposed method on IEEE 14-bus system confirms its validity and effectiveness. Results from several case studies show clearly the effects of various factors on reactive power price. (author)