An efficient algorithm for unequal area facilities layout planning with input and output points

Hyungjune Park, Yoon Ho Seo

Research output: Contribution to journalArticle

Abstract

The facility layout problem is to determine a layout design of facilities so as to minimize a total material handling cost (TMHC). In this paper, unequal area rectangular facilities with fixed dimensions are considered. Each of them has an input and output (I/O) points which can be located within or on the boundaries of facility. On the continual plane, facilities must be placed without overlaps. A two-heuristic algorithm is proposed to deal with this kind of problem. The first step is based on a construction method which places facilities sequentially. A median method is modified to set the position of facility. The second step improves a result of the first step. A facility group which can be moved horizontally or vertically without incurring an overlap is constituted and a group movement is done when it reduces a TMHC. Computational experiments show the proposed algorithm produces comparable quality of layouts to previous research within much shorter time.

Original languageEnglish
Pages (from-to)56-74
Number of pages19
JournalINFOR
Volume57
Issue number1
DOIs
Publication statusPublished - 2019 Jan 1

Fingerprint

Planning
Materials handling
Heuristic algorithms
Costs
Experiments

Keywords

  • Facility layout problem
  • Group movement
  • Input and output points
  • Modified median method
  • Unequal area facility

ASJC Scopus subject areas

  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

An efficient algorithm for unequal area facilities layout planning with input and output points. / Park, Hyungjune; Seo, Yoon Ho.

In: INFOR, Vol. 57, No. 1, 01.01.2019, p. 56-74.

Research output: Contribution to journalArticle

@article{66d3d51c79e943918d3f40addddf3af2,
title = "An efficient algorithm for unequal area facilities layout planning with input and output points",
abstract = "The facility layout problem is to determine a layout design of facilities so as to minimize a total material handling cost (TMHC). In this paper, unequal area rectangular facilities with fixed dimensions are considered. Each of them has an input and output (I/O) points which can be located within or on the boundaries of facility. On the continual plane, facilities must be placed without overlaps. A two-heuristic algorithm is proposed to deal with this kind of problem. The first step is based on a construction method which places facilities sequentially. A median method is modified to set the position of facility. The second step improves a result of the first step. A facility group which can be moved horizontally or vertically without incurring an overlap is constituted and a group movement is done when it reduces a TMHC. Computational experiments show the proposed algorithm produces comparable quality of layouts to previous research within much shorter time.",
keywords = "Facility layout problem, Group movement, Input and output points, Modified median method, Unequal area facility",
author = "Hyungjune Park and Seo, {Yoon Ho}",
year = "2019",
month = "1",
day = "1",
doi = "10.1080/03155986.2017.1396709",
language = "English",
volume = "57",
pages = "56--74",
journal = "INFOR",
issn = "0315-5986",
publisher = "University of Toronto Press",
number = "1",

}

TY - JOUR

T1 - An efficient algorithm for unequal area facilities layout planning with input and output points

AU - Park, Hyungjune

AU - Seo, Yoon Ho

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The facility layout problem is to determine a layout design of facilities so as to minimize a total material handling cost (TMHC). In this paper, unequal area rectangular facilities with fixed dimensions are considered. Each of them has an input and output (I/O) points which can be located within or on the boundaries of facility. On the continual plane, facilities must be placed without overlaps. A two-heuristic algorithm is proposed to deal with this kind of problem. The first step is based on a construction method which places facilities sequentially. A median method is modified to set the position of facility. The second step improves a result of the first step. A facility group which can be moved horizontally or vertically without incurring an overlap is constituted and a group movement is done when it reduces a TMHC. Computational experiments show the proposed algorithm produces comparable quality of layouts to previous research within much shorter time.

AB - The facility layout problem is to determine a layout design of facilities so as to minimize a total material handling cost (TMHC). In this paper, unequal area rectangular facilities with fixed dimensions are considered. Each of them has an input and output (I/O) points which can be located within or on the boundaries of facility. On the continual plane, facilities must be placed without overlaps. A two-heuristic algorithm is proposed to deal with this kind of problem. The first step is based on a construction method which places facilities sequentially. A median method is modified to set the position of facility. The second step improves a result of the first step. A facility group which can be moved horizontally or vertically without incurring an overlap is constituted and a group movement is done when it reduces a TMHC. Computational experiments show the proposed algorithm produces comparable quality of layouts to previous research within much shorter time.

KW - Facility layout problem

KW - Group movement

KW - Input and output points

KW - Modified median method

KW - Unequal area facility

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

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

U2 - 10.1080/03155986.2017.1396709

DO - 10.1080/03155986.2017.1396709

M3 - Article

VL - 57

SP - 56

EP - 74

JO - INFOR

JF - INFOR

SN - 0315-5986

IS - 1

ER -