HYBRID ALGORITMA ARTIFICIAL BEE COLONY DENGAN MULTIPLE ONLOOKER (MO-ABC) DAN ALGORITMA HILLCLIMBING (HC) UNTUK MENYELESAIKAN TRAVELING SALESMAN PROBLEM (TSP)
Abstrak: Traveling Salesman
Problem is a
problem of determining
the optimal route
from salesman’s routes. Therefore, the purpose of writing this
undergraduate thesis is to solve the
Traveling Salesman Problem
with a Hybrid
Artificial Bee Colony
with Multiple Onlooker Algorithm
and Hill Climbing Algorithm. Artificial Bee Colony with Multiple Onlooker
Algorithm is a modification of the Artificial Bee Colony Algorithm. Artificial Bee Colony
with Multiple Onlooker
is one of
the heuristics method
inspired by behaviour a colony of
bees when they find the food source, onlookers are going to areas where more
than one employed bee has found promising food source. Modification uses three onlooker
bees to create
mutant solution. Hill
Climbing is a
repetition of the algorithm continues to move toward
increasing the value. Hybrid Artificial Bee Colony with Multiple
Onlooker Algorithm and
Hill Climbing Algorithm
is a combination
of two algorithms by
entering the Hill
Climbing Algorithm to
process Artificial Bee Colony
with Multiple Onlooker
Algorithm. The process
of algorithm is
started by initialitation
parameters, generate solution, calculate fitness value, find neighbourhood from the
solution and calculate
fitness value, roulette
wheel selection, find neighbourhood form
the solution for
onlookers bee and
calculate fitness value,
select solution for hill
climbing algorithm, do
the hill climbing
algorithm to the
selected solution with modified solution, memorize the best solution,
find the exhausted solution and the process running untill maximum iteration.
The data used is the data 10 cities in East Java and 100 cities in Java Island,
and the Java programming language solved with NetBeans IDE
7.2. The objective
function (distance) minimum
based on hybrid artificial bee
colony with multiple
onlooker algorithm and
hill climbing for
data 10 cities in East Java is
1022 km, while the data for 100 cities in Java Island obtained a minimum
distance is 21289 km.
Keywords: Artificial
Bee Colony Algorithm
with Multiple Onlooker,
Hybrid, Hill climbing Algorithm,
Traveling Salesman Problem
Penulis: Novia Putri Pertiwi,
Herry Suprajitno, Auli Damayanti
Kode Jurnal: jpmatematikadd130073
