An Improved Controlled Random Search Method

A modified version of a common global optimization method named controlled random search is presented here. This method is designed to estimate the global minimum of multidimensional symmetric and asymmetric functional problems. The new method modifies the original algorithm by incorporating a new s...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Vasileios Charilogis, Ioannis Tsoulos, Alexandros Tzallas, Nikolaos Anastasopoulos
Formato:	article
Lenguaje:	EN
Publicado:	MDPI AG 2021
Materias:	global optimization random search termination rule Mathematics QA1-939
Acceso en línea:	https://doaj.org/article/bf81f182752b4455a5de2c93078998fc
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:bf81f182752b4455a5de2c93078998fc
record_format	dspace
spelling	oai:doaj.org-article:bf81f182752b4455a5de2c93078998fc2021-11-25T19:05:44ZAn Improved Controlled Random Search Method10.3390/sym131119812073-8994https://doaj.org/article/bf81f182752b4455a5de2c93078998fc2021-10-01T00:00:00Zhttps://www.mdpi.com/2073-8994/13/11/1981https://doaj.org/toc/2073-8994A modified version of a common global optimization method named controlled random search is presented here. This method is designed to estimate the global minimum of multidimensional symmetric and asymmetric functional problems. The new method modifies the original algorithm by incorporating a new sampling method, a new termination rule and the periodical application of a local search optimization algorithm to the points sampled. The new version is compared against the original using some benchmark functions from the relevant literature.Vasileios CharilogisIoannis TsoulosAlexandros TzallasNikolaos AnastasopoulosMDPI AGarticleglobal optimizationrandom searchtermination ruleMathematicsQA1-939ENSymmetry, Vol 13, Iss 1981, p 1981 (2021)
institution	DOAJ
collection	DOAJ
language	EN
topic	global optimization random search termination rule Mathematics QA1-939
spellingShingle	global optimization random search termination rule Mathematics QA1-939 Vasileios Charilogis Ioannis Tsoulos Alexandros Tzallas Nikolaos Anastasopoulos An Improved Controlled Random Search Method
description	A modified version of a common global optimization method named controlled random search is presented here. This method is designed to estimate the global minimum of multidimensional symmetric and asymmetric functional problems. The new method modifies the original algorithm by incorporating a new sampling method, a new termination rule and the periodical application of a local search optimization algorithm to the points sampled. The new version is compared against the original using some benchmark functions from the relevant literature.
format	article
author	Vasileios Charilogis Ioannis Tsoulos Alexandros Tzallas Nikolaos Anastasopoulos
author_facet	Vasileios Charilogis Ioannis Tsoulos Alexandros Tzallas Nikolaos Anastasopoulos
author_sort	Vasileios Charilogis
title	An Improved Controlled Random Search Method
title_short	An Improved Controlled Random Search Method
title_full	An Improved Controlled Random Search Method
title_fullStr	An Improved Controlled Random Search Method
title_full_unstemmed	An Improved Controlled Random Search Method
title_sort	improved controlled random search method
publisher	MDPI AG
publishDate	2021
url	https://doaj.org/article/bf81f182752b4455a5de2c93078998fc
work_keys_str_mv	AT vasileioscharilogis animprovedcontrolledrandomsearchmethod AT ioannistsoulos animprovedcontrolledrandomsearchmethod AT alexandrostzallas animprovedcontrolledrandomsearchmethod AT nikolaosanastasopoulos animprovedcontrolledrandomsearchmethod AT vasileioscharilogis improvedcontrolledrandomsearchmethod AT ioannistsoulos improvedcontrolledrandomsearchmethod AT alexandrostzallas improvedcontrolledrandomsearchmethod AT nikolaosanastasopoulos improvedcontrolledrandomsearchmethod
_version_	1718410302466293760

An Improved Controlled Random Search Method

Ejemplares similares