EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1301. Scheduling of Retrieval Operations in an Automatic Warehouse: Models and Algorithms (Preliminary Exploration)

Invited abstract in session TA-58: Warehouse Operations, stream VeRoLog - Vehicle Routing and Logistics.

Tuesday, 8:30-10:00
Room: S07 (building: 101)

Authors (first author is the speaker)

1. Runjie Li
Hong Kong University of Science and Technology
2. XIANGTONG QI
HKUST

Abstract

The automatic warehouse discussed in this article is based on a puzzle-based storage (PBS) system with block movement, which allows multiple items in a line to move simultaneously, and simultaneous movement, which allows multiple movements to occur at the same time. PBS is one of the most space-efficient types of storage systems, and the way of block and simultaneous movement makes it more time-efficient. However, retrieving multiple target items from this kind of automatic warehouse has not yet been rigorously studied. In this paper, we present a time-expanded based on mixed integral linear programming (MILP) formulation that aims to minimize the summation time of retrieving multiple target loads. Another objective of minimizing the makespan can also be minimized to serve the objective of summation retrieving time. In addition, constructive algorithms are developed for fast obtaining retrieving plan for multiple target items based on the shortest unimpeded retrieval for some special cases. Experiments show that the proposed formulation can solve small to medium size instances, especially when the storage density is not extremely high. We also conducted experiments to explore the efficiency of the proposed automatic warehouse and demonstrate the utility rate of empty locations.

Keywords

Status: accepted

Back to the list of papers