A New Mathematical Programming Framework for Facility Layout Design

Anjos, Miguel and Vannelli, Anthony (2006) A New Mathematical Programming Framework for Facility Layout Design.
Published in: INFORMS journal on computing : JOC Vol. 18 (1). pp. 111-118.

Abstract

We present a new framework for efficiently finding competitive solutions for the facility layout problem. This framework is based on the combination of two new mathematical programming models. The first model is a relaxation of the layout problem and is intended to find good starting points for the iterative algorithm used to solve the second model. The second model is an exact formulation of the facility layout problem as a non-convex mathematical program with equilibrium constraints (MPEC). Aspect ratio constraints, which are frequently used in facility layout methods to restrict the occurrence of overly long and narrow departments in the computed layouts, are easily incorporated into this new framework. Finally, we present computational results showing that both models, and hence the complete framework, can be solved efficiently using widely available optimization software. This important feature of the new framework implies that it can be used to find competitive layouts with relatively little computational effort. This is advantageous for a user who wishes to consider several competitive layouts rather than simply using the mathematically optimal layout.


Actions:
Download: [img] Postscript - Preprinted Version
Download (936kB) | Preview
Download: [img] PDF - Preprinted Version
Download (695kB) | Preview
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Content information:
Item Type: Article
Citations: [error in script] 6 (Google Scholar) | [error in script]
Uncontrolled Keywords: [error in script]
Subjects:
  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C90 Applications of mathematical programming

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C06 Large-scale problems

  • 49-XX Calculus of variations and optimal control; optimization > 49Mxx Methods of successive approximations > 49M37 Methods of nonlinear programming type

  • 65-XX Numerical analysis > 65Kxx Mathematical programming, optimization and variational techniques > 65K10 Optimization and variational techniques

  • 49-XX Calculus of variations and optimal control; optimization > 49Mxx Methods of successive approximations > 49M20 Methods of relaxation type

  • 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C25 Convex programming

  • Additional Information: Simultaneously released as University of Waterloo Technical Report UW-E&CE#2002-04
    Uncontrolled Keywords: combinatorial optimization, Convex Optimization, Facilities planning and design, Floorplanning, Global Optimization, VLSI Macro-Cell Layout
    Subjects: 90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C90 Applications of mathematical programming
    90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C06 Large-scale problems
    49-XX Calculus of variations and optimal control; optimization > 49Mxx Methods of successive approximations > 49M37 Methods of nonlinear programming type
    65-XX Numerical analysis > 65Kxx Mathematical programming, optimization and variational techniques > 65K10 Optimization and variational techniques
    49-XX Calculus of variations and optimal control; optimization > 49Mxx Methods of successive approximations > 49M20 Methods of relaxation type
    90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C25 Convex programming
    Divisions: Institute of Computer Science > Computer Science Department - Prof. Dr. Juenger
    Depositing User: Miguel Anjos
    Date Deposited: 24 Mar 2002 00:00
    Last Modified: 19 Dec 2011 09:44
    Deposit Information:
    ZAIK Number: [error in script]
    Depositing User: Miguel Anjos
    Date Deposited: 24 Mar 2002 00:00
    Last Modified: 19 Dec 2011 09:44
    URI: http://e-archive.informatik.uni-koeln.de/id/eprint/428