On one optimization problem for warehouse goods placement

K. O. Motorin^a, A. V. Pyatkin<sup>b

a</sup> Novosibirsk State University, 2 Pirogov Street, 630090 Novosibirsk, Russia
^b Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia

Abstract: A warehouse goods placement problem is considered, where the aim is to minimize the total time of fulfillment of orders from a given list. NP-hardness of this problem even in the simplest special case is proved. An ILP model is suggested for this problem. Two heuristic algorithms are developed for solving this problem; their effectiveness is analyzed using randomly generated instances. Tab. 3, illustr. 9, bibliogr. 17.

Keywords: warehouse optimization, goods placement, NP-hard problem, genetic algorithm, tabu search.

UDC: 519.8

Received: 15.07.2024
Revised: 05.08.2024
Accepted: 22.09.2024

DOI: 10.33048/daio.2025.32.806

 English version: Journal of Applied and Industrial Mathematics, 2025, 19:1, 77–91