On one optimization problem for warehouse goods placement

MaRDI QIDQ6890427zbMATH OpenFDO

Authors Kirill Olegovich Motorin, Artem Pyatkin

Publication date 3 December 2025

Published in Diskretnyĭ Analiz i Issledovanie Operatsiĭ (Search for Journal in Brave)

zbMATH Keywords

genetic algorithmgoods placementNP-hard problemtabu searchwarehouse optimization

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• An implementation of the iterated tabu search algorithm for the quadratic assignment problem
• Assignment Problems and the Location of Economic Activities
• Design and control of warehouse order picking: a literature review
• Future paths for integer programming and links to artificial intelligence
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• Optimal layout in low-level picker-to-part systems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• Research on warehouse design and performance evaluation: a comprehensive review
• Routing order pickers in a warehouse with a middle aisle

This page was built for publication: On one optimization problem for warehouse goods placement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890427)