Management Science
A parallel algorithm for the quadratic assignment problem
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Genetic search and the dynamic facility layout problem
Computers and Operations Research - Special issue: heuristic, genetic and tabu search
ACO algorithms for the quadratic assignment problem
New ideas in optimization
A simulated annealing algorithm for dynamic layout problem
Computers and Operations Research
The Ant System Applied to the Quadratic Assignment Problem
IEEE Transactions on Knowledge and Data Engineering
Computers and Operations Research
Simulated annealing heuristics for the dynamic facility layout problem
Computers and Operations Research
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
| Hi-index | 0.01 |
Today's consumer market demands that manufacturers must be competitive. This requires the efficient operation of manufacturing plants and their ability to quickly respond to changes in product mix and demand. In addition, studies show that material-handling cost make up between 20 and 50 percent of the total operating cost. Therefore, this paper considers the problem of arranging and rearranging, when there are changes in product mix and demand, manufacturing facilities such that the sum of material handling and rearrangement costs is minimized. This problem is called the dynamic facility layout problem (DFLP). In this paper, hybrid ant systems (HASs) are developed to solve the DFLP. To test the performance of the meta-heuristics, two data sets taken from the literature are used in the analysis. The results show that the HASs are efficient techniques for solving the DFLP. More importantly, HASs found new best solutions for more than one-half of all the test problems.