A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points

Yujie Xiao, Yoon Ho Seo, Minseok Seo

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

The facility layout problem (FLP) is to arrange facilities within a given area so as to minimise the total material-handling cost. An efficient arrangement of facilities plays an important part in the achievement of high productivity in a manufacturing system. This paper focuses on the layout design of unequal-sized facilities with fixed shapes and input/output (I/O) points. A mixed-integer programming (MIP) model is developed to obtain optimal solutions. Since the MIP model is not applicable to large-sized problems, a two-step heuristic algorithm is developed to solve the FLPs. In the first step, a layout solution with moderate quality is generated by using an interconnected zone algorithm and a simulated annealing (SA) algorithm. The zone algorithm is a newly developed layout construction technique which places facilities successively within designated zones according to a placing sequence. The zone concept is introduced to reduce the solution space such that the computational effort is decreased, while SA is used to search for the placing sequences. The second step improves that solution further using the reduced MIP by employing the relative position information obtained from the first step. Computational experiments indicate that the algorithm in the first step can yield on average a 1.048% improvement on the best solutions obtained by the existing algorithms. The second step can further improve the solutions obtained in the first step by 0.484% on average. Compared to the commercial software VIP-PLANOPT 2006 (Engineering Optimization Software 2005), the proposed two-step algorithm improves the solutions by 9.113% on average.

Original languageEnglish
Pages (from-to)4200-4222
Number of pages23
JournalInternational Journal of Production Research
Volume51
Issue number14
DOIs
Publication statusPublished - 2013 Jul 1

Fingerprint

Heuristic algorithms
Integer programming
Simulated annealing
Materials handling
Layout
Heuristic algorithm
Productivity
Mixed integer programming
Costs
Experiments
Placing
Software

Keywords

  • facility layout problem
  • simulated annealing algorithm
  • two-step heuristic
  • unequal sizes
  • zone algorithm

ASJC Scopus subject areas

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

Cite this

A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points. / Xiao, Yujie; Seo, Yoon Ho; Seo, Minseok.

In: International Journal of Production Research, Vol. 51, No. 14, 01.07.2013, p. 4200-4222.

Research output: Contribution to journalArticle

@article{ea9e86cbbce54696ad7c21e1b59e10a5,
title = "A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points",
abstract = "The facility layout problem (FLP) is to arrange facilities within a given area so as to minimise the total material-handling cost. An efficient arrangement of facilities plays an important part in the achievement of high productivity in a manufacturing system. This paper focuses on the layout design of unequal-sized facilities with fixed shapes and input/output (I/O) points. A mixed-integer programming (MIP) model is developed to obtain optimal solutions. Since the MIP model is not applicable to large-sized problems, a two-step heuristic algorithm is developed to solve the FLPs. In the first step, a layout solution with moderate quality is generated by using an interconnected zone algorithm and a simulated annealing (SA) algorithm. The zone algorithm is a newly developed layout construction technique which places facilities successively within designated zones according to a placing sequence. The zone concept is introduced to reduce the solution space such that the computational effort is decreased, while SA is used to search for the placing sequences. The second step improves that solution further using the reduced MIP by employing the relative position information obtained from the first step. Computational experiments indicate that the algorithm in the first step can yield on average a 1.048{\%} improvement on the best solutions obtained by the existing algorithms. The second step can further improve the solutions obtained in the first step by 0.484{\%} on average. Compared to the commercial software VIP-PLANOPT 2006 (Engineering Optimization Software 2005), the proposed two-step algorithm improves the solutions by 9.113{\%} on average.",
keywords = "facility layout problem, simulated annealing algorithm, two-step heuristic, unequal sizes, zone algorithm",
author = "Yujie Xiao and Seo, {Yoon Ho} and Minseok Seo",
year = "2013",
month = "7",
day = "1",
doi = "10.1080/00207543.2012.752589",
language = "English",
volume = "51",
pages = "4200--4222",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "14",

}

TY - JOUR

T1 - A two-step heuristic algorithm for layout design of unequal-sized facilities with input/output points

AU - Xiao, Yujie

AU - Seo, Yoon Ho

AU - Seo, Minseok

PY - 2013/7/1

Y1 - 2013/7/1

N2 - The facility layout problem (FLP) is to arrange facilities within a given area so as to minimise the total material-handling cost. An efficient arrangement of facilities plays an important part in the achievement of high productivity in a manufacturing system. This paper focuses on the layout design of unequal-sized facilities with fixed shapes and input/output (I/O) points. A mixed-integer programming (MIP) model is developed to obtain optimal solutions. Since the MIP model is not applicable to large-sized problems, a two-step heuristic algorithm is developed to solve the FLPs. In the first step, a layout solution with moderate quality is generated by using an interconnected zone algorithm and a simulated annealing (SA) algorithm. The zone algorithm is a newly developed layout construction technique which places facilities successively within designated zones according to a placing sequence. The zone concept is introduced to reduce the solution space such that the computational effort is decreased, while SA is used to search for the placing sequences. The second step improves that solution further using the reduced MIP by employing the relative position information obtained from the first step. Computational experiments indicate that the algorithm in the first step can yield on average a 1.048% improvement on the best solutions obtained by the existing algorithms. The second step can further improve the solutions obtained in the first step by 0.484% on average. Compared to the commercial software VIP-PLANOPT 2006 (Engineering Optimization Software 2005), the proposed two-step algorithm improves the solutions by 9.113% on average.

AB - The facility layout problem (FLP) is to arrange facilities within a given area so as to minimise the total material-handling cost. An efficient arrangement of facilities plays an important part in the achievement of high productivity in a manufacturing system. This paper focuses on the layout design of unequal-sized facilities with fixed shapes and input/output (I/O) points. A mixed-integer programming (MIP) model is developed to obtain optimal solutions. Since the MIP model is not applicable to large-sized problems, a two-step heuristic algorithm is developed to solve the FLPs. In the first step, a layout solution with moderate quality is generated by using an interconnected zone algorithm and a simulated annealing (SA) algorithm. The zone algorithm is a newly developed layout construction technique which places facilities successively within designated zones according to a placing sequence. The zone concept is introduced to reduce the solution space such that the computational effort is decreased, while SA is used to search for the placing sequences. The second step improves that solution further using the reduced MIP by employing the relative position information obtained from the first step. Computational experiments indicate that the algorithm in the first step can yield on average a 1.048% improvement on the best solutions obtained by the existing algorithms. The second step can further improve the solutions obtained in the first step by 0.484% on average. Compared to the commercial software VIP-PLANOPT 2006 (Engineering Optimization Software 2005), the proposed two-step algorithm improves the solutions by 9.113% on average.

KW - facility layout problem

KW - simulated annealing algorithm

KW - two-step heuristic

KW - unequal sizes

KW - zone algorithm

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

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

U2 - 10.1080/00207543.2012.752589

DO - 10.1080/00207543.2012.752589

M3 - Article

AN - SCOPUS:84880571125

VL - 51

SP - 4200

EP - 4222

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 14

ER -