Search results for "Optimization"
showing 10 items of 2824 documents
An evolutionary method for complex-process optimization
2010
10 páginas, 7 figuras, 7 tablas
Black box scatter search for general classes of binary optimization problems
2010
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represented as binary vectors and that may or may not include constraints. Binary problems arise in a variety of settings, including engineering design and statistical mechanics (e.g., the spin glass problem). A distinction is made between two sets of general constraint types that are handled directly by the solver and other constraints that are addressed via penalty functions. In both cases, however, the heuristic treats the objective function evaluation as a black box. We perform computational experiments with four well-k…
SSPMO: A Scatter Tabu Search Procedure for Non-Linear Multiobjective Optimization
2007
We describe the development and testing of a metaheuristic procedure, based on the scatter-search methodology, for the problem of approximating the efficient frontier of nonlinear multiobjective optimization problems with continuous variables. Recent applications of scatter search have shown its merit as a global optimization technique for single-objective problems. However, the application of scatter search to multiobjective optimization problems has not been fully explored in the literature. We test the proposed procedure on a suite of problems that have been used extensively in multiobjective optimization. Additional tests are performed on instances that are an extension of those consid…
Memetic Algorithms in Continuous Optimization
2012
Intuitively, a set is considered to be discrete if it is composed of isolated elements, whereas it is considered to be continuous if it is composed of infinite and contiguous elements and does not contain “holes”.
Disturbed Exploitation compact Differential Evolution for Limited Memory Optimization Problems
2011
This paper proposes a novel and unconventional Memetic Computing approach for solving continuous optimization problems characterized by memory limitations. The proposed algorithm, unlike employing an explorative evolutionary framework and a set of local search algorithms, employs multiple exploitative search within the main framework and performs a multiple step global search by means of a randomized perturbation of the virtual population corresponding to a periodical randomization of the search for the exploitative operators. The proposed Memetic Computing approach is based on a populationless (compact) evolutionary framework which, instead of processing a population of solutions, handles …
Income distribution dynamics: monotone Markov chains make light work
1995
This paper considers some aspects of the dynamics of income distributions by employing a simple Markov chain model of income mobility. The main motivation of the paper is to introduce the techniques of “monotone” Markov chains to this field. The transition matrix of a discrete Markov chain is called monotone if each row stochastically dominates the row above it. It will be shown that by embedding the dynamics of the income distribution in a monotone Markov chain, a number of interesting results may be obtained in a straightforward and intuitive fashion.
A novel strategy for solving the stochastic point location problem using a hierarchical searching scheme
2014
Stochastic point location (SPL) deals with the problem of a learning mechanism (LM) determining the optimal point on the line when the only input it receives are stochastic signals about the direction in which it should move. One can differentiate the SPL from the traditional class of optimization problems by the fact that the former considers the case where the directional information, for example, as inferred from an Oracle (which possibly computes the derivatives), suffices to achieve the optimization-without actually explicitly computing any derivatives. The SPL can be described in terms of a LM (algorithm) attempting to locate a point on a line. The LM interacts with a random environme…
Representation of Strongly Stationary Stochastic Processes
1993
A generalization of the orthogonality conditions for a stochastic process to represent strongly stationary processes up to a fixed order is presented. The particular case of non-normal delta correlated processes, and the probabilistic characterization of linear systems subjected to strongly stationary stochastic processes are also discussed.
A Parametric Dirichlet Problem for Systems of Quasilinear Elliptic Equations With Gradient Dependence
2016
The aim of this article is to study the Dirichlet boundary value problem for systems of equations involving the (pi, qi) -Laplacian operators and parameters μi≥0 (i = 1,2) in the principal part. Another main point is that the nonlinearities in the reaction terms are allowed to depend on both the solution and its gradient. We prove results ensuring existence, uniqueness, and asymptotic behavior with respect to the parameters.
Review of potential and actual penetration of solar power in Vietnam
2020
With the average solar radiation reaching up to 5 kWh/m2, Vietnam is considered as a country showing an excellent potential for solar power production. Since the year 2000, there have been a lot of studies about the potential of this source in Vietnam. So far, many applications of solar power have been implemented on small, medium, and large scales. In fact, the total capacity of current grid-connected solar power plants has exceeded the planned capacity by 2020 nearly 6 times. However, the studies of solar potential in Vietnam are still incomplete. The policies and mechanisms for developing solar power projects have received attention from the authorities but have not been really satisfact…