Exact and inexact solution procedures for the order picking in an automated carousal conveyor
From MaRDI portal
Publication:3533209
DOI10.1080/00207540601166990zbMath1151.90478MaRDI QIDQ3533209
No author found.
Publication date: 23 October 2008
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540601166990
heuristics; order picking; integer programming model; carousal conveyor; multi-travelling salesman problem
90C10: Integer programming
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Cites Work
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
- Warehouse design and control: Framework and literature review
- On the minimal travel time needed to collect \(n\) items on a circle.
- The travel time in carousel systems under the nearest item heuristic
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- A comparison of heuristics for the problem of batching orders for warehouse selection
- Multiple Order Pick Sequencing in a Carousel System: A Solvable Case of the Rural Postman Problem
