A heuristic for the 3D multi size bin packing problem for the storage local assignment problem in e-commerce warehouses

• Grant number: 24/15244-7
• Support Opportunities: Scholarships in Brazil - Scientific Initiation
• Start date: October 01, 2024
• End date: June 30, 2025
• Field of knowledge: Engineering - Production Engineering - Operational Research
• Principal Investigator: Mariá Cristina Vasconcelos Nascimento Rosset
• Grantee: Ângelo de Carvalho Nunes
• Host Institution: Divisão de Ciência da Computação (IEC). Instituto Tecnológico de Aeronáutica (ITA). Ministério da Defesa (Brasil). São José dos Campos , SP, Brazil
• Associated research grant: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry, AP.CEPID

Abstract

The Storage Location Assignment Problem (SLAP) is a challenge in e-commerce warehouse management, aimed at optimizing item placement to enhance operational efficiency. The growing demand for online shopping has resulted in a significant increase in the number of items that need to be stored and quickly retrieved, making the SLAP even more critical. Efficiently locating items can reduce search and retrieval times, lower operational costs, and improve customer satisfaction. However, due to the vast number of items and the complexity involved in organizing a warehouse, exact solution methods are impractical, making the application of heuristics essential for its study. Heuristics provide feasible and fast solutions, enabling efficient item allocation even in complex and dynamic scenarios. In this project, the candidate will develop a heuristic for SLAP, leveraging an already well-defined mathematical model, to seek high-quality solutions for this problem in a practical context.