Necessity and complexity of order picking routing optimisation based on pallet loading features

DOI10.1515/ausi-2017-0011zbMath1387.90020OpenAlexW2783250214MaRDI QIDQ1698579

Péter Földesi, János Botzheim, Tamás Bódis

Publication date: 16 February 2018

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ausi-2017-0011

zbMATH Keywords

complexitysimulated annealingroutingorder pickingbin packingpallet loading problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Cites Work

• Optimization by Simulated Annealing
• Design and control of warehouse order picking: a literature review
• Using a TSP heuristic for routing order pickers in warehouses
• A tabu search algorithm for the pallet loading problem
• Constraints in container loading -- a state-of-the-art review
• Solving the pallet loading problem
• Three-dimensional packing of items with limited load bearing strength
• Sequential heuristic for the two-dimensional bin-packing problem

This page was built for publication: Necessity and complexity of order picking routing optimisation based on pallet loading features