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...

A multi-objective optimization problem (MOP) is often found in real-world optimization problem. Among various multiobjective optimization techniques, multi-objective evolutionary algorithm (MOEA) is highlighted as a good candidate due to its flexibility, feasibility, and its ability to handle multiple solutions. Among various MOEAs, we analyze 2MOEA which can achieve good convergence and divers...

Several problems in the area of financial optimization can be naturally dealt with optimization techniques under multiobjective approaches, followed by a decision-making procedure on the resulting efficient solutions. The problem of portfolio optimization is one of them. This chapter studies the use of evolutionary multiobjective techniques to solve such problems, focusing on Venezuelan market ...

We apply the NSGA-II algorithm and its controlled elitist version NSGA-IIc for the intensity modulated beam radiotherapy dose optimization problem. We compare the performance of the algorithms with objectives for which deterministic optimization methods provide global optimal solutions. The number of parameters to be optimized can be up to a few thousands and the number of objectives varies fro...

A multiobjective optimization problem which focuses on parallel machines scheduling is considered. This problem consists of scheduling n independent jobs onm identical parallel machines with release dates, due dates, and sequence-dependent setup times. The preemption of jobs is forbidden. The aim is to minimize two different objectives: makespan and total tardiness. The contribution of this pap...

A method for computing minimum cost trajectory planning for industrial robot manipulators is presented. The objective function minimizes the cost function with the constraints being joint positions, velocities, jerks and torques by considering dynamic equations of motion. A clamped cubic spline is used to represent the trajectory. This is a non-linear constrained optimization problem. The probl...

Classical evolutionary multi-objective optimization algorithms aim at finding an approximation of the entire set of Pareto optimal solutions. By considering the preferences of a decision maker within evolutionary multi-objective optimization algorithms, it is possible to focus the search only on those parts of the Pareto front that satisfy his/her preferences. In this paper, an extended prefere...

An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...

In this paper, we have studied a multiobjective hybrid flowshop scheduling problem where n independent jobs should be executed in a hybrid assembly line. The aim of our work is to optimize the makespan and the total tardiness of the whole production. A simulation based optimization algorithm is proposed here to solve this problem. It is a combination of the simulation software ARENA and the FLC...

In wireless sensor networks (WSNs), prototyping systems facilitate the realization of real node deployment, enabling to test new algorithms, proto‐ cols, and networking solutions. This paper investigates the 3D indoor redeploy‐ ment problem in WSNs by finding the positions where nodes should be added in order to improve an initial deployment while optimizing different objectives. For this purpo...