New Reflection Generator for Simulated Annealing in Mixed-Integer/Continuous Global Optimization

被引:0
作者
H. E. Romeijn
Z. B. Zabinsky
D. L. Graesser
S. Neogi
机构
[1] Erasmus University Rotterdam,Rotterdam School of Management
[2] University of Washington,Industrial Engineering
[3] Boeing Commercial Airplane Group,Advanced Interconnect Technology Development
[4] Intel Corporation,undefined
来源
Journal of Optimization Theory and Applications | 1999年 / 101卷
关键词
Simulated annealing; jamming; mixed-integer/continuous global optimization; composite structural design;
D O I
暂无
中图分类号
学科分类号
摘要
To reduce the well-known jamming problem in global optimization algorithms, we propose a new generator for the simulated annealing algorithm based on the idea of reflection. Furthermore, we give conditions under which the sequence of points generated by this simulated annealing algorithm converges in probability to the global optimum for mixed-integer/continuous global optimization problems. Finally, we present numerical results on some artificial test problems as well as on a composite structural design problem.
引用
收藏
页码:403 / 427
页数:24
相关论文
共 35 条
[1]  
Graesser D. L.(1991)Designing Laminated Composites Using Random Search Techniques Composite Structures 18 311-325
[2]  
Zabinsky Z. B.(1993)Optimal Design of Composite Structures Composite Structures 24 273-281
[3]  
Tuttle M. E.(1987)Minimizing Multimodal Functions of Continuous Variables with the Simulated Annealing Algorithm ACM Transactions on Mathematical Software 13 262-280
[4]  
Kim G. I.(1994)Simulated Annealing for Constrained Global Optimization Journal of Global Optimization 5 101-126
[5]  
Graesser D. L.(1995)Single and Multiobjective Structural Optimization in Discrete-Continuous Variables Using Simulated Annealing International Journal for Numerical Methods in Engineering 38 2753-2773
[6]  
Zabinsky Z. B.(1992) ℝ Journal of Applied Probability 29 885-895
[7]  
Tuttle M. E.(1984)Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions Operations Research 32 1296-1308
[8]  
Kim G. I.(1993)Improving Hit-and-Run for Global Optimization Journal of Global Optimization 3 171-192
[9]  
Corana A.(1987)Hit-and-Run Algorithms for the Identification of Nonredundant Linear Inequalities Mathematical Programming 37 184-207
[10]  
Marchesi M.(1992)Pure Adaptive Search in Global Optimization Mathematical Programming 53 323-338