Hybrid Virus Evolutionary Genetic Algorithm (VEGA) dan Simulated Annealing (SA) pada Penjadwalan Flowshop
Abstract: The purpose of this
paper is to solve the flowshop
scheduling problem using a Hybrid of Virus Evolutionary
Genetic Algorithm and
Simulated Annealing. Flowshop
is defined as scheduling
problem to obtain
the optimal solutions
that involve n jobs and
m machines in production process. In flowshop scheduling
each job is processed in each machine with the same order. Virus
Evolutionary genetic algorithm
is searching solution
algorithm that copy
the mechanics of selection
and natural evolution
with virus infection.
Simulated Annealing is analogous
method to the
annealing process. Hybrid
of virus evolutionary
genetic algorithm and simulated annealing is a combination of
both processes by insert simulated annealing algorithm to the process
of virus evolutionary
genetic algorithms. The
process of algorithm
is started by initialitation parameters,
generate initial solutions,
generate virus, calculate
values of makespan and
fitness of each
solution, determine candidate
of parents with
elitism selection, do
subtour exchange crossover, do
resiprocal exchange to
specified temperature, compare
the makespanvalue, decrease the
temperature, combine the solutions of the result of crossover and mutation with
the initial host
population, do selection
of combined solutions,
do reverse transcription, do transduction and the process continues
until the maximum iteration.
Penulis: Ramadhani Amulyo,
Herry Suprajitno, Miswanto
Kode Jurnal: jpmatematikadd130073
