An Evolutionary Algorithm for solving the Two-Dimensional Irregular Shape Packing Problem combined with the Knapsack Problem

Abstract

This work presents an evolutionary algorithm to solve a joint problem of the Packing Problem and the Knapsack Problem, where the objective is to place items (with shape, value and weight) in a container (defined by its shape and capacity), maximizing the container's value, without intersections