Dataset Information

Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms.

ABSTRACT: In this data article, we present the data used to evaluate the statistical success of the backtracking search optimisation algorithm (BSA) in comparison with the other four evolutionary optimisation algorithms. The data presented in this data article is related to the research article entitles 'Operational Framework for Recent Advances in Backtracking Search Optimisation Algorithm: A Systematic Review and Performance Evaluation' [1]. Three statistical tests conducted on BSA compared to differential evolution algorithm (DE), particle swarm optimisation (PSO), artificial bee colony (ABC), and firefly algorithm (FF). The tests are used to evaluate these mentioned algorithms and to determine which one could solve a specific optimisation problem concerning the statistical success of 16 benchmark problems taking several criteria into account. The criteria are initializing control parameters, dimension of the problems, their search space, and number of iterations needed to minimise a problem, the performance of the computer used to code the algorithms and their programming style, getting a balance on the effect of randomization, and the use of different type of optimisation problem in terms of hardness and their cohort. In addition, all the three tests include necessary statistical measures (Mean: mean-solution, S.D.: standard-deviation of mean-solution, Best: the best solution, Worst: the worst solution, Exec. Time: mean runtime in seconds, No. of succeeds: number of successful minimisation, and No. of Failure: number of failed minimisation).

SUBMITTER: Hassan BA

PROVIDER: S-EPMC6948123 | biostudies-literature | 2020 Feb

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms.

Hassan Bryar A BA Rashid Tarik A TA

Data in brief 20191223

In this data article, we present the data used to evaluate the statistical success of the backtracking search optimisation algorithm (BSA) in comparison with the other four evolutionary optimisation algorithms. The data presented in this data article is related to the research article entitles 'Operational Framework for Recent Advances in Backtracking Search Optimisation Algorithm: A Systematic Review and Performance Evaluation' [1]. Three statistical tests conducted on BSA compared to different ...[more]

PMID: 31921951

Similar Datasets

Project description:The key to obtaining the model-free description of the dynamics of a macromolecule is the optimisation of the model-free and Brownian rotational diffusion parameters using the collected R (1), R (2) and steady-state NOE relaxation data. The problem of optimising the chi-squared value is often assumed to be trivial, however, the long chain of dependencies required for its calculation complicates the model-free chi-squared space. Convolutions are induced by the Lorentzian form of the spectral density functions, the linear recombinations of certain spectral density values to obtain the relaxation rates, the calculation of the NOE using the ratio of two of these rates, and finally the quadratic form of the chi-squared equation itself. Two major topological features of the model-free space complicate optimisation. The first is a long, shallow valley which commences at infinite correlation times and gradually approaches the minimum. The most severe convolution occurs for motions on two timescales in which the minimum is often located at the end of a long, deep, curved tunnel or multidimensional valley through the space. A large number of optimisation algorithms will be investigated and their performance compared to determine which techniques are suitable for use in model-free analysis. Local optimisation algorithms will be shown to be sufficient for minimisation not only within the model-free space but also for the minimisation of the Brownian rotational diffusion tensor. In addition the performance of the programs Modelfree and Dasha are investigated. A number of model-free optimisation failures were identified: the inability to slide along the limits, the singular matrix failure of the Levenberg-Marquardt minimisation algorithm, the low precision of both programs, and a bug in Modelfree. Significantly, the singular matrix failure of the Levenberg-Marquardt algorithm occurs when internal correlation times are undefined and is greatly amplified in model-free analysis by both the grid search and constraint algorithms. The program relax ( http://www.nmr-relax.com ) is also presented as a new software package designed for the analysis of macromolecular dynamics through the use of NMR relaxation data and which alleviates all of the problems inherent within model-free analysis.

Dataset Information

Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms.

Publications

Datasets on statistical analysis and performance evaluation of backtracking search optimisation algorithm compared with its counterpart algorithms.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets