Solving Facility Rearrangement Problem Using a Genetic Algorithm and a Heuristic Local Search

다국어 초록 (Multilingual Abstract)

In this paper, a procedure using a genetic algorithm (GA) and a heuristic local search (HLS) is proposed for solving facility rearrangement problem (FRP). FRP is a decision problem for stopping/running of facilities and integration of stopped facilities to running facilities to maximize the production capacity of running facilities under the cost constraint. FRP is formulated as an integer programming model for maximizing the total production capacity under the constraint of the total facility operating cost. In the cases of 90 percent of cost constraint and more than 20 facilities, the previous solving method was not effective. To find effective alternatives, this solving procedure using a GA and a HLS is developed. Stopping/running of facilities are searched by GA. The shifting the production operation of stopped facilities into running facilities is searched by HLS, and this local search is executed for one individual in this GA procedure. The effectiveness of the proposed procedure using a GA and HLS is demonstrated by numerical experiment.

목차 (Table of Contents)

• ABSTRACT
• 1. INTRODUCTION
• 2. PROBLEM DEFINITION
• 3. SOLVING PROCEDURE
• 4. NUMERICAL EXPERIMENT
• 5. CONCLUSION
• ACKNOWLEDGMENTS
• REFERENCES

참고문헌 (Reference)

1 Conway, D. G., "Genetic search and the dynamic facility layout problem" 21 : 955-960, 1994

2 Suzuki, A., "Facility rearrangement problem and evolutionary algorithms under variable demands" 1198-1203, 2009

3 Suzuki, A., "Facility integration problem for resource recycle" 329-334, 2006

4 Suzuki, A., "Evolutionary algorithms for solving facility rearrangement problem" 1292-1296, 2009

5 Suzuki, A., "A two-step genetic algorithm for solving facility rearrangement problem" 2010

6 Urban, T. L., "A heuristic for the dynamic facility layout problem" 25 : 57-63, 1993