On One Optimization Problem for Warehouse Goods Placement Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2025, Volume: 19, Number: 1, Pages: 77-91 Pages count : 15 DOI: 10.1134/S1990478925010089 | ||||
| Tags | warehouse optimization, goods placement, NP-hard problem, genetic algorithm, tabu search | ||||
| Authors |
|
||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0019 |
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.
Cite:
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
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
Original:
Моторин К.О.
, Пяткин А.В.
Об одной задаче оптимизации размещения товаров на складе
Дискретный анализ и исследование операций. 2025. Т.32. №1. С.75–98. DOI: 10.33048/daio.2025.32.806 РИНЦ
Об одной задаче оптимизации размещения товаров на складе
Дискретный анализ и исследование операций. 2025. Т.32. №1. С.75–98. DOI: 10.33048/daio.2025.32.806 РИНЦ
Identifiers:
| Scopus: | 2-s2.0-105020665907 |
| Elibrary: | 83155453 |
| OpenAlex: | W4415775058 |
Citing:
Пока нет цитирований