Heuristic algorithms, especially hill-climbing algorithms, are prone to being trapped by local optimization. Many researchers have focused on analyzing convergence and runtime of some heuristic algorithms on SAT-solving problems. However, there is rare work on analyzing success ratio (the ratio...

In this work, we proposed the new method for estimation of the thickness and the optical properties of the thin metal oxide film deposited on a transparent substrate. The developed method uses only transmittance spectra measured. Our method is based on the two stage optimization where the...

We examine the concept of storing all evaluated chromosomes and directly reuse them in Genetic Algorithms (GAs). This is achieved by a fully encapsulated operator, called Registrar, which is effortlessly placed between the GA and the objective function. The Registrar does not approximate the...

In this paper, we propose a new deterministic global optimization method for solving nonlinear optimal control problems in which the constraint conditions of differential equations and the performance index are expressed as polynomials of the state and control functions. The nonlinear optimal...

The concept of pseudomonotone vector field on Hadamard manifold is introduced. A variant of Korpelevich’s method for solving the variational inequality problem is extended from Euclidean spaces to constant curvature Hadamard manifolds. Under a pseudomonotone assumption on the underlying vector...

Given a graph G and positive integers B and W, the BWC problem asks about the existence of a coloring of G, with B black and W white vertices, such that there is no edge between a black and a white vertex. We suggest a heuristic, based on tabu search, which yields quite good results for this...

Before zinc electrolysis, zinc powder is added to the zinc sulphate electrolyte solution to facilitate the removal of harmful metallic ions. This purification process can be modeled by a time delay differential equation. Since some of the parameters in this model are unknown, zinc powder is...

Run time distributions or time-to-target plots are very useful tools to characterize the running times of stochastic algorithms for combinatorial optimization. We further explore run time distributions and describe a new tool to compare two algorithms based on stochastic local search. For the...

In this paper, we construct a new iterative scheme and prove strong convergence theorem for approximation of a common fixed point of a countable family of relatively nonexpansive mappings, which is also a solution to an equilibrium problem in a uniformly convex and uniformly smooth real Banach...