In this paper, we introduce a new iterative algorithm for approximating a common solution of certain class of multiple-sets split variational inequality problems. The sequence of the proposed iterative algorithm is proved to converge strongly in Hilbert spaces. As application, we obtain some strong convergence results for some classes of multiple-sets split convex minimization problems.

In the present work, by applying known Bernstein polynomials and their advantageous properties, we establish an efficient iterative algorithm to approximate the numerical solution of fuzzy Fredholm integral equations of the second kind. The convergence of the proposed method is given and the numerical examples illustrate that the proposed iterative algorithm are ‎valid.‎

in this paper a new algorithm is presented for coherent radar detection of targets, when distribution of the interference (clutter and noise) is non-gaussian. the neyman-pearson criterion is used for optimal detection and several successive received samples from a radar range cell are used for detection in the same cell. on the basis of recent empirical evidences, the interference distribution ...

this paper proposes an efficient algorithm based on memetic algorithm (ma) for a redundancy allocation problem without component mixing (rapcm) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. majority of the solution methods for the general rapcm assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...

Environmental pollution and emissions, along with the increasing production and distribution of goods, have placed the future of humanity at stake. Today, measures such as the extensive reduction in emissions, especially of CO2 and CO, have been emphasized by most researchers as a solution to the problem of environmental protection. This paper sought to explore production routing pro...

This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...

  We relax some assumptions of the traditional scheduling problem and suggest an adapted meta-heuristic algorithm to optimize efficient utilization of resources and quick response to demands simultaneously. We intend to bridge the existing gap between theory and real industrial scheduling assumptions (e.g., hot metal rolling industry, chemical and pharmaceutical industries). We adapt and evalua...

schema matching is a critical step in many applications, such as data warehouse loading, online analytical process (olap), data mining, semantic web [2] and schema integration. this task is defined for finding the semantic correspondences between elements of two schemas. recently, schema matching has found considerable interest in both research and practice. in this paper, we present a new impr...

in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solut...