Chemical plant layout via graph partitioning - II. Multiple levels

Computers and Chemical Engineering

Volumn 20, Issue 5, 1996, Pages 563-578

  Jayakumar, S ^a   Reklaitis, G V ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEMICAL EQUIPMENT; CHEMICAL PLANTS; COSTS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEARIZATION; NONLINEAR PROGRAMMING; OPTIMIZATION;

GRAPH PARTITIONING; INTEGER NONLINEAR PROGRAMMING; LAGRANGEAN RELAXATION; MATERIALS FLOW; SUBGRADIENT OPTIMIZATION;

PLANT LAYOUT;

EID: 0030150937     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/0098-1354(95)00208-1     Document Type: Article

References (31)

1. Aboudi R. and G. L. Nemhauser, Some facets for an assignment problem with side constraints. Op. Res. 39, 244-250 (1991).
2. Adams W. P. and H. D. Sherali, A tight linearization and an algorithm for zero-one quadratic programming problems. Manag. Sci. 32, 1274-1290 (1986).
3. Adams W. P. and H. D. Sherali, Linearization strategies for a class of zero-one mixed integer programming problems. Op. Res. 38, 217-226 (1990).
4. Bazaraa M. S. and H. D. Sherali, On the choice of step size in subgradient optimization. EJOR 7, 380-388 (1981).
5. Bazaraa M. S. and H. D. Sherali, On the use of exact and heuristic curing plane methods for the quadratic assignment problem. J. Opl. Res. Soc. 33, 991-1003 (1982).
6. Bazaraa M. S., H. D. Sherali and C. M. Shetty, Nonlinear programming: Theory and Algorithms. Wiley, New York (1993).
7. Benders J. F., Partitioning procedures for solving mixed-variable programming problems. Numer. Math. 4, 238-252 (1962).
8. Buffa E. S., G. C. Armour and T. E. Vollmann, Allocating facilities with CRAFT. Harvard Bus. Rev. 42, 136 (1964).
9. Cabot A. V. and S. S. Erenguc, A Branch and Bound algorithm for solving a class of Nonlinear Integer Programming problems. NRLQ 33, 559-567 (1986).
10. Cinar U., Facilities planning: a systems analysis and space allocation approach. In Spatial Synthesis in Computer-aided Building Design (Edited by C. M. Eastman), pp. 19-40. Wiley, New York (1975).
11. CPLEX Optimization, Inc., Using the CPLEX Linear Optimizer. Houston, TX (1990).
12. Fisher M. L., The Lagrangean relaxation method for solving integer programming problems. Manag. Sci. 27, 1-18 (1981).
13. Foulds L. R. and J. W. Griffin, A graph-theoretic heuristic for multi-floor building layout. In Computerized Facilities Planning (Edited by H. L. Hales) IIE (1985).
14. Geoffrion A. M. and R. E. Marsten, Integer programming algorithms: a framework and state-of-the-art survey. Manag. Sci. 18, 465-491 (1972).
15. Glover F. and E. Woolsey, Converting the 0-1 Polynomial Programming problem to a 0-1 Linear Program. Op. Res. 22, 180-182 (1974).
16. Held M., P. Wolfe and H. P. Crowder, Validation of subgradient optimization. Math. Prog. 6, 62-88 (1974).
17. Jayakumar S., Chemical plant layout via graph partitioning. Ph.D. Thesis, Purdue University, West Lafayette, IN (1992).
18. Jayakumar S. and G. V. Reklaitis, Chemical plant layout via graph partitioning - Part I. Single level. Computers Chem. Engng. 18, 441-458 (1994).
19. Jayakumar S. and G. V. Reklaitis, Tight bounds for graph partitioning with multiple property constraints in multi-floor batch chemical plant layout. Ann. AIChE Meeting, Los Angeles, CA (1991).
20. Johnson R. V., Spacecraft for multi-floor layout planning. Manag. Sci. 28, 407-417 (1982).
21. Kaku B. K., G. L. Thompson and I. Baybars, A heuristic method for the multi-storey layout problem. EJOR 37, 384-397 (1988).
22. Kernighan B. W. and S. Lin, An efficient heuristic procedure for partitioning graphs. The Bell Sys. Tech. J. 49, 291-307 (1970).
23. Kocis G. R. and I. E. Grossmann, A modelling and decomposition strategy for the MINLP optimization of process flowsheets. Computers Chem. Engng 13, 797-819 (1989).
24. Korner F., Integer quadratic optimization. EJOR 19, 268-273 (1985).
25. Lazimy R., Mixed-integer quadratic programming. Math. Prog. 22, 332-349 (1982).
26. Lemke C. E. and J. T. Howson, Equilibrium points of bimatrix games. J. SIAM 12, 413-423 (1964).
27. McBride R. D. and J. S. Yormark, An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282-296 (1980).
28. Poljak B. T., A general method of solving extremum problems. Soviet Math. 8, 593-597 (1967).
29. Reklaitis G. V., Material and Energy Balances. Wiley, New York (1983).
30. Sherali H. D. and D. C. Myers, Dual formulations and subgradient optimization strategies for lienar programming relaxations of Mixed-Integer Programs. Discrete App. Math. 20, 51-68 (1988).
31. Singhal J. A., R. E. Marsten and T. L. Morin, Fixed order branch-and-bound methods for Mixed-Integer Programming: the ZOOM System. Dept of Management Information Systems, University of Arizona, Tucson, AZ (1987).