Golden section search and hybrid tabu search-simulated annealing for layout design of unequal-sized facilities with fixed input and output points

Donghwa Jeong, Yoon Ho Seo

Research output: Contribution to journalArticle

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. Because a mixed integer-programming model cannot solve large-sized problems in a reasonable amount of computational time, a heuristic algorithm composed of a placing method based on golden section search and 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 fewer than six facilities and improves the best-known results from Xiao et al.(2013) in a shorter time.

Original languageEnglish
Pages (from-to)297-315
Number of pages19
JournalInternational Journal of Industrial Engineering : Theory Applications and Practice
Volume25
Issue number3
Publication statusPublished - 2018 Jan 1

Fingerprint

Tabu search
Simulated annealing
Integer programming
Heuristic algorithms
Experiments

Keywords

  • Facility layout
  • Golden section search
  • Input
  • Output points
  • Simulated annealing
  • Tabu search

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Cite this

@article{03c57ec54bfb4c57bbde47b8262deba3,
title = "Golden section search and hybrid tabu search-simulated annealing for layout design of unequal-sized facilities with fixed input and output points",
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. Because a mixed integer-programming model cannot solve large-sized problems in a reasonable amount of computational time, a heuristic algorithm composed of a placing method based on golden section search and 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 fewer than six facilities and improves the best-known results from Xiao et al.(2013) in a shorter time.",
keywords = "Facility layout, Golden section search, Input, Output points, Simulated annealing, Tabu search",
author = "Donghwa Jeong and Seo, {Yoon Ho}",
year = "2018",
month = "1",
day = "1",
language = "English",
volume = "25",
pages = "297--315",
journal = "International Journal of Industrial Engineering : Theory Applications and Practice",
issn = "1072-4761",
publisher = "University of Cincinnati",
number = "3",

}

TY - JOUR

T1 - Golden section search and hybrid tabu search-simulated annealing for layout design of unequal-sized facilities with fixed input and output points

AU - Jeong, Donghwa

AU - Seo, Yoon Ho

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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. Because a mixed integer-programming model cannot solve large-sized problems in a reasonable amount of computational time, a heuristic algorithm composed of a placing method based on golden section search and 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 fewer than six facilities and improves the best-known results from Xiao et al.(2013) in a shorter time.

AB - 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. Because a mixed integer-programming model cannot solve large-sized problems in a reasonable amount of computational time, a heuristic algorithm composed of a placing method based on golden section search and 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 fewer than six facilities and improves the best-known results from Xiao et al.(2013) in a shorter time.

KW - Facility layout

KW - Golden section search

KW - Input

KW - Output points

KW - Simulated annealing

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=85053928747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053928747&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85053928747

VL - 25

SP - 297

EP - 315

JO - International Journal of Industrial Engineering : Theory Applications and Practice

JF - International Journal of Industrial Engineering : Theory Applications and Practice

SN - 1072-4761

IS - 3

ER -