This paper presents ParadisEO-MOEO, a white-box objectoriented generic framework dedicated to the flexible design of evolutionary multi-objective algorithms. This paradigm-free software embeds some features and techniques for Pareto-based resolution and aims to provide a set of classes allowing to ease and speed up the development of computationally efficient programs. It is based on a clear co...

Abstract—This paper presents an application of Multi-objective optimization and evolutive algorithms in a ZigBee network to determine the optimal routing tree for transmission. In this research the interference among nearby networks and the number of hops were taken as objective functions. The multi-objetive evolutionary algorithm SPEA (Strength Pareto Evolutionary Algorithm is used for optimiz...

Epidemiological studies have proposed an association between group A streptococci (GAS) bearing a particular M serological type and pathologic conditions such as streptococcal toxic shock syndrome (STSS). M1 and M3 GAS are isolated from STSS cases more frequently, whereas M4 and M12 GAS are isolated from non-STSS cases more frequently. To investigate whether there is any difference contributing...

The project scheduling and resource allocation problems have been studied using different optimization methods. The resource leveling problem was proposed to reduce the resource fluctuation and was always studied independently resource constraint problem. For example, resource-constrained project scheduling problem (RCPSP) was proposed to optimize scheduling under resource constraints. This res...

The paper describes further developments of the interactive evolutionary design concept relating to the emergence of mutually inclusive regions of high performance design solutions. These solutions are generated from cluster-oriented genetic algorithm (COGAs) output and relate to a number of objectives introduced during the preliminary design of military airframes. The datamining of multi-objec...

Pareto Local Search (PLS) is a generalization of the local search algorithms to handle more than one objective. In this paper, two variants of PLS are examined on the multiobjective 0/1 knapsack problems, compared with three well-known multiobjective EA algorithms, namely SPEA, SPEA2 and NSGA2. Furthermore, A Guided Local Search (GLS) based multiobjective optimization algorithm is proposed, the...

This paper deals with the design of multi-machine power system stabilizers (PSSs) and Static var compensator (SVC) using Modified shuffled frog leaping algorithm (MSFLA). The effectiveness of the proposed scheme for optimal setting of the PSSs and SVC controllers has been attended. The PSSs and SVC controllers designing is converted to an optimization problem in which the speed deviations betwe...

Many real-world problems show both multiobjective as well as dynamic characteristics. In order to use multiobjective evolutionary optimization algorithms (MOEA) efficiently, a systematic analysis of the behavior of these algorithms in dynamic environments is necessary. Dynamic fitness functions can be classified into problems with moving Pareto fronts and Pareto sets having varying speed, shape...

Previous research has shown that sub-population genetic algorithm is effective in solving the multiobjective combinatorial problems. Based on these pioneering efforts, this paper extends the SPGA algorithm with a global Pareto archive technique and a two-stage approach to solve the multi-objective problems. In the first stage, the areas next to the two single objectives are searched and solutio...