Kecerdasan Berkoloni

(Swarm Intelligence) Muhammad Imam Dinata S.Kom.,M.T

 Teori Evolutionary Computing
1. This theory uses an evolutionary theory approach
2. Based on the theory of evolution, namely the theory of genetic algorithms
3. This theory is usually used for optimization
4. The algorithm that has been developed in the form of :
◦ Ant Colony Optimization Semut
◦ Fish Schooling Search Ikan
◦ Bird flocking/Particle Swarm Optimization Burung
◦ Bee Colony Optimization (BCO) Lebah
◦ CSO_b (cockroach Swarm Optimization) Kecoa
Ant Colony Optimization
Real Ant Behaviour
Natural behavior of ants have inspired scientists to
mimic insect operational methods to solve real-life
complex problems

By observing ant behavior, scientist have begun to

understand their means of communication

Ant-based behavioral patterns to address combinational

problems – first proposed by Marco Dorigo (1992)
 Experimental Study Of Ants
Ants secrete pheromone while travelling from the nest to food, and vice versa in order to
communicate with one another to find the shortest path. The more ants follow a trail, the
more attractive that trail becomes for being followed
Experimental Study Of Ants
The more ants follow a trail, the more attractive that trail becomes for being
followed
Experimental
Study Of Ants
The more ants follow a trail,
the more attractive that trail
becomes for being followed
Experimental Study Of Ants for
getting a short path

https://www.youtube.com/watch?v=KMsftukh5jg
 TSP
(Travelling Salesman Problem)

OBJECTIVE

Given a set of n cities, the Travelling

Salesman Problem requires a salesman to
find the shortest route between the given
cities and return to the starting city, while
keeping in mind that each city can be
visited only once
 Why is TSP Difficult to Solve
 Finding the best solution may entail an exhaustive search for all combinations of cities .
This can be prohibitive as “n” gets very large

a
a
b
b
c
c
d
d
e
e
f
f g
g
h
h
Flowchart
ACO
 Key Parameter
 Trail intensity is given by value of (pheromone) which indicates the intensity of the
pheromone on the trail segment,(ij)

 Trail visibility is = 1/d

 The importance of the intensity in the probabilistic transition is

 The importance of the visibility of the trail segment is Determine by user

 The trail persistence or evaporaton rate is given as

Q is a constant and the amount of pheromone laid on a trail segment employed by an Ant;
this amount may be modified in various manners
 Probabilistic City Selection
 Helps determine the city visit next while the ant is in a tour

 Determined by variables such as a the pheromone content in an edge (I,j) at time instant t,
heuristic function of the desirability of adding edge, and their control parameters
Global Updating rule:
Once all ants have built their complete tours, pheromone is updated on all edges as follows:

Using the tour length for the k-th Ant, Lk, the quantity of pheromone added to each edge belonging
To the completed tour is given by

∆𝜏 𝑘 ( 𝑟 , 𝑠 ) =¿ Otherwise

m = the number of ants

ACO Algorithm
The comulative number of these probabilities is

City 2 = 0,3299
City 3 = 0,5590
City 4 = 0,8317
City 5 = 1

Step 3

Generate a random number r to determine the choice of cities to be visited by comparing it with
the value of the cumulative probability.
Random numbers r = 0,6841, this number is located below the 0,8317 on the comulative amount.
Thus, the city to visit is city 4.