Methods for Discrete Design Optimization
Marcus Pettersson, Johan Andersson, Petter Krus
- 发表年份
- 2005
- 引用次数
- 19
摘要
One area in design optimization is component based design where the designer has to choose between many different discrete alternatives. These types of problems have discrete character and in order to admit optimization an interpolation between the alternatives is often performed. However, in this paper a modified version of the non-gradient algorithm the Complex method is developed where no interpolation between alternatives is needed. Furthermore, the optimization algorithm itself is optimized using a performance metric that measures the effectiveness of the algorithm. In this way the optimal performance of the proposed discrete Complex method has been identified. Another important area in design optimization is the case of optimization based on simulations. For such problems no gradient information is available, hence non-gradient methods are therefore a natural choice. The application for this paper is the design of an industrial robot where the system performance is evaluated using comprehensive simulation models. The objective is to maximize performance with constraints on lifetime and cost, and the design variables are discrete choices of gear boxes for the different axes.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991