Matheuristics for the Order-picking Problem with Sequence-dependant Constraints in a Logistic Center with a One-directional Conveyor Between Buffers
[ 1 ] Instytut Technologii Materiałów, Wydział Inżynierii Mechanicznej, Politechnika Poznańska | [ P ] employee
2024
scientific article
english
- order picking
- mathematical programming
- matheuristics
- logistics center
- distribution center
EN In the logistics center (warehouse or distribution center), customer orders need to be picked up by the pickers. In this research, we examine the order-picking problem with sequencedependent constraints with two decision variables (container start time and product quantity) in a distribution center with a one-directional conveyor. The decision-making is based on the developed two variations of two-step matheuristics. At first, the main order-picking problem is divided into two subproblems. Next, each step of each variant of the subproblem is solved using a mathematical programming-based technique. Both matheuristics were better in 85 of 120 test instances compared to the initial model solved by mathematical programming. Pickers matheuristics were better on average at 46.56%, while Buffers matheuristics were better on average at 46.87%. The proposed matheuristics approach allows distributors to schedule orders in the logistics center fast enough and with fewer resources.
140 - 160
CC BY (attribution alone)
open journal
final published version
at the time of publication
100
1,4 [List 2022]