Abstract
This paper presents motivations and algorithmic details of some generalized controlled random search (CRS) algorithms for global optimization. It also carries out an extensive numerical study of the generalized CRS algorithms to demonstrate their superiorities over their original counterparts. The numerical study is carried out using a set of 50 test problems many of which are inspired by practical applications. Numerical experiments indicate that the generalized algorithms are considerably better than the previous versions. The algorithms are also compared with the DIRECT algorithm (Jones et al., 1993). The comparison shows that the generalized CRS algorithms are better than the DIRECT algorithm in high dimensional problems. Thus, they offer a reasonable alternative to many currently available stochastic algorithms, especially for problems requiring "direct search type" methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
