Stochastic global optimization methods. part 1: clustering methods
Mathematical Programming: Series A and B
Stochastic global optimization methods. part 11: multi level methods
Mathematical Programming: Series A and B
Global optimization and simulated annealing
Mathematical Programming: Series A and B
Application of stochastic global optimization algorithms to practical problems
Journal of Optimization Theory and Applications
Aspiration Based Simulated Annealing Algorithm
Journal of Global Optimization
Journal of Global Optimization
A Numerical Comparison of Some Modified Controlled Random SearchAlgorithms
Journal of Global Optimization
Convergence of a Simulated Annealing Algorithm for Continuous Global Optimization
Journal of Global Optimization
Population set-based global optimization algorithms: some modifications and numerical studies
Computers and Operations Research
Journal of Global Optimization
A Differential Free Point Generation Scheme in the Differential Evolution Algorithm
Journal of Global Optimization
Sequential virtual motion camouflage method for nonlinear constrained optimal trajectory control
Automatica (Journal of IFAC)
Controlling variability in split-merge systems
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
A derivative-free filter driven multistart technique for global optimization
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part III
Multilocal programming: a derivative-free filter multistart algorithm
ICCSA'13 Proceedings of the 13th international conference on Computational Science and Its Applications - Volume 1
Global optimization using a genetic algorithm with hierarchically structured population
Journal of Computational and Applied Mathematics
Hi-index | 7.30 |
A derivative-free simulated annealing driven multi-start algorithm for continuous global optimization is presented. We first propose a trial point generation scheme in continuous simulated annealing which eliminates the need for the gradient-based trial point generation. We then suitably embed the multi-start procedure within the simulated annealing algorithm. We modify the derivative-free pattern search method and use it as the local search in the multi-start procedure. We study the convergence properties of the algorithm and test its performance on a set of 50 problems. Numerical results are presented which show the robustness of the algorithm. Numerical comparisons with a gradient-based simulated annealing algorithm and three population-based global optimization algorithms show that the new algorithm could offer a reasonable alternative to many currently available global optimization algorithms, specially for problems requiring 'direct search' type algorithm.