The maximum diversity assortment selection problem

Abstract In this article, we introduce the Maximum Diversity Assortment Selection Problem (MDASP), which is a generalization of two-dimensional Knapsack (2D-KP). Given set rectangles and rectangular container, goal 2D-KP to determine subset that can be placed in container without overlapping, i.e., feasible assortment, such maximum area covered. MDASP assortments, each them covering certain minimum threshold diversity among maximized. Thereby, defined as or average normalized Hamming distance all assortment pairs. was topic 11th AIMMS-MOPTA Competition 2019. The methods described article resulting computational results won contest. following, give definition problem, mathematical model solution approaches, upper bounds on diversity, conclude with experiments conducted test instances derived from literature.