GOLDEN SECTION SEARCH AND HYBRID TABU SEARCH-SIMULATED ANNEALING FOR LAYOUT DESIGN OF UNEQUAL-SIZED FACILITIES WITH FIXED INPUT AND OUTPUT POINTS

Authors

  • Donghwa Jeong Korea University, School of Industrial Management Engineering
  • Yoonho Seo Korea University, School of Industrial Management Engineering

DOI:

https://doi.org/10.23055/ijietap.2018.25.3.3347

Abstract

The facility layout problem involves the positioning of facilities in order to minimize the total travel distance. This study deals with a layout design of unequal-sized facilities with fixed input and output points. Since a mixed integer programming model cannot solve large-sized problems in a reasonable computational time, a heuristic algorithm composed of a placing method based on golden section search and a hybrid tabu search-simulated annealing is developed. In the placing method, facilities are sequentially arranged by a given sequence and the optimal coordinates of facilities are determined using the golden section search. To find the sequence that yields the minimum total travel distance, the hybrid tabu search-simulated annealing is developed. Computational experiments show that the proposed algorithm generates the optimal layout result for test problems with less than 6 facilities and improves the best known results from Xiao et al.(2013) in a shorter time.

Published

2018-09-27

How to Cite

Jeong, D., & Seo, Y. (2018). GOLDEN SECTION SEARCH AND HYBRID TABU SEARCH-SIMULATED ANNEALING FOR LAYOUT DESIGN OF UNEQUAL-SIZED FACILITIES WITH FIXED INPUT AND OUTPUT POINTS. International Journal of Industrial Engineering: Theory, Applications and Practice, 25(3). https://doi.org/10.23055/ijietap.2018.25.3.3347

Issue

Section

Production Planning and Control