A graph-pair representation and MIP model based heuristic for the unequal-area facility layout problem

Yavuz A. Bozer, Chi Tai Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

The single-period unequal-area facility layout problem has been studied for several decades. Many solution approaches have been proposed. One approach models the problem as a mixed-integer program (MIP) in which binary (0/1) variables are used to prevent departments from overlapping with one another. Solving these MIPs is a difficult task - currently the largest problems that can be solved to optimality contain only 11 or 12 departments. Motivated by this situation, we developed a heuristic algorithm which utilizes a graph-pair representation technique to relax integer constraints. Our algorithm produces good solutions for problems considerably bigger than 12 departments. Moreover, our approach shows potentials in solving other layout problems such as multi-period or multi-floor.

Original languageEnglish
Title of host publication40th International Conference on Computers and Industrial Engineering
Subtitle of host publicationSoft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010
DOIs
StatePublished - 2010
Event40th International Conference on Computers and Industrial Engineering, CIE40 2010 - Awaji, Japan
Duration: 25 Jul 201028 Jul 2010

Publication series

Name40th International Conference on Computers and Industrial Engineering: Soft Computing Techniques for Advanced Manufacturing and Service Systems, CIE40 2010

Conference

Conference40th International Conference on Computers and Industrial Engineering, CIE40 2010
Country/TerritoryJapan
CityAwaji
Period25/07/1028/07/10

Keywords

  • Graphs
  • Heuristics
  • Mixed-integer programming
  • Simulated annealing
  • Unequal-area layout

Fingerprint

Dive into the research topics of 'A graph-pair representation and MIP model based heuristic for the unequal-area facility layout problem'. Together they form a unique fingerprint.

Cite this