In this paper a comparison of the most recent algorithms for Multiobjective Optimization is realized. For this comparison are used the followings algorithms: Strength Pareto Evolutionary Algorithm (SPEA), Pareto Archived Evolution Strategy (PAES), Nondominated Sorting Genetic Algorithm (NSGA II), Adaptive Pareto Algorithm (APA). The comparison is made by using five test functions.

Reverse logistics, which is induced by various forms of used products and materials, has received growing attention throughout this decade. In a highly competitive environment, the service level is an important criterion for reverse logistics network design. However, most previous studies about product returns only focused on the total cost of the reverse logistics and neglected the service lev...

Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( ) computational complexity (where is the number of objectives and is the population size); 2) nonelitism approach; and 3) the need for specifying a sharing parameter. In this paper, we suggest a nondominated sorting-based multiobjective EA (MOEA), called nondominate...

The nondominated sorting genetic algorithm with elitism (NSGA-II) is widely used due to its good performance on solving multiobjective optimization problems. In each iteration of NSGA-II, truncation selection is performed based on the rank and crowding distance of each solution. There are, however, drawbacks in this process. These drawbacks to some extent cause overlapping solutions in the popu...

Two novel schemes of selecting the current best solutions for multiobjective differential evolution are proposed in this paper. Based on the search biases strategy suggested by Runarsson and Yao, a hybrid of multiobjective differential evolution and genetic algorithm with (N+N) framework for constrained MOPs is given. And then the hybrid algorithm adopting the two schemes respectively is compar...

Optimal design problem are widely known by their multiple performance measures that are often competing with each other. In this paper, an optimal multiproduct batch chemical plant design is presented. The design is firstly formulated as a multiobjective optimization problem, to be solved using the well suited non dominating sorting genetic algorithm (NSGA-II). The NSGA-II have capability to ac...

Multiobjective Pareto optimal solutions for epoxy semi-batch polymerization process are obtained by adapting nondominated sorting genetic algorithm II (NSGA II). The objective is to produce polymer of maximum possible number average molecular weight (Mn) with a specified value of polydispersity index (PDI) and number average molecular weight in minimum possible time. The M and reaction time a p...

Solving multiobjective engineering problems is a very difficult task due to, in general, in these class of problems, the objectives conflict across a high-dimensional problem space. In these problems, there is no single optimal solution, the interaction of multiple objectives gives rise to a set of efficient solutions, known as the Pareto-optimal solutions. During the past decade, Genetic Algor...

Multiobjective evolutionary algorithm based on decomposition (MOEA/D) and an improved non-dominating sorting multiobjective genetic algorithm (NSGA-II) are two well known multiobjective evolutionary algorithms (MOEAs) in the field of evolutionary computation. This paper mainly reviews their hybrid versions and some other algorithms which are developed for solving multiobjective optimization pro...

A novel multiobjective optimisation accelerator is introduced that uses direct manipulation in objective space together with neural network mappings from objective space to decision space. This operator is a portable component that can be hybridized with any multiobjective optimisation algorithm. The purpose of this Convergence Acceleration Operator (CAO) is to enhance the search capability and...