Facility-layout problems are well-known members of the class of wicked problems. Not only are these problems computationally intractable, they defy precise formulation which underscores their ‘wickedness’. A conversational optimization methodology is developed for solving the facility-layout planning problem, which utilizes a Lagrangean relaxation process to transform the original problem into a simpler combinatorial optimization problem. The original problem is a set-packing problem, whereas the transformed problem is a relaxed assignment problem. Along with the conversational optimization methodology an APL (a programming language) implementation of the process, a detailed example, and additional examples demonstrating the range and flexibility of the conversational models are presented.
Get full access to this article
View all access options for this article.
References
1.
AspvallBStoneR E, 1979, “Khachiyan's linear programming algorithm” report STAN-CS-79-776, Department of Computer Science, Stanford University, Stanford, CA
2.
BazaraaM S, 1975, “Computerized layout design: A branch and bound approach”American Institute of Industrial Engineers Transactions7432–438
3.
BazaraaM SShettyC M, 1979Nonlinear Programming (John Wiley, New York)
4.
BraybrookeDLindbloomC E, 1963A Strategy of Decision (Free Press, New York)
5.
ChurchmanC W, 1968aThe Challenge to Reason (McGraw-Hill, New York)
6.
ChurchmanC W, 1968bThe Systems Approach (Dell, New York)
7.
ChurchmanC W, 1971The Design of Inquiring Systems (Basic Books, New York)
8.
ChurchmanC W, 1978The Systems Approach and its Enemies (Basic Books, New York)
9.
CookS A, 1971, “The complexity of theorem-proving procedures”Proceedings of the Third ACM Symposium on Theory of ComputingAssociation for Computing Machinery, 1133 Avenue of the Americas, New York 10036; pp 151–158
10.
CullenFJarvisJ JRatliffH D, 1981, “Set partitioning based heuristics for interactive routing”Networks11125–143
11.
DreznerZ, 1980, “DISCON: A new method for the layout problem”Operations Research281375–1384
12.
FisherM, 1981, “The Lagrangean relaxation method for solving integer programming problems”Management Science271–18
13.
FouldsL R, 1983, “Techniques for facilities layout”Management Science291414–1426
14.
FrancisRWhiteJ, 1974Facility Layout and Location: An Analytical Approach (Prentice-Hall, Englewood Cliffs, NJ)
15.
GareyMJohnsonD S, 1979Computers and Intractability: A Guide to the Theory of NP-completeness (W H Freeman, San Francisco, CA)
16.
HorowitzESahniS, 1979Fundamentals of Computer Algorithms (Computer Science Press, Potomac, MD)
17.
HwangC LMasudA S D, 1979Multiple Objective Decision Making-methods and Applications (Springer, Berlin)
18.
KarpR M, 1972, “Reducibility among combinatorial problems” in Complexity of Computer Computations Eds MillerR EThatcherJ W, (Plenum, New York) pp 85–103
19.
KarpR M, 1975, “On the computational complexity of combinatorial problems”Networks545–68
20.
KeeneyR LRaiffaH, 1976Decisions with Multiple Objectives (John Wiley, New York)
21.
KhoshatefehRSmithJ M, 1981, “Set partitioning, packing, and covering models of facility layout and location” paper presented at the Operations Research Society of America/Canadian Operational Research Society/The Institute of Management Science, International Meeting, Toronto, Canada; copy obtainable from Department of Industrial Engineering and Operations Research, University of Massachusetts, Amherst, MA
22.
KoopmansT CBeckmannM, 1957, “Assignment problems and the location of economic activities”Econometrica2552–76
23.
KrarupJPruzanP M, 1978, “Computer aided layout design” in Mathematical Programming Study 9 Eds BalinskiM LLemarechalC, (North-Holland, Amsterdam) pp 75–94
24.
LiggettR, 1981, “The quadratic assignment problem”Management Science27442–458
ReingoldE MNievergeltJDeoN, 1977Combinatorial Algorithms: Theory and Practice (Prentice-Hall, Englewood Cliffs, NJ)
27.
RittelH, 1972a, “On the planning crisis: Systems analysis of the ‘first and second generations’”Bedrifts Okonomen8390–396
28.
RittelH, 1972b, “Structure and usefulness of planning information systems”Bedrifts Okonomen8398–401
29.
RittelHWebberM, 1973, “Dilemmas in a general theory of planning”Policy Sciences4155–167
30.
SimonH, 1969The Sciences of the Artificial (MIT Press, Cambridge, MA)
31.
MacGregorSmith JLiebmanJ S, 1978, “A zero-one integer-programming formulation of the problem of land-use assignment and transportation-network design”Environment and Planning B5101–115
32.
MacGregorSmith J, 1981, “Wicked design problems and interactive optimization”Proceedings of the International Conference on Cybernetics and SocietyInstitute of Electrical and Electronic Engineers, Systems, Man, and Cybernetics Society, Atlanta, GA, pp 218–224
33.
MacGregorSmith JPelosiR S, 1982, “Interactive modelling of wicked design problems”Proceedings of the Institute of Industrial Engineers 1982, Fall Conference Industrial EngineeringInstitute of Industrial Engineers, Cincinatti, OH, pp 111–119
34.
UlrichW, 1980, “The metaphysics of design: A Simon-Churchman debate”Interfaces1035–40
35.
ZadehL, 1965, “Fuzzy sets”Information and Control8338–353
36.
ZelenyM, 1982Multiple Criteria Decision Making (McGraw-Hill, New York)
37.
ZollarKAdenjorffK, 1972, “Layout planning by computer simulation”American Institute of Industrial Engineers Transactions4116–125
