• Home
  • Archive
  • Tools
  • Contact Us

The Customize Windows

Technology Journal

  • Cloud Computing
  • Computer
  • Digital Photography
  • Windows 7
  • Archive
  • Cloud Computing
  • Virtualization
  • Computer and Internet
  • Digital Photography
  • Android
  • Sysadmin
  • Electronics
  • Big Data
  • Virtualization
  • Downloads
  • Web Development
  • Apple
  • Android
Advertisement
You are here: Home » Ant Colony Optimization and Artificial Intelligence

By Abhishek Ghosh September 14, 2012 1:13 am Updated on September 14, 2012

Ant Colony Optimization and Artificial Intelligence

Advertisement

Ant Colony Optimization (ACO) are algorithms inspired by the behavior of ants and defined mathematically, simulated and applied for combinatorial optimization. We mentioned about Ant Colony Optimization in DNA Computing and Modeling of Neurons, Artificial Immune System (AIS) and in the article on Mind, Theory of Mind and Computing.

 

Basics of Ant Colony Optimization

 

Ant Colony Optimization was initially proposed by Marco Dorigo et al. during 1990s, for the search for optimal paths in a graphical format, first the algorithm was inspired by the behavior of ants seeking a path between their colony and a source of food. The original idea has been diversified to solve a wider class of problems and several algorithms has been emerged, drawing on various aspects of the behavior of ants.

 

The model of Ant Colony Optimization is :

Advertisement

---

 

Ant Colony Optimization and Artificial Intelligence

 

  1. Ant runs more or less at random environment around the colony.
  2. If it discovers a source of food, it returns more or less directly to the ‘home’, leaving a trail of pheromones, a kind of hormones that can be traced by them.
  3. These pheromones are attractive, nearby ants passing will tend to follow the track.
  4. Returning to the ‘home’, these ants will strengthen the path.
  5. If two paths are possible to reach the same source of food, they will take the shortest track.
  6. The short track will be increasingly enhanced.
  7. The longer track will eventually will disappear as pheromones are volatile.
  8. Eventually all the ants will take the shortest track.

 

Ant Colony Optimization and Artificial Intelligence

 

Ant Colony Optimization can be used in Artificial intelligence for network load balancing, for example an article submitted by Lawrence Botley :

 

Vim
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
<span style="color: #ff00ff;">// returns the next Node of the path</span>
public int ProbablePath(ArrayList VisitedNodes)
{
<span style="color: #ff00ff;">// create a random generator</span>
Random r = new Random(Global.Seed);
 
double val=0;
double count = 0;
double Lastcount = -1;
 
ArrayList tempTEVector=new ArrayList();
 
<span style="color: #ff00ff;">// loop through all the connected nodes</span>
for(int i=0;i&lt;tableEntry.Length;i++)
{
<span style="color: #ff00ff;">// has the node been visitied?</span>
bool v=false;
 
<span style="color: #ff00ff;">//loop through all the visited nodes</span>
for(int j=0;j&lt;VisitedNodes.Count;j++)
{
// if the ID's match then this node has alrady been visited
if(tableEntry[i].NodeID==(int)VisitedNodes[j])
v=true;
}
 
<span style="color: #ff00ff;">// If v is false then the node hasnt been visited.. so Add</span>
if(!v)
{
// get the node
Node n = Global.Nodes[tableEntry[i].NodeID];
 
<span style="color: #ff00ff;">// if the node is accepting connections</span>
if(!n.FullCapacity)
{
<span style="color: #ff00ff;">// add the node as a possible candidate</span>
tempTEVector.Add(tableEntry[i]);
}
}
}
 
<span style="color: #ff00ff;">// if all connections have been visited</span>
if(tempTEVector.Count==0)
{
<span style="color: #ff00ff;">// loop through all the connected nodes</span>
for(int i=0;i&lt;tableEntry.Length;i++)
tempTEVector.Add(tableEntry[i]);
}
 
<span style="color: #ff00ff;">// get the ceiling amount for probabilities</span>
for(int i=0;i&lt;tempTEVector.Count;i++)
val+= ((TableEntry)tempTEVector[i]).Probablilty;
 
<span style="color: #ff00ff;">//create randon value</span>
val = r.NextDouble()*val;
 
<span style="color: #ff00ff;">// loop through the temp Table Entryies</span>
for(int i=0;i&lt;tempTEVector.Count;i++)
{
<span style="color: #ff00ff;">// increment the count on each loop</span>
count += ((TableEntry)tempTEVector[i]).Probablilty;
 
<span style="color: #ff00ff;">// if the random value falls into delegated range</span>
<span style="color: #ff00ff;">// then select that path as the next node</span>
if(val&gt;Lastcount &amp;&amp; val &lt; count)
return ((TableEntry)tempTEVector[i]).NodeID;
 
<span style="color: #ff00ff;">// get the value of the last count</span>
Lastcount=count;
}
 
<span style="color: #ff00ff;">// method should never return here</span>
return -1;
}// returns the next Node of the path
public int ProbablePath(ArrayList VisitedNodes)
{
<span style="color: #ff00ff;">// create a random generator</span>
Random r = new Random(Global.Seed);
 
double val=0;
double count = 0;
double Lastcount = -1;
 
ArrayList tempTEVector=new ArrayList();
 
<span style="color: #ff00ff;">// loop through all the connected nodes</span>
for(int i=0;i&lt;tableEntry.Length;i++)
{
<span style="color: #ff00ff;">// has the node been visitied?</span>
bool v=false;
 
<span style="color: #ff00ff;">//loop through all the visited nodes</span>
for(int j=0;j&lt;VisitedNodes.Count;j++)
{
<span style="color: #ff00ff;">// if the ID's match then this node has already been visited</span>
if(tableEntry[i].NodeID==(int)VisitedNodes[j])
v=true;
}
 
<span style="color: #ff00ff;">// If v is false then the node hasnt been visited.. so Add</span>
if(!v)
{
<span style="color: #ff00ff;">// get the node</span>
Node n = Global.Nodes[tableEntry[i].NodeID];
 
// if the node is accepting connections
if(!n.FullCapacity)
{
<span style="color: #ff00ff;">// add the node as a possible candidate</span>
tempTEVector.Add(tableEntry[i]);
}
}
}
 
<span style="color: #ff00ff;">// if all connections have been visited</span>
if(tempTEVector.Count==0)
{
<span style="color: #ff00ff;">// loop through all the connected nodes</span>
for(int i=0;i&lt;tableEntry.Length;i++)
tempTEVector.Add(tableEntry[i]);
}
 
<span style="color: #ff00ff;">// get the ceiling amount for probabilities</span>
for(int i=0;i&lt;tempTEVector.Count;i++)
val+= ((TableEntry)tempTEVector[i]).Probablilty;
 
<span style="color: #ff00ff;">//create random value</span>
val = r.NextDouble()*val;
 
<span style="color: #ff00ff;">// loop through the temp Table Entries</span>
for(int i=0;i&lt;tempTEVector.Count;i++)
{
<span style="color: #ff00ff;">// increment the count on each loop</span>
count += ((TableEntry)tempTEVector[i]).Probablilty;
 
<span style="color: #ff00ff;">// if the random value falls into delegated range // then select that path as the next node</span>
if(val&gt;Lastcount &amp;&amp; val &lt; count)
return ((TableEntry)tempTEVector[i]).NodeID;
 
<span style="color: #ff00ff;">// get the value of the last count</span>
Lastcount=count;
}
 
<span style="color: #ff00ff;">// method should never return here</span>
return -1;
}

 

You can read the original article here on Artificial intelligence network load balancing using Ant Colony Optimization. Ant Colony Optimization has been applied to solve complex structure analysis like quadratic assignment to the folds of protein molecules. The basic algorithm of Ant Colony Optimization has been adapted to solve dynamic problems.

 

Signature Tagged With ant colony optimiation arificial intellegence , ant colony optimization algorithm in AI , optimization in ARTIFICIAL INTELIGENCE , artifical ant colliny , ants as models for artificial intelligence , ant food location for artifical intelligence , ant colony optimization with in artificial intelligence , ant colony optimization in artifical intelegence , ant colony optimization artificial intelligence , Ant colony optimitazion with Artificail intelligence

This Article Has Been Shared 673 Times!

Facebook Twitter Pinterest
Abhishek Ghosh

About Abhishek Ghosh

Abhishek Ghosh is a Businessman, Surgeon, Author and Blogger. You can keep touch with him on Twitter - @AbhishekCTRL.

Here’s what we’ve got for you which might like :

Articles Related to Ant Colony Optimization and Artificial Intelligence

  • Memorandum of Understanding or MoU

    Memorandum of Understanding or MoU is quite frequently heard terminology. MoU is an agreement between parties for any clause including things related to networking.

  • VDSL or Very High Bit Rate Digital Subscriber Line

    VDSL stands for Very High Bit Rate Digital Subscriber Line,which is an extension of DSL technology with much higher data transfer rate over telephone line.

  • Choosing the Right Conferencing Partner for Your Business

    Here are a few things you should pay attention to when you are seeking to get the best provider for your video conferencing needs.

  • Add a Web Interface to Git Repository on Shared Hosting

    Shared Hosting supports git push, but why we will remain happy with a minimal feature! You can add a Web Interface to Git on Shared Hosting.

  • Colors for OS X Terminal and iTerm With lolcat

    We are not satisfied with boring syntax highlighting with transparent iTem2! We want to add more colors, fun and animation for our setup!

Additionally, performing a search on this website can help you. Also, we have YouTube Videos.

Take The Conversation Further ...

We'd love to know your thoughts on this article.
Meet the Author over on Twitter to join the conversation right now!

If you want to Advertise on our Article or want a Sponsored Article, you are invited to Contact us.

Contact Us

Subscribe To Our Free Newsletter

Get new posts by email:

Please Confirm the Subscription When Approval Email Will Arrive in Your Email Inbox as Second Step.

Search this website…

 

Popular Articles

Our Homepage is best place to find popular articles!

Here Are Some Good to Read Articles :

  • Cloud Computing Service Models
  • What is Cloud Computing?
  • Cloud Computing and Social Networks in Mobile Space
  • ARM Processor Architecture
  • What Camera Mode to Choose
  • Indispensable MySQL queries for custom fields in WordPress
  • Windows 7 Speech Recognition Scripting Related Tutorials

Social Networks

  • Pinterest (22.1K Followers)
  • Twitter (5.8k Followers)
  • Facebook (5.7k Followers)
  • LinkedIn (3.7k Followers)
  • YouTube (1.3k Followers)
  • GitHub (Repository)
  • GitHub (Gists)
Looking to publish sponsored article on our website?

Contact us

Recent Posts

  • Ways To Make Sure Your Online Course Outshine Others July 3, 2022
  • Will Smart Factories Become the New Assembly Line? July 2, 2022
  • The Cost of Doing Business as a Handyman July 1, 2022
  • Samsung Galaxy S22 Ultra: Long Term Review June 30, 2022
  • How to Make the Most of Your S Pen (S22 Ultra) June 29, 2022

About This Article

Cite this article as: Abhishek Ghosh, "Ant Colony Optimization and Artificial Intelligence," in The Customize Windows, September 14, 2012, July 4, 2022, https://thecustomizewindows.com/2012/09/ant-colony-optimization-and-artificial-intelligence/.

Source:The Customize Windows, JiMA.in

This website uses cookies. If you do not want to allow us to use cookies and/or non-personalized Ads, kindly clear browser cookies after closing this webpage.

Read Privacy Policy.

PC users can consult Corrine Chorney for Security.

Want to know more about us? Read Notability and Mentions & Our Setup.

Copyright © 2022 - The Customize Windows | dESIGNed by The Customize Windows

Copyright  · Privacy Policy  · Advertising Policy  · Terms of Service  · Refund Policy