Siti Nur Amalina binti Zakaria (2016343311)

CS2435B

TUTORIAL

(Hybrid Evolutionary Algorithms)

1. Find ONE (1) example of hybrid EA that was applied in a real world problem,

i.e from youtube, State which part of algorithm it is hybridized.

Hybrid algorithm based on Genetic Algorithms and Neural Network is used for

breast cancer detection and recurrence. A multi‐layer perceptron (MLP) has been

designed for this purpose, using a GA routine to set weights and a Java

implementation model has been made in this hybrid.

2. Find ONE (1) journal article that applied hybrid evolutionary algorithm with

another evolutionary algorithm in any type of problem. List the algorithms

and discuss the advantages and disadvantages of having hybridization from

this article.

(Kao, Y., Chen, M. H., & Huang, Y. T. (2012). A hybrid algorithm based on ACO

and PSO for capacitated vehicle routing problems. Mathematical Problems in

Engineering, 2012.)

The Vehicle Routing Problem (VRP) is a well-known combinatorial optimization

problem and it concerns the service of a delivery company. Many researches have

been done in finding the effective vehicle routes because it is an important issue of

logistic management. To solve this problem, a hybrid algorithm, PACO, which takes

advantage of ant colony optimization and particle swarm optimization is proposed

 in this paper for capacitated vehicle problems. During the searching process,

artificial ants construct solution routes, memorize the best solution ever found and

lay pheromone on the routes of swarm and personal best solutions. The advantage

of having hybridization is PACO can prevent artificial ants from being trapped in

local optima and to increase the probability of obtaining better solutions. PACO

performs pheromone disturbance and short-term memory resetting operations to

adjust stagnated pheromone trails. The disadvantage of having this hybrid

algorithm is it shows that pheromone disturbance can improve solutions but does

not increase much computational time.

3. What is a hybrid EA? Give an example.

Hybrid EA is used to optimize the performance of the direct evolutionary approach.

It can handle several real world problems involving complexity, noisy environment,

imprecision, uncertainty, and vagueness. Example of hybrid EA is hybridization

between an evolutionary algorithm and another evolutionary algorithm such as a

genetic programming technique is used to improve the performance of a genetic

algorithm.

4. Does local search play an important role in solving knapsack problem?

Yes, local search can help in achieving high search ability without increasing its

algorithmic complexity.

5. What is memetic algorithm? Do you think memetic algorithm can help in

finding an optimal solution or just near optimal solution? Discuss the

answer.
 A memetic algorithm is an extension of the traditional genetic algorithm. It uses a

local search technique to reduce the likelihood of the premature convergence.

Memetic Algorithms (MA) have been shown to be very effective in finding near-

optimum solutions to hard combinatorial optimization problems. MA are well-suited

for finding near-optimum tours for the TSP.

6. Discuss the drawbacks of employing local search.

The disadvantages of local search algorithms are they cannot prove optimality,

cannot provably reduce the search space, do not have well defined stopping criteria

and often have problems with highly constrained problems where feasible areas of

the solution space are disconnected.

Quite Easily Done