Genetic Algorithms for solving The Facility Layout Problem
Main Article Content
Abstract
This paper introduces genetic algorithms for solving a facility layout problem which is an
optimization problem. The objective generally for facility layout problem is to minimize the material
flow cost. The concept of genetic algorithms is based on the process of natural selection in a biological
system. The basic features of genetic algorithm are encoding, evaluation, selection, crossover, and
mutation. Genetic algorithms can be efficiently applied to facility layout problems in both static and
dynamic styles.
optimization problem. The objective generally for facility layout problem is to minimize the material
flow cost. The concept of genetic algorithms is based on the process of natural selection in a biological
system. The basic features of genetic algorithm are encoding, evaluation, selection, crossover, and
mutation. Genetic algorithms can be efficiently applied to facility layout problems in both static and
dynamic styles.
Article Details
How to Cite
Peerapattana, P. (2013). Genetic Algorithms for solving The Facility Layout Problem. Engineering and Applied Science Research, 33(4), 313–324. Retrieved from https://ph01.tci-thaijo.org/index.php/easr/article/view/5999
Issue
Section
ORIGINAL RESEARCH
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.