Solving Facility Layout Problem Using an Improved Genetic Algorithm

Authors:
Rong-Long Wang;Kozo Okazaki
Affiliations:
The authors are with the Faculty of Engineering, University of Fukui, Fukui-shi, 910-8507 Japan. E-mail: wang@fuee.fukui-u.ac.jp;The authors are with the Faculty of Engineering, University of Fukui, Fukui-shi, 910-8507 Japan. E-mail: wang@fuee.fukui-u.ac.jp
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2005

Citing 0
Cited 2

Assisted recombination: accelerating genetic improvements of populations in a GA

ISC '07 Proceedings of the 10th IASTED International Conference on Intelligent Systems and Control
Estimating optimal stopping rules in the multiple best choice problem with minimal summarized rank via the cross-entropy method

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The facility layout problem is one of the most fundamental quadratic assignment problems in operations research. In this paper, we present an improved genetic algorithm for solving the facility layout problem. In our computational model, we propose several improvements to the basic genetic procedures including conditional crossover and mutation. The performance of the proposed method is evaluated on some benchmark problems. Computational results showed that the improved genetic algorithm is capable of producing high-quality solutions.