For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Solving Facility Layout Problem Using an Improved Genetic Algorithm
Rong-Long WANG Kozo OKAZAKI
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2005/02/01
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Numerical Analysis and Optimization
facility layout problem, quadratic assignment problem, NP-hard, genetic algorithms,
Full Text: PDF>>
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.