Assigning and sequencing storage locations under a two level storage policy: optimization model and matheuristic approach

Lanza, Giacomo and Passacantando, Mauro and Scutellà, Maria Grazia Assigning and sequencing storage locations under a two level storage policy: optimization model and matheuristic approach. Università di Pisa. (Submitted)

PDF Available under License Creative Commons Attribution No Derivatives. Download (1MB)

Abstract

We deal with a storage location problem in a warehouse where items of different product types are released by the production area and need to be stored. Capacitated storage locations have to be assigned to each product type to store the corresponding items. Items of different product types cannot share the same storage location, i.e., each storage location can be assigned to at most one product type. In addition, a suitable sequencing of the assigned storage locations must be devised for each product type. Each sequence will provide both the order with which the storage locations will be filled up during the storing operations, and also the order of visit of the storage locations during the successive order picking phase. A motivation is that, separately per product type, an order picking based on the time of permanence of the items in the warehouse has to be pursued. Moreover, the chosen sequencing influences the availability of additional storage on the top of the assigned storage locations. In fact, for each product type, an additional extra storage can be made available on top of pairs of consecutive storage locations in the sequence, which depends on the two storage locations at the ground level. The goal is to maximize the storage capacity still available after the assignment of the storage locations. After proving the NP-Hardness of the considered problem, we model it in terms of a multicommodity flow problem with additional constraints on an auxiliary graph, and we propose a Mixed-Integer Linear Programming model for its mathematical formulation. A matheuristic approach, based on the sequential resolution of multicommodity flow subproblems, is then presented. The proposed methodology is applied to a case study related to a large warehouse with a high stock rotation index in tissue logistics, which motivated our study. Computational results on a wide test bed related to such a real application context show the efficiency and efficacy of the proposed approach.

Item Type:	Book
Subjects:	Area01 - Scienze matematiche e informatiche > MAT/09 - Ricerca operativa
Divisions:	Dipartimenti (from 2013) > DIPARTIMENTO DI INFORMATICA
Depositing User:	PhD Giacomo Lanza
Date Deposited:	29 Mar 2021 13:42
Last Modified:	29 Mar 2021 13:45
URI:	http://eprints.adm.unipi.it/id/eprint/2398

Repository staff only actions

View Item