Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system
From MaRDI portal
Publication:3369515
DOI10.1080/00207540500151325zbMath1082.90054OpenAlexW2076341863MaRDI QIDQ3369515
No author found.
Publication date: 2 February 2006
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540500151325
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation methods and heuristics in mathematical programming (90C59) Marketing, advertising (90B60)
Related Items
MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem ⋮ Tabu search heuristics for the order batching problem in manual order picking systems ⋮ Order batching problems: taxonomy and literature review ⋮ Order batching and order picking with 3D positioning of the articles: solution through a hybrid evolutionary algorithm ⋮ Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time
Cites Work
- Optimal clustering of frequency-constrained maintenance jobs with shared set-ups
- Minimization subproblems and heuristics for an applied clustering problem
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- A comparison of heuristics for the problem of batching orders for warehouse selection
- CASE: A clustering algorithm for cell formation with sequence data
- A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems
- Efficient orderbatching methods in warehouses
- Routing order pickers in a warehouse with a middle aisle
