Work

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses

Year: 2024

Type: article

Abstract: We consider an optimization problem arising when a set of items must be selected and picked up from given locations in an automated storage and retrieval system by a crane of given capacity, minimizing the overall distance traveled. The problem has been classified as open in a recent taxonomy of optimal picking problems in automated warehouses. In this paper, we analyze some non-trivial properties of the problem and we describe a polynomial-time dynamic programming algorithm to solve it to proven optimality.

Source: Journal of Scheduling

DOI: 10.1007/s10951-024-00811-2

Authors: Michele Barbato, Alberto Ceselli, Giovanni Righini

Institution: University of Milan

Language: English

Topic: Advanced Manufacturing and Logistics Optimization

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: hybrid

Estimated APC paid: $2,890