Computers and Industrial Engineering - Special issue on computational intelligence for industrial engineering
Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms and Manufacturing Systems Design
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
A shape-based block layout approach to facility layout problems using hybrid genetic algorithm
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Simulated annealing heuristics for the dynamic facility layout problem
Computers and Operations Research
Damage detection by an adaptive real-parameter simulated annealing genetic algorithm
Computers and Structures
Computers and Operations Research
Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
Computers and Operations Research
A continuous approach to considering uncertainty in facility design
Computers and Operations Research
A solution to the unequal area facilities layout problem by genetic algorithm
Computers in Industry - Special issue: Application of genetics algorithms in industry
Genetic application in a facility location problem with random demand within queuing framework
Journal of Intelligent Manufacturing
Hi-index | 0.00 |
In this study, a facility layout problem having NP-hard problem characteristic is attempted to be solved by using two different meta-heuristic approaches--Genetic Algorithm (GA) and Simulated Annealing (SA)--and a hybrid approach--Genetic Algorithm/Simulated Annealing (HGASA). The case study is completed for a company which can be seen as a small or a medium size enterprise. First, parameter values of GA and SA are determined by testing for various combinations of them. Then, the algorithms are run for one hundred times. The results of the algorithms are compared based on their fitness values and calculation time requirements using the paired-t test, mean and standard values. The results show that SA performs better than the others in terms of the fitness values and the time requirements. In this study, we also test the performance of our GA, SA and HGASA methodologies using some of the well-known test problems from the literature. We obtain very close results to those in literature.