Abstract⎯This paper proposes a new numerical optimization technique, Search via Probability (SP) algorithm, for single-objective optimization problems. The SP algorithm uses probabilities to control the process of searching for optimal solutions. We calculate probabilities of the appearance of a beter solution than the current one, and on the performance of SP algorithm, we create good conditions for its appearance. We test this approach by implementing the SP algorithm on some test single-objective optimization problems, and we find very stable results
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...
Solution of real world problems have to deal with some uncertainties. This is particularly true for ...
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...
In this paper, an approach to deal with the multi-objective programming problem is regulated by mean...
Many methods are available for finding x*E Rn which minimizes the real value function f(x), some of ...
In this paper we present a direct method for the numerical solution of the constrained optimal contr...
In this paper we present a direct method for the numerical solution of the constrained optimal contr...
A new heuristic method is presented for solving a class of constrained probabilistic optimization pr...
An approach to non-convex multi-objective optimization problems is considered where only the values ...
We present a new research domain in Operational Research, probabilistic combinatorial optimization p...
This disertation presents optimization algorithm with probability direction vector. This algorithm, ...
This article explains the single-search-based heuristics for multiobjective optimization. The most p...
This paper introduces a new metaheuristic, Single Seekers Society (SSS) algorithm, for solving uncon...
This paper introduces the Backtracking Search Optimization Algorithm (BSA), a new evolutionary algor...
This paper proposes an enhanced arithmetic optimization algorithm (AOA) called PSAOA that incorporat...
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...
Solution of real world problems have to deal with some uncertainties. This is particularly true for ...
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...
In this paper, an approach to deal with the multi-objective programming problem is regulated by mean...
Many methods are available for finding x*E Rn which minimizes the real value function f(x), some of ...
In this paper we present a direct method for the numerical solution of the constrained optimal contr...
In this paper we present a direct method for the numerical solution of the constrained optimal contr...
A new heuristic method is presented for solving a class of constrained probabilistic optimization pr...
An approach to non-convex multi-objective optimization problems is considered where only the values ...
We present a new research domain in Operational Research, probabilistic combinatorial optimization p...
This disertation presents optimization algorithm with probability direction vector. This algorithm, ...
This article explains the single-search-based heuristics for multiobjective optimization. The most p...
This paper introduces a new metaheuristic, Single Seekers Society (SSS) algorithm, for solving uncon...
This paper introduces the Backtracking Search Optimization Algorithm (BSA), a new evolutionary algor...
This paper proposes an enhanced arithmetic optimization algorithm (AOA) called PSAOA that incorporat...
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...
Solution of real world problems have to deal with some uncertainties. This is particularly true for ...
A new stochastic algorithm called Probabilistic Global Search Johor (PGSJ) has recently been establi...