Stochastic methods for practical global optimization

被引:22
作者
Zabinsky, ZB [1 ]
机构
[1] Univ Washington, Seattle, WA 98195 USA
基金
美国国家航空航天局; 美国国家科学基金会;
关键词
adaptive search; global optimization; multi-disciplinary optimization; simulated annealing;
D O I
10.1023/A:1008350230239
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Engineering design problems often involve global optimization of functions that are supplied as 'black box' functions. These functions may be nonconvex, nondifferentiable and even discontinuous. In addition, the decision variables may be a combination of discrete and continuous variables. The functions are usually computationally expensive, and may involve finite element methods. An engineering example of this type of problem is to minimize the weight of a structure, while limiting strain to be below a certain threshold. This type of global optimization problem is very difficult to solve, yet design engineers must find some solution to their problem - even if it is a suboptimal one. Sometimes the most difficult part of the problem is finding any feasible solution. Stochastic methods, including sequential random search and simulated annealing, are finding many applications to this type of practical global optimization problem. Improving Hit-and-Run (MR) is a sequential random search method that has been successfully used in several engineering design applications, such as the optimal design of composite structures. A motivation to IHR is discussed as well as several enhancements. The enhancements include allowing both continuous and discrete variables in the problem formulation. This has many practical advantages, because design variables often involve a mixture of continuous and discrete values. IHR and several variations have been applied to the composites design problem. Some of this practical experience is discussed.
引用
收藏
页码:433 / 444
页数:12
相关论文
共 38 条
[1]  
[Anonymous], 1995, Handbook of global optimization, Nonconvex Optimization and its Applications
[2]   Hesitant adaptive search for global optimisation [J].
Bulger, DW ;
Wood, GR .
MATHEMATICAL PROGRAMMING, 1998, 81 (01) :89-102
[3]   GLOBAL OPTIMIZATION AND SIMULATED ANNEALING [J].
DEKKERS, A ;
AARTS, E .
MATHEMATICAL PROGRAMMING, 1991, 50 (03) :367-393
[4]   DESIGNING LAMINATED COMPOSITES USING RANDOM SEARCH TECHNIQUES [J].
GRAESSER, DL ;
ZABINSKY, ZB ;
TUTTLE, ME ;
KIM, GI .
COMPOSITE STRUCTURES, 1991, 18 (04) :311-325
[5]   OPTIMAL-DESIGN OF A COMPOSITE STRUCTURE [J].
GRAESSER, DL ;
ZABINSKY, ZB ;
TUTTLE, ME ;
KIM, GI .
COMPOSITE STRUCTURES, 1993, 24 (04) :273-281
[6]  
Haftka Raphael T., 1992, ELEMENTS STRUCTURAL
[7]  
Jones RM., 2018, MECH COMPOS MATER
[8]   OPTIMIZATION BY SIMULATED ANNEALING [J].
KIRKPATRICK, S ;
GELATT, CD ;
VECCHI, MP .
SCIENCE, 1983, 220 (4598) :671-680
[9]  
KRISTINSDOTTIR BP, 1997, THESIS U WASHINGTON
[10]   RANDOMIZED PATTERN SEARCH [J].
LAWRENCE, JP ;
STEIGLITZ, K .
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (04) :382-+