EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
4311. A review of order batching optimization problems
Invited abstract in session WD-52: Heuristic Algorithms for Combinatorial Optimization Problems II (Contributed), stream Combinatorial Optimization.
Wednesday, 14:30-16:00Room: 8003 (building: 202)
Authors (first author is the speaker)
| 1. | Eduardo G. Pardo
|
| Informática y EstadÃstica, Universidad Rey Juan Carlos | |
| 2. | Sergio Gil-Borras
|
| Sistemas Informaticos, Universidad Politecnica de Madrid |
Abstract
There is a family of related optimization problems, commonly denoted as Order Batching Problems, which are tackled as part of the supply chain management. This family, groups those problems consisting in the optimization of the picking process in a warehouse, when the picking policy follows a batching strategy. The batching strategy consists of grouping the items into batches before starting the picking process. The picking of the items within the same batch is then performed on a single picking route and all items in the batch are picked together. Tackling an Order Batching Problem usually involves solving several activities, necessary to perform the picking process, such as: batching, routing, assigning, sequencing, or waiting, among others. In this review we focus on manual picking systems performed in rectangular-shaped warehouses, which is probably the most common warehouse configuration in the literature. We review and classify the problems in the literature on a new taxonomy, examining the most outstanding heuristic and metaheuristics algorithms proposed to tackle the different tasks of the problem. Finally, we outline future research directions related to the studied topic.
Keywords
- Supply Chain Management
- Logistics
- Metaheuristics
Status: accepted
Back to the list of papers