Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

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

  • Received : 2012.02.15
  • Accepted : 2012.04.19
  • Published : 2012.06.30
Download PDF
⟨ Previous Next ⟩

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.

Keywords

References

  1. Urban, T. L. (1993), A heuristic for the dynamic facility layout problem, IIE Transactions, 25, 57-63.
  2. Conway, D. G. and Venkataramanan, M. A. (1994), Genetic search and the dynamic facility layout problem. Computers and Operations Research, 21, 955-960. https://doi.org/10.1016/0305-0548(94)90023-X
  3. Suzuki, A., Yamamoto, H., and Kainuma, Y. (2006), Facility integration problem for resource recycle, Proceedings of International Workshop on Institutional View of SCM, Tokyo, Japan, 329-334.
  4. Suzuki, A., Yamamoto, H., and Tsujimura, Y. (2009), Facility rearrangement problem and evolutionary algorithms under variable demands, Proceedings of Meeting of Division C of the Institute of Electrical Engineers of Japan, Tokushima, Japan, 1198-1203.
  5. Suzuki, A. and Yamamoto, H. (2009), Evolutionary algorithms for solving facility rearrangement problem, Proceedings of 10th Asia Pacific Industrial Engineering and Management System Conference, Kitakyushu, Japan, 1292-1296.
  6. Suzuki, A. and Yamamoto, H. (2010), A two-step genetic algorithm for solving facility rearrangement problem, Proceedings of 11th Asia Pacific Industrial Engineering and Management System Conference, Melaka, Malaysia.

Cited by

  1. A combined tramp ship routing, fleet deployment, and network design problem vol.42, pp.1, 2015, https://doi.org/10.1080/03088839.2013.865847
  2. Production Planning Problem of a Two-Level Supply Chain with Production-Time-Dependent Products vol.11, pp.20, 2021, https://doi.org/10.3390/app11209687