Documente Academic
Documente Profesional
Documente Cultură
inspires the problem's name. The QAP is NP -complete, which implies that, in
general, it is a hard problem to solve. Optimal solutions to general cases of the
problem can only be found for problems with less no. of departments.
Applications
Cellular and automated machine systems. [1]
2) Mixed-Integer Programming Formulation
A mixed-integer programming formulation for the facility layout problem was
presented by Montreuil in 1990 at a material handling research conference. The model
uses a distance-based objective. The objective is based on flow time rectilinear
distance between centroid of two departments .It utilizes a continuous representation
of a layout. Mixed-integer programming approach is powerful and holds much
promise. However, the model could only be optimally solved for small problems.
Deltahedron Approach
One of the most widely cited adjacency-graph construction approaches is the
Deltahedron Approach (DA). The DA proceeds by determining the sequence
that nodes will enter the graph. At any stage, a node is entered into the centre
of the face (a triangle formed by three nodes) in the graph that will maximize
the adjacency benefits with the other departments in the face. Thus, a planar
graph is always maintained in DA, which allows for an easier transformation
to a block layout. Many heuristics have been developed in an attempt to
improve on DA's performance. The DA has also been modified to consider a
continuous relaxation of the adjacency decision variables using a shortest path
approach.
MATCH
MATCH, developed by Montreuil, Ratliff, and Goetschalckx is an interactive
construction type approach that utilizes a discrete representation and integer
programming to solve a b- matching problem. Their algorithm attempts to find
a matching that maximizes the adjacency score while satisfying the lower and
upper bound on the number of matches with each department, and the total
number of times a department must be matched with all other departments.
The algorithm considers the number of adjacent segments when computing
adjacency scores. The departments generated by MATCH are all rectangular
in shape and the approach is iterative, based on user input.
SPIRAL
SPIRAL, created by Goetschalckx, develops an adjacency graph and then a
block layout from the graph. SPIRAL utilizes the concept of "relationship
tuples" to construct an adjacency graph, where tuples quantify the relationship
between one department and other departments. The graph remains planar due
to its hexagonal structure and is used to construct an approximate relative
location diagram by fitting the unequal-area departments into a row-and-
SHAPE
SHAPE, developed by Hassan, Hogg, and Smith, is a construction algorithm
that utilizes a discrete representation and an objective based on rectilinear
distances between department centroids. The department selection sequence is
dependent on a ranking, which is based on each department's flows and a userdefined critical flow value. Department placement begins at the centre of the
layout. Subsequent department placement is based on the objective function
value with the department placed on each of the layout's four sides. The
algorithm is easy to implement; however, because the department shape is
controlled by the objective function, the shape of departments may deteriorate
toward the end.
6) Metaheuristics
Various meta-heuristics such as SA, GA, and ant colony are currently used to
approximate the solution of very large layout design problems.
Advantages
Better performance
Faster runtime
Suitable for application in large scale DPLP problems
Limits/Disadvantages
Care has to be taken if the surface of the fitness function is relatively flat over
a large area of the site
Determination of layout and the scheduling procedure would need to be
carried out concurrently to demonstrate optimality
Not optimal to solve for problems which have area utilization less than one
May require dummy departments so that the area utilization equals to one.
Consequently, this increases the problem size and results in poorer solution
quality
For discrete representation shapes of the machines are not concerned, so its
difficult to define the real locations of machines.
The continuous representation increases the complexity of problem.
Applications
To solve for:
stochastic layouts
Dynamic layouts.
Stochastic layouts.
Service layouts like hospitals.
Fig.
LayOPT by the Production Modeling Corp. is an implementation of
MULTIPLE and SABLE.
Camera: In this mode, the mouse is used to explore the layout: pan,
zoom and rotate function are available for natural navigation in the 3D
scene.
Edit: This is the main mode used to modify the layout. The objects can
be selected, grouped, moved, rotated and their properties viewed and
edited. A snap grid can optionally be enabled to assist the positioning
of the objects.
Connection: When this mode is enabled, the user can connect objects
to create logical relationship useful for the DES simulation. The
available ports are shown and the user can connect then tracing lines
from one port to the other.
Fig
Fig
Advantages
Limitations
The resulting quantitative results of algorithmic approach often do not capture all of
the design objectives.
An algorithmic approach is usually less effective in solving a practical design
problem.