Work

Simulated annealing driven pattern search algorithms for global optimization

Year: 2008
Type: dissertation
Abstract: This dissertation is concerned with the unconstrained global optimization of nonlinear problems. These \nproblems are not easy to solve because of the multiplicity of local and global minima. In this dissertation, \nwe first study the pattern search method for local optimization. We study the pattern search method \nnumerically and provide a modification to it. In particular, we design a new pattern search method for \nlocal optimization. The new pattern search improves the efficiency and reliability of the original pattern \nsearch method. We then designed two simulated annealing algorithms for global optimization based on \nthe basic features of pattern search. The new methods are therefore hybrid. The first hybrid method is the \nhybrid of simulated annealing and pattern search. This method is denoted by MSA. The second hybrid \nmethod is a combination of MSA and the multi-level single linkage method. This method is denoted \nby SAPS. The performance of MSA and SAPS are reported through extensive experiments on 50 test \nproblems. Results indicate that the new hybrids are efficient and reliable.
Author: Musa Gabere
Language: English
Open Access status: green
OpenAlex ID: W2139077936
Cites: 51
Cited by: 14
Related to: 9