Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems
Because of time and cost constraints, item picking plays a major role in warehouse operations. Considering diversified orders and a constant warehouse design, deciding how to combine each batch and picker route effectively is a challenge in warehouse management. In this study, we focus on the evalua...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2022-10-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/12/21/10921 |
| _version_ | 1827647338459430912 |
|---|---|
| author | Gen-Han Wu Chen-Yang Cheng Ming-Hong Liu |
| author_facet | Gen-Han Wu Chen-Yang Cheng Ming-Hong Liu |
| author_sort | Gen-Han Wu |
| collection | DOAJ |
| description | Because of time and cost constraints, item picking plays a major role in warehouse operations. Considering diversified orders and a constant warehouse design, deciding how to combine each batch and picker route effectively is a challenge in warehouse management. In this study, we focus on the evaluation of order-batching strategies for a single picker facing multiple orders with the objective of minimizing the total traveling distance. We propose two-stage simulated annealing and variable neighborhood search algorithms to solve the combined problem. The orders are first merged into batches, followed by determining the sequence in each batch. The computational analysis revealed that the best-fit-decreasing (BFD) batch ordering strategy in the two-stage algorithms, the variable neighborhood search algorithm, obtained superior solutions to those of the simulated annealing algorithm. |
| first_indexed | 2024-03-09T19:17:45Z |
| format | Article |
| id | doaj.art-0d0bba61858c49c3a44d35f700f1cae4 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-03-09T19:17:45Z |
| publishDate | 2022-10-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-0d0bba61858c49c3a44d35f700f1cae42023-11-24T03:35:04ZengMDPI AGApplied Sciences2076-34172022-10-0112211092110.3390/app122110921Two-Stage Metaheuristic Algorithms for Order-Batching and Routing ProblemsGen-Han Wu0Chen-Yang Cheng1Ming-Hong Liu2Department of Industrial Engineering and Management, Yuan Ze University, Taoyuan 32003, TaiwanDepartment of Industrial Engineering and Management, National Taipei University of Technology, Taipei 10608, TaiwanGraduate Institute of Logistics Management, Dong Hwa University, Hualien 974301, TaiwanBecause of time and cost constraints, item picking plays a major role in warehouse operations. Considering diversified orders and a constant warehouse design, deciding how to combine each batch and picker route effectively is a challenge in warehouse management. In this study, we focus on the evaluation of order-batching strategies for a single picker facing multiple orders with the objective of minimizing the total traveling distance. We propose two-stage simulated annealing and variable neighborhood search algorithms to solve the combined problem. The orders are first merged into batches, followed by determining the sequence in each batch. The computational analysis revealed that the best-fit-decreasing (BFD) batch ordering strategy in the two-stage algorithms, the variable neighborhood search algorithm, obtained superior solutions to those of the simulated annealing algorithm.https://www.mdpi.com/2076-3417/12/21/10921order batchingorder pickingwarehousesimulated annealingvariable neighborhood search |
| spellingShingle | Gen-Han Wu Chen-Yang Cheng Ming-Hong Liu Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems Applied Sciences order batching order picking warehouse simulated annealing variable neighborhood search |
| title | Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems |
| title_full | Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems |
| title_fullStr | Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems |
| title_full_unstemmed | Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems |
| title_short | Two-Stage Metaheuristic Algorithms for Order-Batching and Routing Problems |
| title_sort | two stage metaheuristic algorithms for order batching and routing problems |
| topic | order batching order picking warehouse simulated annealing variable neighborhood search |
| url | https://www.mdpi.com/2076-3417/12/21/10921 |
| work_keys_str_mv | AT genhanwu twostagemetaheuristicalgorithmsfororderbatchingandroutingproblems AT chenyangcheng twostagemetaheuristicalgorithmsfororderbatchingandroutingproblems AT minghongliu twostagemetaheuristicalgorithmsfororderbatchingandroutingproblems |