On One Optimization Problem for Warehouse Goods Placement | Sciact - Система учета научной деятельности ИМ СО РАН

On One Optimization Problem for Warehouse Goods Placement Научная публикация

Журнал

Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797

Вых. Данные

Год: 2025, Том: 19, Номер: 1, Страницы: 77-91 Страниц : 15 DOI: 10.1134/S1990478925010089

Ключевые слова

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

Авторы

Motorin K.O. ¹ , Pyatkin A.V. ²

Организации

1	Novosibirsk State University, Novosibirsk, 630090 Russia
2	Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090 Russia

Информация о финансировании (1)

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0019

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.

Motorin K.O. , Pyatkin A.V.
On One Optimization Problem for Warehouse Goods Placement
Journal of Applied and Industrial Mathematics. 2025. V.19. N1. P.77-91. DOI: 10.1134/S1990478925010089 Scopus РИНЦ OpenAlex

Моторин К.О. , Пяткин А.В.
Об одной задаче оптимизации размещения товаров на складе
Дискретный анализ и исследование операций. 2025. Т.32. №1. С.75–98. DOI: 10.33048/daio.2025.32.806 РИНЦ

Scopus:	2-s2.0-105020665907
РИНЦ:	83155453
OpenAlex:	W4415775058

Пока нет цитирований