Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points

Hyungjune Park, Yoon Ho Seo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Facility layout problem (FLP) is defined as to find layout which minimizes a material handling cost between facilities, given a set of facilities and material flow quantities between them. In this paper, the material handling cost is the sum of the material flow multiplied by rectangular distances between input and output points. A facility is represented as a fixed shapes rectangular block that has input/output points. Facilities can be placed in one of four possible orientations in a free-space horizontally or vertically. According to a given sequence, facilities are placed in a free-space. To determine each facility's position, median method and center of gravity are used. Based on these two methods, improvement steps in respect of a computation time and objective value are conducted. Each improvement is called quick search and candidate selection, respectively. A total of eight methods are implemented and seven problems in the previous literature are adopted to test proposed methods. For three of seven problems the best known objective values were updated by the proposed methods. Comparison results between eight proposed methods show quick search method is faster 21.6% and 26.9% and candidate selection improves objective value by 1.45% and 1.47% at median method and center of gravity, respectively. It shows the improvement methods were effective to achieve each purpose.

Original languageEnglish
Title of host publication7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017
PublisherIEOM Society
Pages1971
Number of pages1
ISBN (Print)9780985549763
Publication statusPublished - 2017
Event7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017 - Rabat, Morocco
Duration: 2017 Apr 112017 Apr 13

Other

Other7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017
CountryMorocco
CityRabat
Period17/4/1117/4/13

Fingerprint

Heuristic algorithms
Planning
Materials handling
Gravitation
Heuristic algorithm
Layout
Costs

Keywords

  • Candidate selection
  • Facility layout problem
  • Heuristic algorithm
  • Quick search

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this

Park, H., & Seo, Y. H. (2017). Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points. In 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017 (pp. 1971). IEOM Society.

Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points. / Park, Hyungjune; Seo, Yoon Ho.

7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017. IEOM Society, 2017. p. 1971.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, H & Seo, YH 2017, Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points. in 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017. IEOM Society, pp. 1971, 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017, Rabat, Morocco, 17/4/11.
Park H, Seo YH. Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points. In 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017. IEOM Society. 2017. p. 1971
Park, Hyungjune ; Seo, Yoon Ho. / Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points. 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017. IEOM Society, 2017. pp. 1971
@inproceedings{6f9ea4ff505b427392ce937870f45eb4,
title = "Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points",
abstract = "Facility layout problem (FLP) is defined as to find layout which minimizes a material handling cost between facilities, given a set of facilities and material flow quantities between them. In this paper, the material handling cost is the sum of the material flow multiplied by rectangular distances between input and output points. A facility is represented as a fixed shapes rectangular block that has input/output points. Facilities can be placed in one of four possible orientations in a free-space horizontally or vertically. According to a given sequence, facilities are placed in a free-space. To determine each facility's position, median method and center of gravity are used. Based on these two methods, improvement steps in respect of a computation time and objective value are conducted. Each improvement is called quick search and candidate selection, respectively. A total of eight methods are implemented and seven problems in the previous literature are adopted to test proposed methods. For three of seven problems the best known objective values were updated by the proposed methods. Comparison results between eight proposed methods show quick search method is faster 21.6{\%} and 26.9{\%} and candidate selection improves objective value by 1.45{\%} and 1.47{\%} at median method and center of gravity, respectively. It shows the improvement methods were effective to achieve each purpose.",
keywords = "Candidate selection, Facility layout problem, Heuristic algorithm, Quick search",
author = "Hyungjune Park and Seo, {Yoon Ho}",
year = "2017",
language = "English",
isbn = "9780985549763",
pages = "1971",
booktitle = "7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017",
publisher = "IEOM Society",

}

TY - GEN

T1 - Heuristic algorithms development for layout planning of unequal-sized facilities with input/output points

AU - Park, Hyungjune

AU - Seo, Yoon Ho

PY - 2017

Y1 - 2017

N2 - Facility layout problem (FLP) is defined as to find layout which minimizes a material handling cost between facilities, given a set of facilities and material flow quantities between them. In this paper, the material handling cost is the sum of the material flow multiplied by rectangular distances between input and output points. A facility is represented as a fixed shapes rectangular block that has input/output points. Facilities can be placed in one of four possible orientations in a free-space horizontally or vertically. According to a given sequence, facilities are placed in a free-space. To determine each facility's position, median method and center of gravity are used. Based on these two methods, improvement steps in respect of a computation time and objective value are conducted. Each improvement is called quick search and candidate selection, respectively. A total of eight methods are implemented and seven problems in the previous literature are adopted to test proposed methods. For three of seven problems the best known objective values were updated by the proposed methods. Comparison results between eight proposed methods show quick search method is faster 21.6% and 26.9% and candidate selection improves objective value by 1.45% and 1.47% at median method and center of gravity, respectively. It shows the improvement methods were effective to achieve each purpose.

AB - Facility layout problem (FLP) is defined as to find layout which minimizes a material handling cost between facilities, given a set of facilities and material flow quantities between them. In this paper, the material handling cost is the sum of the material flow multiplied by rectangular distances between input and output points. A facility is represented as a fixed shapes rectangular block that has input/output points. Facilities can be placed in one of four possible orientations in a free-space horizontally or vertically. According to a given sequence, facilities are placed in a free-space. To determine each facility's position, median method and center of gravity are used. Based on these two methods, improvement steps in respect of a computation time and objective value are conducted. Each improvement is called quick search and candidate selection, respectively. A total of eight methods are implemented and seven problems in the previous literature are adopted to test proposed methods. For three of seven problems the best known objective values were updated by the proposed methods. Comparison results between eight proposed methods show quick search method is faster 21.6% and 26.9% and candidate selection improves objective value by 1.45% and 1.47% at median method and center of gravity, respectively. It shows the improvement methods were effective to achieve each purpose.

KW - Candidate selection

KW - Facility layout problem

KW - Heuristic algorithm

KW - Quick search

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

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

M3 - Conference contribution

AN - SCOPUS:85018953034

SN - 9780985549763

SP - 1971

BT - 7th Annual Conference on Industrial Engineering and Operations Management, IEOM 2017

PB - IEOM Society

ER -