Improved sampling of the pareto-front in multiobjective genetic optimizations by steady-state evolution: a Pareto converging genetic algorithm

Previous work on multiobjective genetic algorithms has been focused on preventing genetic drift and the issue of convergence has been given little attention. In this paper, we present a simple steady-state strategy, Pareto Converging Genetic Algorithm (PCGA), which naturally samples the solution space and ensures population advancement towards the Pareto-front. PCGA eliminates the need for sharing/niching and thus minimizes heuristically chosen parameters and procedures. A systematic approach based on histograms of rank is introduced for assessing convergence to the Pareto-front, which, by definition, is unknown in most real search problems. We argue that there is always a certain inheritance of genetic material belonging to a population, and there is unlikely to be any significant gain beyond some point; a stopping criterion where terminating the computation is suggested. For further encouraging diversity and competition, a nonmigrating island model may optionally be used; this approach is particularly suited to many difficult (real-world) problems, which have a tendency to get stuck at (unknown) local minima. Results on three benchmark problems are presented and compared with those of earlier approaches. PCGA is found to produce diverse sampling of the Pareto-front without niching and with significantly less computational effort

Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout

This paper describes a hybrid Genetic Algorithm (GA) that is used to improve the layout of a graph according to a number of aesthetic criteria. The GA incorporates spatial and topological information by operating directly with a graph based representation. Initial results show this to be a promising technique for positioning graph nodes on a surface and may form the basis of a more general approach for problems involving multi-criteria spatial optimisation

Precise Characterization and Multiobjective Optimization of Low Noise Amplifiers

Although practically all function blocks of the satellite navigation receivers are realized using the CMOS digital integrated circuits, it is appropriate to create a separate low noise antenna preamplifier based on a low noise pHEMT. Such an RF front end can be strongly optimized to attain a suitable tradeoff between the noise figure and transducer power gain. Further, as all the four principal navigation systems (GPS, GLONASS, Galileo, and COMPASS) work in similar frequency bands (roughly from 1.1 to 1.7 GHz), it is reasonable to create the low noise preamplifier for all of them. In the paper, a sophisticated method of the amplifier design is suggested based on multiobjective optimization. A substantial improvement of a standard optimization method is also outlined to satisfy a uniform coverage of Pareto front. Moreover, for enhancing efficiency of many times repeated solutions of large linear systems during the optimization, a new modification of the Markowitz criterion is suggested compatible with fast modes of the LU factorization. Extraordinary attention was also given to the accuracy of modeling. First, an extraction of pHEMT model parameters was performed including its noise part, and several models were compared. The extraction was carried out by an original identification procedure based on a combination of metaheuristic and direct methods. Second, the equations of the passive elements (including transmission lines and T-splitters) were carefully defined using frequency dispersion of their parameters as Q, ESR, etc. Third, an optimal selection of the operating point and essential passive elements was performed using the improved optimization method. Finally, the s-parameters and noise figure of the amplifier were measured, and stability and third-order intermodulation products were also checked

Bibliometric Mapping of the Computational Intelligence Field

In this paper, a bibliometric study of the computational intelligence field is presented. Bibliometric maps showing the associations between the main concepts in the field are provided for the periods 1996–2000 and 2001–2005. Both the current structure of the field and the evolution of the field over the last decade are analyzed. In addition, a number of emerging areas in the field are identified. It turns out that computational intelligence can best be seen as a field that is structured around four important types of problems, namely control problems, classification problems, regression problems, and optimization problems. Within the computational intelligence field, the neural networks and fuzzy systems subfields are fairly intertwined, whereas the evolutionary computation subfield has a relatively independent position.neural networks;bibliometric mapping;fuzzy systems;bibliometrics;computational intelligence;evolutionary computation