Comparing between Simulated Annealing Neighborhood Generation with the Combination of Simulated Annealing and Genetic Algorithm in Facility Layout Problem

We present the comparison of the Simulated Annealing Neighborhood Generation
(SANG) algorithm with the combination of Genetic Algorithm-Simulated Annealing
Algorithm (GA-SA II). It is applied to a facility layout problem. We simulate two
algorithms using Microsoft Visual Basic 6.0 and data is generated from a case study.
The result shows SANG algorithm gives a better result in terms of moment. It occurs
since SANG algorithm exchanges eight chosen facilities, simultaneously. Therefore, the
best moment can be found faster.