A conceptual framework for combining artificial intelligence and optimization in engineering design

Research in Engineering Design - Theory, Applications, and Concurrent Engineering

Volumn 9, Issue 1, 1997, Pages 20-34

  Cagan, Jonathan ^a   Grossmann, Ignacio E ^a   Hooker, John ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Artificial intelligence; Design; Operations Research; Optimization

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; SYSTEMS ANALYSIS; SYSTEMS ENGINEERING;

CONCEPTUAL FRAMEWORK;

COMPUTER AIDED DESIGN;

EID: 0030704006     PISSN: 09349839     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01607055     Document Type: Article

References (113)

1. Agogino AM, Almgren AS. Techniques for integrating qualitative reasoning and symbolic computation in engineering optimization. Engineering Optimization 1987; 12:117-135
2. Cagan J, Mitchell WJ. Optimally directed shape generation by shape annealing. Environment and Planning B, 1993; 20:5-12
3. Choy JK, Agogino AM. SYMON: automated SYMbolic mONotoniciy analysis system for qualitative design optimization. In: Proceedings of ASME 1986 international computers in engineering conference, Chicago. 1986. pp 305-310
4. Cohen RM, May JH. Incorporating OR into an AI design environment to facility planning, working paper number 91-08. Boston University, School of Management 1991
5. Kusiak A. Process planning: a knowledge-based and optimization perspective. IEEE Transactions on Robotics and Automation 1991; 7:257-266
6. Williams BC, Cagan J. Activity analysis: simplifying optimal design problems through qualitative partitioning. Engineering Optimization (in press)
7. Fenves SJ, Grossmann IE. An interdisciplinary course in engineering synthesis. Research in Engineering Design 1992; 3:223-231
8. Brooke A, Kendrick D, Meeraus A. A GAMS user's guide. Scientific Press, Palo Alto, CA 1988
9. Fourer R, Gay DM, Kernighan BW. A modeling language for mathematical programming. Management Science 1990; 36:519-554
10. Leibniz GW. In: Gerhardt CI (ed.). Die philosophische Schriften von G. W. Leibniz, v. 7 Berlin 1890
11. Boole G. The mathematical analysis of logic. Oxford University Press, Oxford 1948
12. Nemhauser GL, Wolsey LA. Integer and combinatorial optimization. John Wiley, New York 1988
13. Bazaara MS, Jarvis JJ, Sherali HD. Linear programming and network flows. John Wiley, New York 1990
14. Newell A, Simon H. Human problem solving. Prentice Hall, Englewood Cliffs, NJ 1972
15. Quine WV. From a logical point of view: nine logicophilosophical essays. Harvard University Press, Cambridge, MA 1961
16. Rumelhart DE, Hinton GE, Williams RJ. Learning internal representation. In: Rumelhart DE, McClelland JL (eds). Parallel distributed processing: exploration in the microstructure of cognition, vol. 1: Foundations. MIT Press, Cambridge, MA. 1986. pp 318-362
17. Goldberg DE. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA 1989
18. Freuder EC. Exploiting structure in constraint satisfaction problems. In: Mayoh B, Tyugu E, Penjam J (eds). Constraint programming. Springer-Verlag, Berlin 1993. pp 50-74
19. Nadel B. Constraint satisfaction algorithms. Computational Intelligence 1989; 5:188-224
20. Jiang Y, Richards T, Richards B. No-good backmarking with min-conflict repair in constraint satisfaction and optimization. PPCP94, 1994. pp 36-47
21. Ginsberg ML. Dynamic backtracking. Journal of Artificial Intelligence Research 1993; 1:127-162
22. Ginsberg ML McAllester DA. GSAT and dynamic backtracking. PPCP94 1994. pp 216-225
23. Kirkpatrick S, Gelatt CD Jr, Vecchi MP. Optimization by simulated annealing. Science 1983; 220:671-679
24. Aarts EHL, Korst J. Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. John Wiley, New York 1989
25. Glover F. Tabu search - Part I ORSA Journal on Computing 1989; 1:190-206
26. Glover F. Tabu search - Part II. ORSA Journal on Computing 1990; 2:4-32
27. Glover F. Genetic algorithms and scatter search: unsuspected potentials. Statistics and Computing 1994; 4:131-140
28. Talukdar S, DeSouza P, Murthy S. Organizations for computer-based agents. International Journal of Engineering Intelligent Systems for Electrical Engineering and Communications 1993; 1:75-87
29. Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies. In: Varela F, Bourgine P (eds). Proceedings of ECAL91 - European conference on artificial life. Elsevier, Amsterdam, 1994. pp 134-142
30. Hooker JN. Logic-based methods for optimization. In: Borning A (ed). Principles and practice of constraint programming. Lecture Notes in Computer Science 1994; 874:336-349
31. Hooker JN. Logic-based Benders decomposition. GSIA, Carnegie Mellon University, available at http://www.gsia.cmu. edu/afs/andrew/gsia/jh38/jnh.html. 1995
32. Hooker JN. Inference duality as a basis for sensitivity analysis GSIA, Carnegie Mellon University, available at http://www. gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html. 1996
33. Hooker JN, Yan H, Grossmann IE, Raman R. Logic cuts for processing networks with fixed charges. Computers and Operations Research 1994; 21:265-279
34. Raman R, Grossmann IE. Symbolic integration of logic in mixed integer linear programming techniques for process synthesis. Computers and Chemical Engineering 1993; 17:909
35. IBM. Optimization subroutine library. Guide and reference-release 2. Kingston, New York 1991
36. Karush W. Minima of functions of several variables with inequalities as side conditions. MS Thesis, Department of Mathematics, University of Chicago, Chicago, IL. 1939
37. Kuhn HW, Tucker AW. Nonlinear programming. In: Neyman J (ed.). Proceedings of the second Berkeley symposium on mathematical statistics and probability, University of California Press, Berkeley, CA 1951
38. Williams BC. A theory of interactions: unifying qualitative and quantitative algebraic reasoning. Artificial Intelligence Special Volume on Qualitative Reasoning About Physical Systems II 1991; 51:39-94
39. Papalambros P, Wilde DJ. Global non-iterative design optimization using monotonicity analysis. Transactions of the ASME, Journal of Mechanical Design 1979; 101(4): 645-649
40. Papalambros P, Wilde DJ. Principles of optimal design. Cambridge University Press, Cambridge 1988
41. Wilde DJ. Monotonicity and dominance in optimal hydraulic cylinder design. Trans ASME, Journal of Engineering for Industry 1975; 94(4):1390-1394
42. Lawler E. Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York 1976
43. Korte B, Lovasz L. Greedoids - a structural framework for the greedy algorithm. In: Pulleyblank WR (ed.). Progress in combinatorial optimization. Academic Press, New York 1984 pp 221-244
44. Sorkin GB. Efficient simulated annealing on fractal energy landscapes. Algorithmica 1991; 6:367-418
45. Hooker JN. Needed: an empirical science of algorithms. Operations Research 1994; 42:201-212
46. McGeoch C. Toward an experimental method for algorithm simulation. INFORMS Journal on Computing 1996; 8:1-28
47. Hooker JN. Testing heuristics: we have it all wrong. Journal of Heuristics 1996; 1:33-42
48. Fleischer M, Jacobson SH. The entropy of inhomogeneous Markov chains with application to simulated annealing. Operations Research Dept., Case Western Reserve University, Cleveland OH 1992
49. Dean T, Kaelbling LP, Kirman S, Nicholson A. Planning under time constraints in stochastic domains. Artificial Intelligence 1995; 76:35-74
50. Kaelbling LP, Littman ML, Moore AW. Reinforcement learning: a survey. Journal of AI Research (in press)
51. Chandru V, Vidyasagar M, Vinay V. Tractable theories for the synthesis of neural networks. In: Proceedings, 5th INFORMS conference on computer science and operations research: recent advances in the interface. Kluwer Academic Publishers, Dordrecht 1996
52. Cagan J, Agogino AM. Innovative design of mechanical structures from first principles. Artificial intelligence in Engineering Design, Analysis, and Manufacturing 1987; 1(3):169-189
53. Cagan J, Agogino AM. Dimensional variable expansion - a formal approach to innovative design. Research in Engineering Design 1991; 3:75-85
54. Cagan J, Agogino AM. Inducing constraint activity in innovative design. Artificial Intelligence in Engineering Design, Analysis, and Manufacturing 1991; 5(1):47-61
55. Aelion V, Cagan J, Powers G. Inducing optimally directed innovative designs from chemical engineering first principles. Computers and Chemical Engineering 1991; 15(9):619-627
56. Aelion V, Cagan J, Powers G. Input variable expansion - an algorithmic design generation technique. Research in Engineering Design 1992; 4:101-113
57. Jaffar J, Lassez J-L. From unification to constraints. Logic Programming 87. Proceedings of the 6th Conference, Springer-Verlag 1987. pp 1-18
58. Stiny G. Introduction to shape and shape grammars. Environment and Planning B 1980; 7:343-351
59. Reddy G, Cagan J. An improved shape annealing algorithm for truss topology generation. ASME Journal of Mechanical Design 1995; 117(2(A)):315-321
60. Tsang E. Foundations of constraint satisfaction. Academic Press, London 1993
61. Van Hentenryck P. Constraint satisfaction in logic programming. MIT Press, Cambridge, MA 1989
62. Hansen P, Jaumard B, Mathon V. Constrained nonlinear 0-1 programming. ORSA Journal on Computing 1993; 5:97-119
63. Morgan AP. Solving polynomial systems using continuation for scientific and engineering problems. Prentice Hall, Eaglewood Cliffs, NJ 1987
64. Benhamou F, Older W. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming (in press)
65. Dincbas M, van Hentenryck P, Simonis H, Aggoun A, Graf T, Bertier F. The constraint programming language CHIP. Proceedings of the international conference on fifth generation computer systems FGCS-88. Tokyo 1988
66. Simonis H, Dincbas M. Propositional calculus problems in CHIP. In: Benhamou F, Colmerauer A (eds). Constraint logic programming: selected research. MIT Press, Cambridge, MA. 1993. pp 269-285
67. Bull Corporation. CHARME VI user's guide and reference manual. Artificial Intelligence Development Centre, Bull SA France 1990
68. Drexl A, Jordan C. A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups. ORSA Journal on Computing 1995; 7: 160-165
69. Sciamma D, Gay J, Guillard A. CHARME: a constraint oriented approach to scheduling and resource allocation. Artificial Intelligence in the Pacific Rim. Proceedings of the Pacific Rim international conference on artificial intelligence. Nagoya, Japan. 1990. pp 71-76
70. Le Pape C. Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems. Intelligent Systems Engineering 1994; 3:55-66
71. Puget J-F. AC++ implementation of CLP. Technical Report 94-01, ILOG S.A., Gentilly, France 1994
72. Banel T, Cras J-Y, Kerisit J-M, Sciamma S. Programming by constraints: technology or method?, Genie logiciel et systemes experts 1992; 27:84-88
73. Remy C. Programming by constraints. Micro Systems, No. 104. 1990. pp 147-150
74. Carnahan B, Wilkes JO. Applied numerical methods. John Wiley, New York 1980
75. Dahlquist AB, Anderson N. Numerical methods. Prentice Hall, Englewood Cliffs, NJ 1974
76. Pissanetzky S. Sparse matrix technology. Academic Press, London 1984
77. IMSL Math. Library. FORTRAN subroutines for mathematical applications. Houston, TX 1987
78. Piela PC, Epperly TG, Westerberg KM, Westerberg AW. ASCEND: an object-oriented computer environment for modeling and analysis. Comp Chem Engng 1991; 15:53-72
79. Rice JR. Numerical methods, software, and analysis: IMSL reference edition. McGraw-Hill, New York 1983
80. Aspen Technology. Aspen-plus user guide. Release 8.3. Cambridge MA 1991
81. Banzhaf W. Computer-aided circuit analysis using SPICE. Prentice Hall, Englewood Cliffs NJ 1989
82. Petzold LR. A description of DASSL: a differential/algebraic system solver. Sandia Tech. Rep. 82-8637. 1982
83. Becker E, Oden JT, Carey GF. Finite elements: an introduction. Prentice Hall, Englewoods Cliffs NJ 1982
84. ANSYS, Version 5.0, Swanson Analysis Systems Inc, 1992
85. Bratko I. PROLOG programming for artificial intelligence. Addison-Wesley, Reading, MA 1986
86. Sterling L, Shapiro E. The art of prolog: advanced programming techniques. MIT Press, Cambridge, MA 1986
87. Dodd A. PROLOG: a logical approach. Oxford University Press, New York 1990
88. Colmerauer A. An introduction to Prolog III. Communications of the ACM 1990; 33:52-68
89. Barr A, Feigenbaum EA. (eds) Handbook of artificial intelligence. 3 vols. William Kaufmann, Inc., Los Altos CA 1981
90. VP-Expert. Paperback Software, Berkeley, CA 1989
91. EXSYS Inc. EXSYS user's manual. Albuquerque, NM 1990
92. Hooker JN. A quantitative approach to logical inference. Decision Support Systems 1988; 4:45-69
93. Biegler LT. Strategies for simultaneous solution and optimization of differential-algebraic systems. In: Siirola et al. Proceedings third int. conf. foundations of computer-aided process design. Elsevier, New York 1990
94. Hillier FS, Lieberman GJ. Introduction to operations research. Holden Day, New York 1986
95. SCICONIC/VM user guide (Version 1.4). Scicon Ltd, Milton Keynes. 1986
96. Schrage L. Linear, integer and quadratic programming with LINDO. Scientific Press, Palo Alto, CA 1986
97. Marsten R. User's manual for ZOOM/XMP. Department of Management Information Systems, University of Arizona 1986
98. Nemhauser GL, Savelsbergh MWP, Sigismondi GC. MINTO: a mixed integer optimizer. Operations Research Letters 1994; 15:47-58
99. Marsten R, Saltzman M, Lustig J, Shanno D. Interior point methods for linear programming: Just call Newton, Lagrange and Fiacco and McCormick! Interfaces 1990; 20:105-116
100. Nemhauser GL, Rinnory Kan AHG, Todd MJ. (eds) Optimization (vol. 1, Handbooks in operations research and management science). North-Holland, Amsterdam 1989
101. Reklaitis GV, Ravindran A, Ragsdell KM. Engineering optimization - methods and applications. John Wiley, New York 1983
102. Murtagh BA, Saunders MA. MINOS user's guide. Systems Optimization Laboratory, Department of Operations Research, Stanford University 1985
103. Liebman J, Lasdon L, Schrage L, Warren A. Modelling and optimization with GINO. Scientific Press, Palo Alto, CA 1986
104. Drud AS. CONOPT - a large scale GRC code. ARKI Consulting and Development, Denmark 1991
105. Gill PE, Murray W, Saunders MA, Wright MA. User's guide for SOL/NPSOL: a FORTRAN package for nonlinear programming. Dept. Optns. Res., Stanford University, Technical Report SOL 83-12. 1983
106. Vasantharajan S, Viswanathan J, Biegler LT. Reduced SQP implementation for large-scale optimization problems. Computers Chem. Engng 1990; 14:907-015
107. Geoffrion AM. Generalized benders decomposition. Journal of Optimization Theory and Applications 1972; 10:237-260
108. Grossmann IE. Mixed-integer nonlinear programming techniques for the synthesis of engineering systems. Res Engng Des 1990; 1(0):205-228
109. Viswanathan J, Grossmann IE. A combined penalty function and outer-approximation method for MINLP optimization. Computers Chem. Engng 1990; 14:769-782
110. Bazaraa MS, Shetty CM. Nonlinear programming. John Wiley, New York 1979
111. Nilsson NJ. Principles of artificial intelligence. Tioga Publ. Co., Palo Alto 1980
112. Aarts EHL, van Laarhoven PJM. Statistical cooling: a general approach to combinatorial optimization problems. Phillips J Res 1984; 40
113. van Laarhoven PJM, Aarts EHL, Simulated Annealing: Theory and Algorithms. Reidel, Dordrecht 1987