A computational software system to design order picking warehouses
From MaRDI portal
Publication:2668754
DOI10.1016/j.cor.2021.105311OpenAlexW3152544601WikidataQ111934422 ScholiaQ111934422MaRDI QIDQ2668754
Kevin R. Gue, S. G. Ozden, Alice E. Smith
Publication date: 7 March 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2021.105311
Uses Software
Cites Work
- Unnamed Item
- A constructive aisle design model for unit-load warehouses with multiple pickup and deposit points
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Solving large batches of traveling salesman problems with parallel and distributed computing
- Algorithms for on-line order batching in an order picking warehouse
- Exact algorithms for the order picking problem
- The discrete forward-reserve problem -- allocating space, selecting products, and area sizing in forward order picking
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- The effect of warehouse cross aisles on order picking efficiency
- Routing methods for warehouses with multiple cross aisles
- Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
- Mathematical Tools in Computer Graphics with C# Implementations
- Routing order pickers in a warehouse with a middle aisle
- A novel approach for modeling order picking paths
This page was built for publication: A computational software system to design order picking warehouses