Scribd Logo
Unggah

Selamat datang di Scribd!

  • Optimization by Ant Colony Method

    Diunggah oleh

    Uday Wankar
    6 tayangan19 halaman
    The first ant colony optimization (ACO) called ant system was inspired through studying of the behaviour of ants in 1991 by Macro Dorigo and co-workers. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviours. Since the first ant system algorithm was proposed, there is a lot of development in ACO. In ant colony system algorithm, local pheromone is used for ants to search optimum result. However, high magnitude of computing is its deficiency and sometimes it is inefficient. Thomas Stützle etal. Introduced MAX-MIN Ant System (MMAS) in 2000. It is one of the best algorithms of ACO. It limits total pheromone in every trip or sub-union to avoid local convergence. However, the limitation of pheromone slows down convergence rate in MMAS. In optimization algorithm, it is well known that when local optimum solution is searched out or ants arrive at stagnating state, algorithm may be no longer searching the global best optimum value. According to our limited knowledge, only Jun Ouyang et al proposed an improved ant colony system algorithm for multi-colony ant systems. In their algorithms, when ants arrived at local optimum solution, pheromone will be decreased in order to make algorithm escaping from the local optimum solution. When ants arrived at local optimum solution, or at stagnating state, it would not converge at the global best optimum solution. In this paper, a modified algorithm, multi-colony ant system based on a pheromone arithmetic crossover and a repulsive operator, is proposed to avoid such stagnating state. In this algorithm, firstly several colonies of ant system are created, and then they perform iterating and updating their pheromone arrays respective lyuntil one ant colony system reaches its local optimum solution. Every ant colony system owns its pheromone array and parameters and records its local optimum solution. Furthermore, once an ant colony system arrives at its local optimum solution, it updates its local optimum solution and sends this solution to global best-found centre. Thirdly, when an old ant colony system is chosen according to elimination rules, it will be destroyed and reinitialized through application of the pheromone arithmetic crossover and the repulsive operator based on several global best-so-far optimum solutions. The whole algorithm implements iterations until global best optimum solution is searched out. The following sections will introduce some concepts and rules of this multi-colony ant system. This paper is organized as follows. Section II briefly explains the basic ACO algorithm and its main variant MMAS we use as a basis for multi-colony ant Optimization By Ant Colony Method 3 algorithm. In Section III we Ant Colony Optimization - Methods and Applications describe detailed how to use both the pheromone crossover and the repulsive operator to reinitialize a stagnated colony in our multi-colony ant algorithm. A parallel asynchronous algorithm process is also presented. Experimental results from the multi-colony ant algorithm are presented in Section IV along with a comparative performance analysis involving other existing approaches. Finally, Section V provides some concluding remarks. Optimization problems are of high importance both for the industrial world as well as for the scientific world. Examples of practical optimization problems include train scheduling, time tabling, shape optimization, telecommunication network design, or problems from computational biology. The research community has simplified many of these problems in order to obtain scientific test cases such as the well-known travelling salesman problem (TSP) .The TSP models the situation of a travelling salesman who is required to pass through a number of cities. The goal of the travelling salesman is to traverse these cities (visiting each city exactly once) so that the total travelling dis

    Hak Cipta

    © © All Rights Reserved

    Format Tersedia

    PPTX, PDF, TXT atau baca online dari Scribd

    Apakah menurut Anda dokumen ini bermanfaat?

    Apakah konten ini tidak pantas?

    Laporkan Dokumen Ini
    The first ant colony optimization (ACO) called ant system was inspired through studying of the behaviour of ants in 1991 by Macro Dorigo and co-workers. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviours. Since the first ant system algorithm was proposed, there is a lot of development in ACO. In ant colony system algorithm, local pheromone is used for ants to search optimum result. However, high magnitude of computing is its deficiency and sometimes it is inefficient. Thomas Stützle etal. Introduced MAX-MIN Ant System (MMAS) in 2000. It is one of the best algorithms of ACO. It limits total pheromone in every trip or sub-union to avoid local convergence. However, the limitation of pheromone slows down convergence rate in MMAS. In optimization algorithm, it is well known that when local optimum solution is searched out or ants arrive at stagnating state, algorithm may be no longer searching the global best optimum value. According to our limited knowledge, only Jun Ouyang et al proposed an improved ant colony system algorithm for multi-colony ant systems. In their algorithms, when ants arrived at local optimum solution, pheromone will be decreased in order to make algorithm escaping from the local optimum solution. When ants arrived at local optimum solution, or at stagnating state, it would not converge at the global best optimum solution. In this paper, a modified algorithm, multi-colony ant system based on a pheromone arithmetic crossover and a repulsive operator, is proposed to avoid such stagnating state. In this algorithm, firstly several colonies of ant system are created, and then they perform iterating and updating their pheromone arrays respective lyuntil one ant colony system reaches its local optimum solution. Every ant colony system owns its pheromone array and parameters and records its local optimum solution. Furthermore, once an ant colony system arrives at its local optimum solution, it updates its local optimum solution and sends this solution to global best-found centre. Thirdly, when an old ant colony system is chosen according to elimination rules, it will be destroyed and reinitialized through application of the pheromone arithmetic crossover and the repulsive operator based on several global best-so-far optimum solutions. The whole algorithm implements iterations until global best optimum solution is searched out. The following sections will introduce some concepts and rules of this multi-colony ant system. This paper is organized as follows. Section II briefly explains the basic ACO algorithm and its main variant MMAS we use as a basis for multi-colony ant Optimization By Ant Colony Method 3 algorithm. In Section III we Ant Colony Optimization - Methods and Applications describe detailed how to use both the pheromone crossover and the repulsive operator to reinitialize a stagnated colony in our multi-colony ant algorithm. A parallel asynchronous algorithm process is also presented. Experimental results from the multi-colony ant algorithm are presented in Section IV along with a comparative performance analysis involving other existing approaches. Finally, Section V provides some concluding remarks. Optimization problems are of high importance both for the industrial world as well as for the scientific world. Examples of practical optimization problems include train scheduling, time tabling, shape optimization, telecommunication network design, or problems from computational biology. The research community has simplified many of these problems in order to obtain scientific test cases such as the well-known travelling salesman problem (TSP) .The TSP models the situation of a travelling salesman who is required to pass through a number of cities. The goal of the travelling salesman is to traverse these cities (visiting each city exactly once) so that the total travelling dis

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    6 tayangan19 halaman

    Optimization by Ant Colony Method

    Diunggah oleh

    Uday Wankar
    The first ant colony optimization (ACO) called ant system was inspired through studying of the behaviour of ants in 1991 by Macro Dorigo and co-workers. An ant colony is highly organized, in which one interacting with others through pheromone in perfect harmony. Optimization problems can be solved through simulating ant’s behaviours. Since the first ant system algorithm was proposed, there is a lot of development in ACO. In ant colony system algorithm, local pheromone is used for ants to search optimum result. However, high magnitude of computing is its deficiency and sometimes it is inefficient. Thomas Stützle etal. Introduced MAX-MIN Ant System (MMAS) in 2000. It is one of the best algorithms of ACO. It limits total pheromone in every trip or sub-union to avoid local convergence. However, the limitation of pheromone slows down convergence rate in MMAS. In optimization algorithm, it is well known that when local optimum solution is searched out or ants arrive at stagnating state, algorithm may be no longer searching the global best optimum value. According to our limited knowledge, only Jun Ouyang et al proposed an improved ant colony system algorithm for multi-colony ant systems. In their algorithms, when ants arrived at local optimum solution, pheromone will be decreased in order to make algorithm escaping from the local optimum solution. When ants arrived at local optimum solution, or at stagnating state, it would not converge at the global best optimum solution. In this paper, a modified algorithm, multi-colony ant system based on a pheromone arithmetic crossover and a repulsive operator, is proposed to avoid such stagnating state. In this algorithm, firstly several colonies of ant system are created, and then they perform iterating and updating their pheromone arrays respective lyuntil one ant colony system reaches its local optimum solution. Every ant colony system owns its pheromone array and parameters and records its local optimum solution. Furthermore, once an ant colony system arrives at its local optimum solution, it updates its local optimum solution and sends this solution to global best-found centre. Thirdly, when an old ant colony system is chosen according to elimination rules, it will be destroyed and reinitialized through application of the pheromone arithmetic crossover and the repulsive operator based on several global best-so-far optimum solutions. The whole algorithm implements iterations until global best optimum solution is searched out. The following sections will introduce some concepts and rules of this multi-colony ant system. This paper is organized as follows. Section II briefly explains the basic ACO algorithm and its main variant MMAS we use as a basis for multi-colony ant Optimization By Ant Colony Method 3 algorithm. In Section III we Ant Colony Optimization - Methods and Applications describe detailed how to use both the pheromone crossover and the repulsive operator to reinitialize a stagnated colony in our multi-colony ant algorithm. A parallel asynchronous algorithm process is also presented. Experimental results from the multi-colony ant algorithm are presented in Section IV along with a comparative performance analysis involving other existing approaches. Finally, Section V provides some concluding remarks. Optimization problems are of high importance both for the industrial world as well as for the scientific world. Examples of practical optimization problems include train scheduling, time tabling, shape optimization, telecommunication network design, or problems from computational biology. The research community has simplified many of these problems in order to obtain scientific test cases such as the well-known travelling salesman problem (TSP) .The TSP models the situation of a travelling salesman who is required to pass through a number of cities. The goal of the travelling salesman is to traverse these cities (visiting each city exactly once) so that the total travelling dis

    Hak Cipta:

    © All Rights Reserved
    Unduh sebagai PPTX, PDF, TXT atau baca online dari Scribd
    Tandai sebagai konten tidak pantas
    dari 19

    OPTIMIZATION BY ANT

    COLONY METHOD
    CONTENT

    defination of optimization
    ACO concept
    ACO system
    ACO system cont.
    ANT foraging
    Implementation
    Applications
    Advantages & Disadvantages
    Sources
    conclusions
    References
    What is Optimization?
    Procedure to make a system or design as
    effective, especially the mathematical
    techniques involved. ( Meta-Heuristics)
    Finding Best Solution
    Minimal Cost (Design)

    Minimal Error (Parameter Calibration)

    Maximal Profit (Management)

    Maximal Utility (Economics)


    ACO Concept
    Ants (blind) navigate from nest to food source
    Shortest path is discovered via pheromone trails
    First ant moves at random
    pheromone is deposited on path
    ants detect lead ants path, inclined to follow
    more pheromone on path increases probability of path
    being followed

    4
    ACO System
    Virtual trail accumulated on path segments
    Starting node selected at random
    Path selected at random
    based on amount of trail present on possible paths
    from starting node
    higher probability for paths with more trail
    Ant reaches next node, selects next path
    Continues until reaches starting node
    Finished tour is a solution
    5
    ACO System, cont.
    A completed tour is analyzed for optimality
    Trail amount adjusted to favor better solutions
    better solutions receive more trail
    worse solutions receive less trail
    higher probability of ant selecting path that is part of a
    better-performing tour
    New cycle is performed
    Repeated until most ants select the same tour on
    every cycle (convergence to solution)

    6
    7
    8
    9
    10
    Implementation
    Can be used for both Static and Dynamic
    Combinatorial optimization problems
    Convergence is guaranteed, although the
    speed is unknown
    Value

    Solution

    11
    Existing Nature-Inspired Algorithms
    Applications
    Efficiently Solves NP hard Problems 1
    Routing 5
    TSP (Traveling Salesman Problem) 2
    Vehicle Routing
    Sequential Ordering
    Assignment 3 4
    QAP (Quadratic Assignment Problem)
    Graph Coloring
    Generalized Assignment
    Frequency Assignment
    University Course Time Scheduling

    13
    Applications
    Other
    Shortest Common Sequence
    Constraint Satisfaction
    2D-HP protein folding
    Bin Packing
    Machine Learning
    Classification Rules
    Bayesian networks
    Fuzzy systems
    Network Routing
    Connection oriented network routing
    Connection network routing
    Optical network routing

    14
    Advantages and Disadvantages,
    cont.
    Can be used in dynamic applications (adapts to
    changes such as new distances, etc.)

    Has been applied to a wide variety of applications

    As with GAs, good choice for constrained discrete


    problems (not a gradient-based algorithm)

    15
    Sources
    Dorigo, Marco and Sttzle, Thomas. (2004) Ant Colony Optimization,
    Cambridge, MA: The MIT Press.
    Dorigo, Marco, Gambardella, Luca M., Middendorf, Martin. (2002)
    Guest Editorial, IEEE Transactions on Evolutionary Computation,
    6(4): 317-320.
    Thompson, Jonathan, Ant Colony Optimization.
    http://www.orsoc.org.uk/region/regional/swords/swords.ppt, accessed
    April 24, 2005.
    Camp, Charles V., Bichon, Barron, J. and Stovall, Scott P. (2005)
    Design of Steel Frames Using Ant Colony Optimization, Journal of
    Structural Engineeering, 131 (3):369-379.
    Fjalldal, Johann Bragi, An Introduction to Ant Colony Algorithms.
    http://www.informatics.sussex.ac.uk/research/nlp/gazdar/teach/atc/199
    9/web/johannf/ants.html, accessed April 24, 2005.

    16
    Advantages and Disadvantages
    For TSPs (Traveling Salesman Problem), relatively efficient
    for a small number of nodes, TSPs can be solved by
    exhaustive search
    for a large number of nodes, TSPs are very computationally
    difficult to solve (NP-hard) exponential time to
    convergence
    Performs better against other global optimization techniques
    for TSP (neural net, genetic algorithms, simulated annealing)
    Compared to GAs (Genetic Algorithms):
    retains memory of entire colony instead of previous
    generation only
    less affected by poor initial solutions (due to combination of
    random path selection and colony memory)
    17
    CONCLUSION

    Estimation and simulation, end


    users; field work tracer studies,
    pressure tests, case studies;
    contaminant and water security
    detection, source identification,
    response; network vulnerability
    security assessments, network
    reliability,

    Anda mungkin juga menyukai