Optimally solving the joint order batching and picker routing problem
| Autor: | Alexandre Salles da Cunha, John E. Beasley, Cristiano Arbex Valle |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
FOS: Computer and information sciences
Mathematical optimization Order picking Information Systems and Management Discrete Mathematics (cs.DM) General Computer Science Computer science Real-time computing 0211 other engineering and technologies 02 engineering and technology Management Science and Operations Research Industrial and Manufacturing Engineering FOS: Mathematics 0202 electrical engineering electronic engineering information engineering 90C10 90B05 Mathematics - Optimization and Control Integer programming 021103 operations research Heuristic Optimization and Control (math.OC) Order (business) Modeling and Simulation 020201 artificial intelligence & image processing Joint (building) Routing (electronic design automation) Computer Science - Discrete Mathematics |
| Zdroj: | European Journal of Operational Research. 262:817-834 |
| ISSN: | 0377-2217 |
| DOI: | 10.1016/j.ejor.2017.03.069 |
| Popis: | In this work we investigate the problem of order batching and picker routing in storage areas. These are labour and capital intensive problems, often responsible for a substantial share of warehouse operating costs. In particular, we consider the case of online grocery shopping in which orders may be composed of dozens of items. We present a formulation for the problem based on an exponential number of connectivity constraints and we introduce a significant number of valid inequalities based on the standard layout of warehouses, composed of parallel aisles and two or more cross-aisles. The proposed inequalities are highly effective and greatly improve computational results. Instances involving up to 20 orders are solved to proven optimality when we jointly consider order batching and picker routing. Instances involving up to 5000 orders are considered where order batching is done heuristically, but picker routing is done optimally. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect