0 Up votes0 Down votes

25 views29 pagesACO, Ant Colony

Sep 19, 2013

© Attribution Non-Commercial (BY-NC)

PPT, PDF, TXT or read online from Scribd

ACO, Ant Colony

Attribution Non-Commercial (BY-NC)

25 views

ACO, Ant Colony

Attribution Non-Commercial (BY-NC)

- ASIC Design Jan 2016 (2014 Scheme)
- Ant Colony Optimization
- Ant Colony Optimization Overview
- MSKey4in1 Read Me
- CIS 4424 Chapter 10 Problem 4
- P4 -7pag105
- Ant-colony-optimization-algorithms
- ACOLONYO
- 1107.0434.pdf
- (RKR_4)SimulatedAnnealing
- AUTONOMIC TRAFFIC LIGHTS CONTROL USING ANT COLONY ALGORITHM
- Project Management Chapter No 1 97-2003 format
- IT210 R5 Appendix f
- assAs
- TensorFlow Mechanics 101
- cheatsheet.pdf
- Assignment No 1-2010
- code-2
- 051021
- LP Formulation - Alpha Steels - Hiring Temp Workers to Minimise Cost

You are on page 1of 29

Theresa Meggie

Barker von Haartman

IE 516 Spring 2005

Overview

ACO Concept

Ants (blind) navigate from nest to food

source

Shortest path is discovered via pheromone

trails

each 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

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

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)

ACO System, cont.

Often applied to TSP (Travelling Salesman

Problem): shortest path between n nodes

Algorithm in Pseudocode:

Initialize Trail

Do While (Stopping Criteria Not Satisfied) Cycle Loop

Do Until (Each Ant Completes a Tour) Tour Loop

Local Trail Update

End Do

Analyze Tours

Global Trail Update

End Do

Background

Discrete optimization problems difficult

to solve

Soft computing techniques developed

in past ten years:

Genetic algorithms (GAs)

based on natural selection and genetics

Ant Colony Optimization (ACO)

modeling ant colony behavior

Background, cont.

Developed by Marco Dorigo (Milan,

Italy), and others in early 1990s

Some common applications:

Quadratic assignment problems

Scheduling problems

Dynamic routing problems in networks

Theoretical analysis difficult

algorithm is based on a series of random decisions

(by artificial ants)

probability of decisions changes on each iteration

Implementation

Ant Algorithms

Ant Algorithms

Implementation

Can be used for both Static and

Dynamic Combinatorial optimization

problems

Convergence is guaranteed, although the

speed is unknown

Value

Solution

The Algorithm

Ant Colony Algorithms are typically use

to solve minimum cost problems.

We may usually have N nodes and A

undirected arcs

There are two working modes for the

ants: either forwards or backwards.

Pheromones are only deposited in

backward mode.

The Algorithm

The ants memory allows them to retrace

the path it has followed while searching

for the destination node

Before moving backward on their

memorized path, they eliminate any

loops from it. While moving backwards,

the ants leave pheromones on the arcs

they traversed.

The Algorithm

The ants evaluate the cost of the paths

they have traversed.

The shorter paths will receive a greater

deposit of pheromones. An evaporation

rule will be tied with the pheromones,

which will reduce the chance for poor

quality solutions.

The Algorithm

At the beginning of the search process,

a constant amount of pheromone is

assigned to all arcs. When located at a

node i an ant k uses the pheromone

trail to compute the probability of

choosing j as the next node:

where is the neighborhood of ant k

when in node i.

0

k

i

ij k

i

k

il

ij l N

k

i

if j N

p

if j N

o

o

t

t

e

k

i

N

The Algorithm

When the arc (i,j) is traversed , the

pheromone value changes as follows:

By using this rule, the probability

increases that forthcoming ants will use

this arc.

k

ij ij

t t t +A

The Algorithm

After each ant k has moved to the next

node, the pheromones evaporate by the

following equation to all the arcs:

where is a parameter. An

iteration is a completer cycle involving

ants movement, pheromone evaporation,

and pheromone deposit.

(1 ) , ( , )

ij ij

p i j A t t e

(0,1] pe

Steps for Solving a Problem

by ACO

1. Represent the problem in the form of sets of

components and transitions, or by a set of weighted

graphs, on which ants can build solutions

2. Define the meaning of the pheromone trails

3. Define the heuristic preference for the ant while

constructing a solution

4. If possible implement a efficient local search

algorithm for the problem to be solved.

5. Choose a specific ACO algorithm and apply to

problem being solved

6. Tune the parameter of the ACO algorithm.

Applications

Efficiently Solves NP hard Problems

Routing

TSP (Traveling Salesman Problem)

Vehicle Routing

Sequential Ordering

Assignment

QAP (Quadratic Assignment Problem)

Graph Coloring

Generalized Assignment

Frequency Assignment

University Course Time Scheduling

4

3

5

2

1

Applications

Scheduling

Job Shop

Open Shop

Flow Shop

Total tardiness (weighted/non-weighted)

Project Scheduling

Group Shop

Subset

Multi-Knapsack

Max Independent Set

Redundancy Allocation

Set Covering

Weight Constrained Graph Tree partition

Arc-weighted L cardinality tree

Maximum Clique

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

Advantages and

Disadvantages

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)

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)

Advantages and Disadvantages,

cont.

Theoretical analysis is difficult:

Due to sequences of random decisions (not

independent)

Probability distribution changes by

iteration

Research is experimental rather than

theoretical

Convergence is guaranteed, but time to

convergence uncertain

Advantages and Disadvantages,

cont.

Tradeoffs in evaluating convergence:

In NP-hard problems, need high-quality solutions quickly

focus is on quality of solutions

In dynamic network routing problems, need solutions for

changing conditions focus is on effective evaluation of

alternative paths

Coding is somewhat complicated, not straightforward

Pheromone trail additions/deletions, global updates and

local updates

Large number of different ACO algorithms to exploit

different problem characteristics

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/1999/web/johannf/ants.html, accessed April 24, 2005.

Questions?

- ASIC Design Jan 2016 (2014 Scheme)Uploaded byRaju C
- Ant Colony OptimizationUploaded byRaeshma Ramesh
- Ant Colony Optimization OverviewUploaded byMohammed Lubbad
- MSKey4in1 Read MeUploaded byOctavian Nicolae Maerean
- CIS 4424 Chapter 10 Problem 4Uploaded byDavid Scott
- P4 -7pag105Uploaded byJean Carlo
- Ant-colony-optimization-algorithmsUploaded byMahesh Singh Danu
- ACOLONYOUploaded byjyotiblossoms
- 1107.0434.pdfUploaded byJonathan
- (RKR_4)SimulatedAnnealingUploaded byAmrYassin
- AUTONOMIC TRAFFIC LIGHTS CONTROL USING ANT COLONY ALGORITHMUploaded byIJAET Journal
- Project Management Chapter No 1 97-2003 formatUploaded bywaleedafr
- IT210 R5 Appendix fUploaded bycyberbandit1998_3606
- assAsUploaded byMukesh Bisht
- TensorFlow Mechanics 101Uploaded byForget_Itt
- cheatsheet.pdfUploaded byPrasunGhosh
- Assignment No 1-2010Uploaded byGanesh Aiyer
- code-2Uploaded byHemant Kumar
- 051021Uploaded bysriashokcute
- LP Formulation - Alpha Steels - Hiring Temp Workers to Minimise CostUploaded byGautham
- viva.odtUploaded byVarun Gupta
- Iida - Tutoring Strategies in Game-Tree SearchUploaded byanon-355439
- WeightBasedUploaded byGilvan Mariano Silva
- Op Tim IzationUploaded byMadhav Tiwari
- prog12Uploaded byAvneet Bansal
- ch2_slides.pdfUploaded bybolsjhevik
- Assignment 517Uploaded byBismay Routray
- Bio in for MaticsUploaded byankita gedam
- DestructUploaded byapi-3739770
- ManualUploaded bynmunozj8840

- Model for Quantifying RiskUploaded byIotalaseria Putu
- [gamma, Fu_bar, Fv_bar, Fw_bar]=VortexStrength(panel,phi).txtUploaded byahmed_shaheeb
- [C,T,A]=naca4_3d(airfoil,y,nc).txtUploaded byahmed_shaheeb
- PolyTop.pdfUploaded byahmed_shaheeb
- 20130615 Calling Sequence.docxUploaded byahmed_shaheeb
- How Constraints Management Enhances Lean and Six SigmaUploaded byleanderzon
- Kai Zen SlidesUploaded byEduardo Jose Lopez

- MarieUploaded byGuilherme Pohl
- INTRODUCTION OF SYSTEM PROGRAMMINGUploaded byAnand Gharu
- appAUploaded byAnand Gandhi
- Chapter 2 Software Development Life Cycle ModelsUploaded byGurteg Singh
- lec8Uploaded bySahiba
- Master h25 10 EnUploaded byJorge Pachas
- daafead766071386aa9cUploaded byapi-452673930
- Parallel Algorithm by Rc4Uploaded byماجد اسماعيل سمير
- TAL ProgrammingUploaded byAndre White
- C 02-03-O Istorie a Calculatorului-De LA CAD LA BIMUploaded bymuguneagu
- Out of Order Floating Point Coprocessor for RISC v ISAUploaded bykiran
- PLI_Training__Day4Uploaded byapi-3853979
- Genetic Algorithms in Java Basics-2.pdfUploaded byAhmedELHajji
- Newton Raphson(NM)Uploaded bymadnan27
- Bibliography RfidUploaded byshdotcom11004
- Quiz SE 01 SolutionUploaded bynasrullahdharejo
- Von-neuman vs HarvardUploaded bytango zone
- MP L4 AssemblyUploaded byAbdurrahman Hut
- BibUploaded byabhishekbhardwa9569
- driver genius proUploaded bychirag2796
- CrisStringfellowUploaded bymake mak
- opss 2.pdfUploaded byenbakom
- harsha basavaraj resume cnUploaded byapi-360712414
- CSEUploaded byvplvpl
- IJCSRTV1IS050058.pdfUploaded byIJERT.ORG
- Operating SystemUploaded bypinki_1387
- Ict Future PlanUploaded byMian Jibran Khalid
- Gpu Applications CatalogUploaded byGerry Losar
- CMS-PD-20070223Uploaded byAniket Gurav
- CSCI 113 Syllabus C++ sec 5Uploaded byrashid744

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.