Pure adaptive search in Monte Carlo optimization
Mathematical Programming: Series A and B
Global optimization and simulated annealing
Mathematical Programming: Series A and B
Global optimization of composite laminates using improving hit and run
Recent advances in global optimization
Pure adaptive search in global optimization
Mathematical Programming: Series A and B
Pure adaptive search for finite global optimization
Mathematical Programming: Series A and B
Hesitant adaptive search for global optimisation
Mathematical Programming: Series A and B
New reflection generator for simulated annealing in mixed-integer/continuous global optimization
Journal of Optimization Theory and Applications
Analysis and development of random search algorithms
Analysis and development of random search algorithms
Random Tours in the Traveling Salesman Problem: Analysis and Application
Computational Optimization and Applications
A recursive random search algorithm for large-scale network parameter configuration
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A recursive random search algorithm for network parameter optimization
ACM SIGMETRICS Performance Evaluation Review
Comparative Assessment of Algorithms and Software for Global Optimization
Journal of Global Optimization
Random search optimization approach for highly multi-modal nonlinear problems
Advances in Engineering Software
Development of an intelligent robotic system for the automation of a meat-processing task
International Journal of Intelligent Systems Technologies and Applications
Large-scale network parameter configuration using an on-line simulation framework
IEEE/ACM Transactions on Networking (TON)
Random search optimization approach for highly multi-modal nonlinear problems
Advances in Engineering Software
Pattern discrete and mixed Hit-and-Run for global optimization
Journal of Global Optimization
Hi-index | 0.00 |
Engineering design problems often involve global optimization offunctions that are supplied as ’black box‘ functions. These functions may benonconvex, nondifferentiable and even discontinuous. In addition, thedecision variables may be a combination of discrete and continuousvariables. The functions are usually computationally expensive, and mayinvolve finite element methods. An engineering example of this type ofproblem is to minimize the weight of a structure, while limiting strain tobe below a certain threshold. This type of global optimization problem isvery difficult to solve, yet design engineers must find some solution totheir problem – even if it is a suboptimal one. Sometimes the mostdifficult part of the problem is finding any feasible solution. Stochasticmethods, including sequential random search and simulated annealing, arefinding many applications to this type of practical global optimizationproblem. Improving Hit-and-Run (IHR) is a sequential random search methodthat has been successfully used in several engineering design applications,such as the optimal design of composite structures. A motivation to IHR isdiscussed as well as several enhancements. The enhancements include allowingboth continuous and discrete variables in the problem formulation. This hasmany practical advantages, because design variables often involve a mixtureof continuous and discrete values. IHR and several variations have beenapplied to the composites design problem. Some of this practical experience is discussed.