UnipiEprints
Università di Pisa
Sistema bibliotecario di ateneo

Sequencing and Routing in a Large Warehouse with High Degree of Product Rotation

Giacomo, Lanza and Mauro, Passacantando and Maria Grazia, Scutellà (2021) Sequencing and Routing in a Large Warehouse with High Degree of Product Rotation. Technical Report del Dipartimento di Informatica, TR . University of Pisa, Pisa. (Submitted)

[img] PDF
Available under License Creative Commons Attribution No Derivatives.

Download (893kB)

Abstract

The paper deals with a sequencing and routing problem originated by a real-world application context. The problem consists in defining the best sequence of locations to visit within a warehouse for the storage and/or retrieval of a given set of items during a specified time horizon, where the storage/retrieval location of an item is given. Picking and put away of items are simultaneously addressed, by also considering some specific requirements given by the layout design and operating policies which are typical in the kind of warehouses under study. Specifically, the considered sequencing policy prescribes that storage locations must be replenished or emptied one at a time by following a specified order of precedence. Moreover, two fleet of vehicles are used to perform retrieving and storing operations, whose routing is restricted to disjoint areas of the warehouse. We model the problem as a constrained multicommodity flow problem on a space-time network, and we propose a Mixed-Integer Linear Programming formulation, whose primary goal is to minimize the time traveled by the vehicles during the time horizon. Since large-size realistic instances are hardly solvable within the time limit commonly imposed in the considered application context, a matheuristic approach based on a time horizon decomposition is proposed. Finally, we provide an extensive experimental analysis aiming at identifying suitable parameter settings for the proposed approach, and testing the matheuristic on particularly hard realistic scenarios. The computational experiments show the efficacy and the efficiency 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: 14 Jun 2021 07:29
Last Modified: 14 Jun 2021 07:29
URI: http://eprints.adm.unipi.it/id/eprint/2399

Repository staff only actions

View Item View Item