Automatic Generation of Multi-Objective ACO Algorithms for the Biobjective Knapsack


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 paper, we apply this approach to the bi-objective bidimensional knapsack problem (bBKP) to prove its generality and power. As a first step, we tune and improve the performance of four MOACO algorithms that have been earlier proposed for the bBKP. In a second step, we configure the full MOACO framework and show that the automatically configured MOACO framework outperforms all previous MOACO algorithms for the bBKP as well as their improved variants.

(link: IridiaTr2012-013)

Université Libre de Bruxelles



Posted in TEWI-Kolloquium | Leave a comment

Schreibe einen Kommentar