1,600 research outputs found
Elitism and Stochastic Dominance
Stochastic dominance has been typically used with a special emphasis on risk and in-equality reduction something captured by the concavity of the utility function in the expected utility model. We claim that the applicability of the stochastic dominance ap-proach goes far beyond risk and inequality measurement provided suitable adaptations be made. We apply in the paper the stochastic dominance approach to the measurement of elitism which may be considered the opposite of egalitarianism. While the usual stochastic dominance quasi-orderings attach more value to more equal and more effi-cient distributions, our criteria ensure that, the more unequal and the more efficient the distribution, the higher it is ranked. Two instances are provided by (i) comparisons of scientific performance across institutions like universities or departments, and (ii) com-parisons of affluence as opposed to poverty between countries.Decumulative Distribution Functions, Stochastic Dominance, Regressive Transfers, Elitism, Scientific Performance, Affluence
Elitism and Stochastic Dominance
Stochastic dominance has typically been used with a special emphasis on risk and inequality reduction something captured by the concavity of the utility function in the expected utility model. We claim that the applicability of the stochastic dominance approach goes far beyond risk and inequality measurement provided suitable adpations be made. We apply in the paper the stochastic dominance approach to the measurment of elitism which may be considered the opposite of egalitarianism. While the usual stochastic dominance quasi-orderings attach more value to more equal and more efficient distributions, our criteria ensure that the more unequal and the more the efficient the distribution, the higher it is ranked. two instances are provided by (i) comparisons of scientific performance across institutions like universities or departments and (ii) comparisons of affluence as opposed to poverty across countries.Decumulative distribution functions; Stochastic dominance; Regressive transfers; Elitism; Scientific Performance; Affluence
Genetic algorithms with memory- and elitism-based immigrants in dynamic environments
Copyright @ 2008 by the Massachusetts Institute of TechnologyIn recent years the genetic algorithm community has shown a growing interest in studying dynamic optimization problems. Several approaches have been devised. The random immigrants and memory schemes are two major ones. The random immigrants scheme addresses dynamic environments by maintaining the population diversity while the memory scheme aims to adapt genetic algorithms quickly to new environments by reusing historical information. This paper investigates a hybrid memory and random immigrants scheme, called memory-based immigrants, and a hybrid elitism and random immigrants scheme, called elitism-based immigrants, for genetic algorithms in dynamic environments. In these schemes, the best individual from memory or the elite from the previous generation is retrieved as the base to create immigrants into the population by mutation. This way, not only can diversity be maintained but it is done more efficiently to adapt genetic algorithms to the current environment. Based on a series of systematically constructed dynamic problems, experiments are carried out to compare genetic algorithms with the memory-based and elitism-based immigrants schemes against genetic algorithms with traditional memory and random immigrants schemes and a hybrid memory and multi-population scheme. The sensitivity analysis regarding some key parameters is also carried out. Experimental results show that the memory-based and elitism-based immigrants schemes efficiently improve the performance of genetic algorithms in dynamic environments.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom under Grant EP/E060722/01
Evolutionary computation in dynamic and uncertain environments
This book can be accessed from the link below - Copyright @ 2007 Springer-Verla
Multiobjective synchronization of coupled systems
Copyright @ 2011 American Institute of PhysicsSynchronization of coupled chaotic systems has been a subject of great interest and importance, in theory but also various fields of application, such as secure communication and neuroscience. Recently, based on stability theory, synchronization of coupled chaotic systems by designing appropriate coupling has been widely investigated. However, almost all the available results have been focusing on ensuring the synchronization of coupled chaotic systems with as small coupling strengths as possible. In this contribution, we study multiobjective synchronization of coupled chaotic systems by considering two objectives in parallel, i. e., minimizing optimization of coupling strength and convergence speed. The coupling form and coupling strength are optimized by an improved multiobjective evolutionary approach. The constraints on the coupling form are also investigated by formulating the problem into a multiobjective constraint problem. We find that the proposed evolutionary method can outperform conventional adaptive strategy in several respects. The results presented in this paper can be extended into nonlinear time-series analysis, synchronization of complex networks and have various applications
Modified constrained differential evolution for solving nonlinear global optimization problems
Nonlinear optimization problems introduce the possibility of
multiple local optima. The task of global optimization is to find a point
where the objective function obtains its most extreme value while satisfying
the constraints. Some methods try to make the solution feasible
by using penalty function methods, but the performance is not always
satisfactory since the selection of the penalty parameters for the problem
at hand is not a straightforward issue. Differential evolution has
shown to be very efficient when solving global optimization problems
with simple bounds. In this paper, we propose a modified constrained
differential evolution based on different constraints handling techniques,
namely, feasibility and dominance rules, stochastic ranking and global
competitive ranking and compare their performances on a benchmark
set of problems. A comparison with other solution methods available in
literature is also provided. The convergence behavior of the algorithm to
handle discrete and integer variables is analyzed using four well-known
mixed-integer engineering design problems. It is shown that our method
is rather effective when solving nonlinear optimization problems.Fundação para a Ciência e a Tecnologia (FCT
A Unified Model for Evolutionary Multiobjective Optimization and its Implementation in a General Purpose Software Framework: ParadisEO-MOEO
This paper gives a concise overview of evolutionary algorithms for
multiobjective optimization. A substantial number of evolutionary computation
methods for multiobjective problem solving has been proposed so far, and an
attempt of unifying existing approaches is here presented. Based on a
fine-grained decomposition and following the main issues of fitness assignment,
diversity preservation and elitism, a conceptual global model is proposed and
is validated by regarding a number of state-of-the-art algorithms as simple
variants of the same structure. The presented model is then incorporated into a
general-purpose software framework dedicated to the design and the
implementation of evolutionary multiobjective optimization techniques:
ParadisEO-MOEO. This package has proven its validity and flexibility by
enabling the resolution of many real-world and hard multiobjective optimization
problems
A multi-objective genetic algorithm for the design of pressure swing adsorption
Pressure Swing Adsorption (PSA) is a cyclic separation process, more advantageous over other separation options for middle scale processes. Automated tools for the design of PSA
processes would be beneficial for the development of the technology, but their development is
a difficult task due to the complexity of the simulation of PSA cycles and the computational
effort needed to detect the performance at cyclic steady state.
We present a preliminary investigation of the performance of a custom multi-objective genetic
algorithm (MOGA) for the optimisation of a fast cycle PSA operation, the separation of
air for N2 production. The simulation requires a detailed diffusion model, which involves coupled
nonlinear partial differential and algebraic equations (PDAEs). The efficiency of MOGA
to handle this complex problem has been assessed by comparison with direct search methods.
An analysis of the effect of MOGA parameters on the performance is also presented
Genetic algorithms with immigrants and memory schemes for dynamic shortest path routing problems in mobile ad hoc networks
This article is posted here with permission of IEEE - Copyright @ 2010 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.This work was supported by the Engineering
and Physical Sciences Research Council of U.K. underGrant EP/E060722/
- …