A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Perbandingan Kombinasi Genetic Algorithm – Simulated Annealing dengan Particle Swarm Optimization pada Permasalahan Tata Letak Fasilitas
2010
Jurnal Teknik Industri
Preserved Fulltext
This article aims to compare the performance of combination of Genetic Algorithm-Simulated Annealing (GA-SA) with Particle Swarm Optimization (PSO) to solve facility layout problem. GA-SA in this article consist of two algorithms, GA-SA I and GA-SA II, with a different mutation rule. PSO uses fuzzy particle swarm concept to represent solution from each particle. Two criteria to analyze all algorithms performance are moment of movement and computational time. Experiments show that GA-SA II has the best performance in minimization both criteria
doaj:712bacc616504acfa52aef4cab082525
fatcat:sau7sr57jba6rpn4fs6sq66mkq