Leonardo Bezerra: Multi-objective ant colony optimization (MOACO) algorithms have shown promising results for various multi-objective problems, but they also offer a large number of possible design choices. Often, exploring all possible configurations is practically infeasible. Recently, the automatic configuration of a MOACO framework was explored and was shown to result in new state-of-the-art MOACO algorithms for the bi-objective traveling salesman problem. In this video Leonardo talks about this approach to the bi-objective bidimensional knapsack problem (bBKP) to prove its generality and power.

http://bit.ly/12aDpP6