Can I read Analysis of Quality Diversity Algorithms for the Knapsack Problem on EtoBox?

Analysis of Quality Diversity Algorithms for the Knapsack Problem by Nikfarjam, Adel; Do, Anh Viet; Neumann, Frank is a scholarly article available to read on EtoBox.

What is Analysis of Quality Diversity Algorithms for the Knapsack Problem about?

Quality diversity (QD) algorithms have been shown to be very successful when dealing with problems in areas such as robotics, games and combinatorial optimization. They aim to maximize the quality of solutions for different regions of the so-called behavioural space of the underlying problem. In this paper, we apply the QD paradigm to simulate dynamic programming behaviours on knapsack problem, and provide a first runtime analysis of QD algorithms. We show that they are able to compute an optimal solution within expected pseudo-polynomial time, and reveal parameter settings that lead to a fully polynomial randomised approximation scheme (FPRAS). Our experimental investigations evaluate the different approaches on classical benchmark sets in terms of solutions constructed in the behavioural space as well as the runtime needed to obtain an optimal solution.

Author

Nikfarjam, Adel; Do, Anh Viet; Neumann, Frank

Published

2022

Language

EN