Abstract. Multi-objective evolutionary algorithms which use non-dominated sorting and sharing have been mainly criticized for their (i) computational complexity (where is the number of objectives and is the population size), (ii) non-elitism approach, and (iii) the need for specifying a sharing parameter. In this paper, we suggest a non-dominated sorting based multi-objective evolutionary algor...

Among numerous multi-objective optimization algorithms, the Elitist non-dominated sorting genetic algorithm (NSGA-II) is one of the most popular methods due to its simplicity, effectiveness and minimum involvement of the user. This article develops a multi-objective variation of the Nelder-Mead simplex method and combines it with NSGA-II in order to improve the quality and spread of the solutio...

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

Railway electrification has attracted substantial interest in recent years as a key part of the global effort to achieve transport decarbonization. To improve energy efficiency train operations, particular is optimization speed trajectories. However, most studies formulate problem single-objective model and do not take into account mass uncertainty associated with passenger load variations. Thi...

Task scheduling plays an important part in the improvement of parallel and distributed systems. The problem of task scheduling has been shown to be NP hard. The time consuming is more to solve the problem in deterministic techniques. There are algorithms developed to schedule tasks for distributed environment, which focus on single objective. The problem becomes more complex, while considering ...

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

In Multi-objective Optimization the goal is to present a set of Pareto-optimal solutions to the decision maker (DM). One out of these solutions is then chosen according to the DM preferences. Given that the DM has some general idea of what type of solution is preferred, a more efficient optimization could be run. This can be accomplished by letting the optimization algorithm make use of this pr...

Robotic systems, whether physical or virtual, must balance multiple objectives to operate effectively. Beyond performance metrics such as speed and turning radius, efficiency of movement, stability, and other objectives contribute to the overall functionality of a system. Optimizing multiple objectives requires algorithms that explore and balance improvements in each. In this paper, we evaluate...

Optimizing the operation of reservoir involving ecological and environmental (eco-environmental) objectives is challenging due to the often competing social-economic objectives. Non-dominated Sorting Genetic Algorithm-II is a popular method for solving multi-objective optimization problems. However, within a complex search space, the NSGA-II population (i.e., a group of candidate solutions) may...