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 Generationud(SANG) algorithm with the combination of Genetic Algorithm-Simulated AnnealingudAlgorithm (GA-SA II). It is applied to a facility layout problem. We simulate twoudalgorithms using Microsoft Visual Basic 6.0 and data is generated from a case study.udThe result shows SANG algorithm gives a better result in terms of moment. It occursudsince SANG algorithm exchanges eight chosen facilities, simultaneously. Therefore, theudbest moment can be found faster.ud