Professional Documents
Culture Documents
Heuristic Algorithms
Maad M. Mijwel
Computer science, college of science,
University of Baghdad
Baghdad, Iraq
maadalnaimiy@yahoo.com
May 2015
__________________________________________________*****_________________________________________________
2 - N-Queen Problem 500 degrees by subtracting 500 degrees from our problem
A chess board is the problem of being stowed on the board in equation. We have to use absolute value because we need to
such a way that there are no points of attack on a veterinarian get clear distance of 500 den large or small. Here you will
until N. benefit from formulating between 0 and 1 to make the
eligibility value more reducible. I formulated it as 1 / (1 +
IV. STUDY LOGIC Conclusion).
Let's talk a little bit about the rationale. As you know from the 1-) 10 2 +15 2 + -6 3 = 500 | 500-109 | = 391 = 1 / (1 +
Heuristic Optimization Algorithms, we aim to find the best 391) = 0.0025
solution in the shortest possible time from the probing search 2-) -25 2 +29 2 -10 3 = 500 | 500-466 | = 34 = 1 / (1 + 34)
space available. Now let's come to probing. Let's say we are = 0.028
going to place 3 different volume shapes in a box with a 3-) 10 2 +10 2 +4 3 = 500 | 500-264 | = 236 = 1 / (1 +
volume of 500.Let's write some formulas. The first object 236) = 0.0042
occupies the space of the last object cube in the same way as After finding these values, search algorithms try to reach
the square of the lowest object, in the second object. We can better solution clusters by applying special processes to
take a mathematical model such as x 1 2 + x2 2 + x 3 2 = them. Because of the form we create here, it returns 1 in the
500 and try to find the values of x 1 , x 2 and x 3 in best solution set.
the problem space in the search space. Search space x 1 , x 2, I gave the example above to understand the working logic of
x 3 represents the maximum and minimum value range of the most of the heuristic optimization algorithms. We randomly
parameter values. Setting a limit on the parameters we will use set the solution clusters in the search space at startup. The
in the equation of the problem at hand will speed up the math function I was building was purely exemplary. There are
solution reach. If the limit is not set, an infinite number of also mathematical functions to test the performance of
clusters will appear for all parameters. The more the search heuristic optimization algorithms.
space is limited, the faster we will go. To restrict search space, In the next installment, you can reinforce what is described by
we must determine the minimum and maximum values that looking at examples of search algorithms.
each parameter can take. So we can approach solving As an example of heuristic optimization algorithms;
faster. Of course, search space should be carefully determined Genetic Algorithm (GA)
by trying not to exclude values that might be a better solution Ant Colony Optimization (ACO)
from the search space. You must determine the parameter Particle Swarm Optimization (PSO)
value ranges according to your probing. I have problem x 1, Artificial Bee Colony (ABC)
x 2 , xI set this limit by thinking that the values from -30 to 30 Differential Evolution Algorithm (DEA)
could produce a solution. Also, when solving the problem, let's Simulated Annealing (SA)
assume that we have formulated our fitness function so that Gravity Search Algorithm (GSA)
there is no space in the box. In this case, the rest of the box is Gas Brownian Motion Optimization (GBMO)
meant to be minimized. Initially, random solution sets are Heat transfer search (HTS)
created and the fitness values of the resulting solution sets are Electromagnetic Field Optimization (EFO)
found. Let's create a random set of 3 solutions: Optic Inspired Optimization (OIO)
1-) x 1 = 10, x 2 = 15, x 3 = -6 Weighted Superposition Attraction (WSA)
2-) x 1 = -25, x 2 = 29, x 3 = 10 Forest Optimization Algorithm (FOA)
3-) x 1 = 10, x 2 = 10, x 3 = 4. Hurricane Based Optimization Algorithm (Hurricane Based
Now we must calculate the fitness values of these solution Optimization Algorithm)
clusters. The suitability value is determined by intention Firefly Algorithm (Firefly algorithm) (FA)
parameters and their suitability for solution of the problem is Tree-Seed Algorithm (TSA)
examined. By replacing the values, I will check the distance of
2
maadalnaimiy@yahoo.com _____________________________________