GA-based decision support system for multicriteria optimization

Proposes a multicriteria decision making (MCDM) method by using a genetic algorithm (GA). The system consists of three phases. In the first phase, a rough set of Pareto optimal solutions is obtained using Kohonen's self organizing map (SOM). In the second phase, the decision maker (DM) selects his preferred solutions among the obtained set, where the mechanism of GA is used with the DM's preference assisted by radial basis function network (RBFN). In the third phase, the DM can explore the solution space further for the final decision</p

Multiobjective optimization of electromagnetic structures based on self-organizing migration

Práce se zabývá popisem nového stochastického vícekriteriálního optimalizačního algoritmu MOSOMA (Multiobjective Self-Organizing Migrating Algorithm). Je zde ukázáno, že algoritmus je schopen řešit nejrůznější typy optimalizačních úloh (s jakýmkoli počtem kritérií, s i bez omezujících podmínek, se spojitým i diskrétním stavovým prostorem). Výsledky algoritmu jsou srovnány s dalšími běžně používanými metodami pro vícekriteriální optimalizaci na velké sadě testovacích úloh. Uvedli jsme novou techniku pro výpočet metriky rozprostření (spread) založené na hledání minimální kostry grafu (Minimum Spanning Tree) pro problémy mající více než dvě kritéria. Doporučené hodnoty pro parametry řídící běh algoritmu byly určeny na základě výsledků jejich citlivostní analýzy. Algoritmus MOSOMA je dále úspěšně použit pro řešení různých návrhových úloh z oblasti elektromagnetismu (návrh Yagi-Uda antény a dielektrických filtrů, adaptivní řízení vyzařovaného svazku v časové oblasti…).This thesis describes a novel stochastic multi-objective optimization algorithm called MOSOMA (Multi-Objective Self-Organizing Migrating Algorithm). It is shown that MOSOMA is able to solve various types of multi-objective optimization problems (with any number of objectives, unconstrained or constrained problems, with continuous or discrete decision space). The efficiency of MOSOMA is compared with other commonly used optimization techniques on a large suite of test problems. The new procedure based on finding of minimum spanning tree for computing the spread metric for problems with more than two objectives is proposed. Recommended values of parameters controlling the run of MOSOMA are derived according to their sensitivity analysis. The ability of MOSOMA to solve real-life problems from electromagnetics is shown in a few examples (Yagi-Uda and dielectric filters design, adaptive beam forming in time domain…).

Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach

This paper proposes an organized generalization of Newman and Girvan's modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure produces topologically ordered graph clusterings that lead to faithful and readable graph representations based on clustering induced graphs. Topographic graph clustering provides an alternative to more classical solutions in which a standard graph clustering method is applied to build a simpler graph that is then represented with a graph layout algorithm. A comparative study on four real world graphs ranging from 34 to 1 133 vertices shows the interest of the proposed approach with respect to classical solutions and to self-organizing maps for graphs

Kinetic Exchange Models for Income and Wealth Distributions

Increasingly, a huge amount of statistics have been gathered which clearly indicates that income and wealth distributions in various countries or societies follow a robust pattern, close to the Gibbs distribution of energy in an ideal gas in equilibrium. However, it also deviates in the low income and more significantly for the high income ranges. Application of physics models provides illuminating ideas and understanding, complementing the observations.Comment: 15 pages, 20 eps figures, EPJ class; To be published as "Colloquium" in Eur Phys J

Optimizing Associative Information Transfer within Content-addressable Memory

Original article can be found at: http://www.oldcitypublishing.com/IJUC/IJUC.htmlPeer reviewe