Multi-Objective Robotic Assembly Line Balancing Problem: A NSGA-II Approach Using Multi-Objective Shortest Path Decoders

Given a reference protein and its corresponding tertiary (3D) structure, this work is concerned with finding 1) the most diverse nucleotide sequences which 2) produce very similar

Our ex- periments indicate that our proposed solution, CCSMPSO, offers significant computational speedups, a higher convergence speed and better and comparable results in terms

We address the problem of derivative-free multi-objective optimization of real-valued functions subject to multiple inequality constraints.. The search domain X is assumed to

In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed.. In this method, the optimization/exploration algorithm

Comparison between performances obtained using several approaches issued from the literature ( ); our best result (o) and our worst result (+) for 5 runs on the chromosome-shaped

The computation times and the quality of the solution in terms of the smoothness of the control signals and precision of tracking show that MOPSO can be an alternative for real

First, we propose to augment the single-objective local search that solves the scalarisations with an archive of nondominated solutions, such that they are able to return more than

We do not claim to provide a unique best solution of the problem, but we study the trade-off between the energy spent by the sensor nodes in data collection, and the delay induced by