A discrete cross aisle design model for order-picking warehouses

DOI10.1016/J.EJOR.2018.11.037zbMath1430.90118OpenAlexW2900675740WikidataQ128889673 ScholiaQ128889673MaRDI QIDQ1713732

Deniz Hoser, Ömer Öztürkoğlu

Publication date: 28 January 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.037

zbMATH Keywords

routingfacilities planning and designrandomized storagewarehouse designorder-picking

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Related Items (3)

How to optimize storage classes in a unit-load warehouse ⋮ Order batching and order picking with 3D positioning of the articles: solution through a hybrid evolutionary algorithm ⋮ Aisle designs in unit-load warehouses with different flow policies of multiple pickup and deposit points

Cites Work

• Unnamed Item
• A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
• A new mathematical programming formulation for the single-picker routing problem
• Effects of initial memory and identical harmony in global optimization using harmony search algorithm
• Design and control of warehouse order picking: a literature review
• Using a TSP heuristic for routing order pickers in warehouses
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• The traveling salesman problem on a graph and some related integer polyhedra
• Mittlere Wegzeiten beim eindimensionalen Kommissionieren
• Routing methods for warehouses with multiple cross aisles
• Optimizing fishbone aisles for dual‐command operations in a warehouse
• An Algorithm for the Traveling Salesman Problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Routing order pickers in a warehouse with a middle aisle

This page was built for publication: A discrete cross aisle design model for order-picking warehouses