By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yavuz A. Bozer ; Dept. of Industrial & Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA ; Chi-Tai Wang

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.

Published in:

Computers and Industrial Engineering (CIE), 2010 40th International Conference on

Date of Conference:

25-28 July 2010