this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...

There is a developing theory of growing power which, at its current stage of development (indeed, for a number of years now), speaks to qualitative and quantitative aspects of search strategies. Although it has been specialized and applied to genetic algorithms, it's implications and applicability are far more general. This paper deals with the broad outlines of the theory, introducing basic pr...

Abstract. A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general p...

Random search algorithms are useful for many ill-structured global optimization problems with continuous and/or discrete variables. Typically random search algorithms sacrifice a guarantee of optimality for finding a good solution quickly with convergence results in probability. Random search algorithms include simulated annealing, tabu search, genetic algorithms, evolutionary programming, part...

Prediksi keberlangsungan hidup pasien gagal jantung telah dilakukan pada penelitian untuk mencari tahu tentang kinerja, akurasi, presisi dan performa dari model prediksi ataupun metode yang digunakan dalam penelitian, dengan menggunakan dataset heart failure clinical records. Namun ini memiliki permasalahan yaitu bersifat tidak seimbang dapat menurunkan kinerja karena cenderung menghasilkan kel...

Many spaces that need to be searched in the sciences are too unwieldy for random search to stand any hope of success. Success instead requires a nonrandom search. But how does one find a nonrandom search that stands a good chance of success? Even to pose the question this way suggests that such nonrandom searches do not magically materialize but need themselves to be discovered by a process of ...

Consider the problem of control selection in complex dynamical and environmental scenarios where model predictive control (MPC) proves particularly effective. As the performance of MPC is highly dependent on the efficiency of its incorporated search algorithm, this work examined hill climbing as an alternative to traditional systematic or random search algorithms. The relative performance of a ...