The zone-based dynamic facility layout problem

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The dynamic facility layout problem (DFLP) is to decide the locations of the departments in a facility over multiple planning periods. The main challenge in the DFLP is that there are two conflicting objectives of the problem: minimizing the material handling cost and the rearrangement cost. The cost of changing the structure of the layout over the planning horizon is also considered. Therefore, we model and solve the unequal area zone-based DFLP (ZDFLP) where the dimensions of the departments are decision variables and the departments are assigned to flexible zones with a pre-structured positioning. A zone-based block layout inherently includes possible aisle structures which can easily be adapted to the material handling system in use. This is particularly important in the DFLP because the changes in a block layout may require structural modifications in the material handling system, which in turn may be very costly. The proposed approach also considers determining relative department locations, their dimensions, as well as input/ output (I/O) points concurrently for the first time in the literature. A new matheuristic, which combines concepts from simulated annealing, variable neighbourhood search, and mixed-integer programming, is used to solve the ZDFLP with promising results.

Original languageEnglish (US)
Pages (from-to)1-31
Number of pages31
JournalINFOR
Volume57
Issue number1
DOIs
StatePublished - Jan 1 2019

Fingerprint

Materials handling
Costs
Planning
Integer programming
Simulated annealing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

@article{9743883d3ea34f3c8a8ba6f40909f018,
title = "The zone-based dynamic facility layout problem",
abstract = "The dynamic facility layout problem (DFLP) is to decide the locations of the departments in a facility over multiple planning periods. The main challenge in the DFLP is that there are two conflicting objectives of the problem: minimizing the material handling cost and the rearrangement cost. The cost of changing the structure of the layout over the planning horizon is also considered. Therefore, we model and solve the unequal area zone-based DFLP (ZDFLP) where the dimensions of the departments are decision variables and the departments are assigned to flexible zones with a pre-structured positioning. A zone-based block layout inherently includes possible aisle structures which can easily be adapted to the material handling system in use. This is particularly important in the DFLP because the changes in a block layout may require structural modifications in the material handling system, which in turn may be very costly. The proposed approach also considers determining relative department locations, their dimensions, as well as input/ output (I/O) points concurrently for the first time in the literature. A new matheuristic, which combines concepts from simulated annealing, variable neighbourhood search, and mixed-integer programming, is used to solve the ZDFLP with promising results.",
author = "Sadan Kulturel-Konak",
year = "2019",
month = "1",
day = "1",
doi = "10.1080/03155986.2017.1346915",
language = "English (US)",
volume = "57",
pages = "1--31",
journal = "INFOR: Information Systems and Operational Research",
issn = "0315-5986",
publisher = "University of Toronto Press",
number = "1",

}

The zone-based dynamic facility layout problem. / Kulturel-Konak, Sadan.

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

Research output: Contribution to journalArticle

TY - JOUR

T1 - The zone-based dynamic facility layout problem

AU - Kulturel-Konak, Sadan

PY - 2019/1/1

Y1 - 2019/1/1

N2 - The dynamic facility layout problem (DFLP) is to decide the locations of the departments in a facility over multiple planning periods. The main challenge in the DFLP is that there are two conflicting objectives of the problem: minimizing the material handling cost and the rearrangement cost. The cost of changing the structure of the layout over the planning horizon is also considered. Therefore, we model and solve the unequal area zone-based DFLP (ZDFLP) where the dimensions of the departments are decision variables and the departments are assigned to flexible zones with a pre-structured positioning. A zone-based block layout inherently includes possible aisle structures which can easily be adapted to the material handling system in use. This is particularly important in the DFLP because the changes in a block layout may require structural modifications in the material handling system, which in turn may be very costly. The proposed approach also considers determining relative department locations, their dimensions, as well as input/ output (I/O) points concurrently for the first time in the literature. A new matheuristic, which combines concepts from simulated annealing, variable neighbourhood search, and mixed-integer programming, is used to solve the ZDFLP with promising results.

AB - The dynamic facility layout problem (DFLP) is to decide the locations of the departments in a facility over multiple planning periods. The main challenge in the DFLP is that there are two conflicting objectives of the problem: minimizing the material handling cost and the rearrangement cost. The cost of changing the structure of the layout over the planning horizon is also considered. Therefore, we model and solve the unequal area zone-based DFLP (ZDFLP) where the dimensions of the departments are decision variables and the departments are assigned to flexible zones with a pre-structured positioning. A zone-based block layout inherently includes possible aisle structures which can easily be adapted to the material handling system in use. This is particularly important in the DFLP because the changes in a block layout may require structural modifications in the material handling system, which in turn may be very costly. The proposed approach also considers determining relative department locations, their dimensions, as well as input/ output (I/O) points concurrently for the first time in the literature. A new matheuristic, which combines concepts from simulated annealing, variable neighbourhood search, and mixed-integer programming, is used to solve the ZDFLP with promising results.

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

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

U2 - 10.1080/03155986.2017.1346915

DO - 10.1080/03155986.2017.1346915

M3 - Article

AN - SCOPUS:85048397381

VL - 57

SP - 1

EP - 31

JO - INFOR: Information Systems and Operational Research

JF - INFOR: Information Systems and Operational Research

SN - 0315-5986

IS - 1

ER -