Packing problems with fixed number of bins

• Grant number: 20/13162-2
• Support Opportunities: Scholarships in Brazil - Doctorate
• Start date: June 01, 2021
• End date: February 29, 2024
• Field of knowledge: Physical Sciences and Mathematics - Computer Science - Theory of Computation
• Principal Investigator: Rafael Crivellari Saliba Schouery
• Grantee: Mauro Roberto Costa da Silva
• Host Institution: Instituto de Computação (IC). Universidade Estadual de Campinas (UNICAMP). Campinas , SP, Brazil
• Associated research grant: 15/11937-9 - Investigation of hard problems from the algorithmic and structural stand points, AP.TEM

Abstract

Packing problems have several practical applications, mainly in the logistics of the industries and services sectors. Logistics is responsible for a considerable part of the cost of services and products, and optimization in these processes can reduce costs and make products cheaper and more competitive. Packing problems with a fixed number of bins consist of, given a set I of items and a number N of bins with capacity W, add a subset I' of I into the bins, maximizing or minimizing an objective function, such as as the sum of the values of the packaged items. This project's main objective is to develop new approximation algorithms for the MAXSPACE, MINSPACE, and Extensible Bin Packing problems, which are packing problems with a fixed number of bins, considering variants found in practice for this class of problems. We also want to approach them for exact and heuristic algorithms, according to the project's time availability. (AU)