A Two-Step Matheuristics for Order-Picking Process Problems with One-Directional Material Flow and Buffers

Abstract

The necessity for undertaking this research is driven by the prevailing challenges encountered in logistic centers. This study addresses a logistic order-picking issue involving unidirectional conveyors and buffers, which are assigned to racks and pickers with the objective of minimizing the makespan. Subsequently, two variations of a two-step matheuristic approach are proposed as solution methodologies. These matheuristics entail decomposing the primary order-picking problem into two subproblems. In the initial step, the problem of minimizing the free time for pickers/buffers is solved, followed by an investigation into minimizing order picking makespan. An experimentation phase is carried out across three versions of a distribution center layout, wherein one or more pickers are allocated to one or more buffers, spanning 120 test instances. The research findings indicate that employing a mathematical programming-based technique holds promise for yielding solutions within reasonable computational timeframes, particularly when distributing products to consumers with limited product variety within the order. Furthermore, the proposed technique offers the advantages of expediency and simplicity, rendering it suitable for adoption in the process of designing and selecting order-picking systems.

Matheuristics for the Order-picking Problem with Sequence-dependant Constraints in a Logistic Center with a One-directional Conveyor Between Buffers

“…• Simplifying the 2 nd step of matheuristics excluding products with zero quantities, achieved in the 1 st step of matheuristics. This approach was also not used in Czerniachowska et al (2023b) matheuristics.…”