jMetal: A Java framework for multi-objective optimization
Advances in Engineering Software
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
A highly interesting but not thoroughly addressed optimization problem is a variation of the Assignment Problem (AP) where tasks are assigned to groups of collaborating agents (teams). In this paper, we address this class of AP as a bi-objective optimization problem, in which the cost is minimized and the quality is maximized. To solve the model, we adopt Non-dominated Sorting Genetic Algorithm-II (NSGA-II) and Strength Pareto Evolutionary Algorithm 2 (SPEA2). We conduct several experiments on problems with varying sizes to compare the NSGA-II and SPEA2 algorithms.