New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Diefenbach, Heiko; Emde, Simon; Glock, C. H.; Grosse, E. H.

doi:10.1007/s00291-021-00663-8

Cited by 7 publications

(7 citation statements)

References 63 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Diefenbach et al [39] examine exact solutions for U-shaped layouts, resulting from the application of Benders' combinatorial decomposition, which yields accurate solutions to small instances. For larger instances, this research group applies a sweep algorithm as a heuristic approach.…”

Section: Problem Description and Literature Reviewmentioning

confidence: 99%

Comparison of MOEAs in an Optimization-Decision Methodology for a Joint Order Batching and Picking System

Miguel,

Frutos,

Méndez

et al. 2024

Mathematics

View full text Add to dashboard Cite

This paper investigates the performance of a two-stage multi-criteria decision-making procedure for order scheduling problems. These problems are represented by a novel nonlinear mixed integer program. Hybridizations of three Multi-Objective Evolutionary Algorithms (MOEAs) based on dominance relations are studied and compared to solve small, medium, and large instances of the joint order batching and picking problem in storage systems with multiple blocks of two and three dimensions. The performance of these methods is compared using a set of well-known metrics and running an extensive battery of simulations based on a methodology widely used in the literature. The main contributions of this paper are (1) the hybridization of MOEAs to deal efficiently with the combination of orders in one or several picking tours, scheduling them for each picker, and (2) a multi-criteria approach to scheduling multiple picking teams for each wave of orders. Based on the experimental results obtained, it can be stated that, in environments with a large number of different items and orders with high variability in volume, the proposed approach can significantly reduce operating costs while allowing the decision-maker to anticipate the positioning of orders in the dispatch area.

show abstract

Section: Problem Description and Literature Reviewmentioning

confidence: 99%

Comparison of MOEAs in an Optimization-Decision Methodology for a Joint Order Batching and Picking System

Miguel,

Frutos,

Méndez

et al. 2024

Mathematics

View full text Add to dashboard Cite

show abstract

“…In such circumstances, planning, monitoring, and evaluating warehousing activities becomes crucial for warehouse managers as they strive to meet customer needs while navigating intense competition from their rivals. Order picking is a very time-intensive activity with a direct impact on customer service (Diefenbach et al, 2022).…”

Section: Introductionmentioning

confidence: 99%

A multi-warehouse multi-period order picking system: A benders decomposition approach

Nikkhoo,

Kashan,

Nikbakhsh

et al. 2024

Preprint

View full text Add to dashboard Cite

In warehouse management order picking is one of the key operations that incur high costs as well as one of the most complex tasks. It comprises the construction of order batches, batch assignment, picker routes, and scheduling of pickers. Therefore, the development of an efficient order picking system and the optimization of these operations have significant effects on the overall efficiency of the warehouse. This paper focuses on studying and modeling the order batching, batch assignment, and picker routing problems in a multi-warehouse, multi-period, multi-picker order picking system. We propose a multi-objective mathematical model for minimizing the delivery times of batches and the total cost of order picking operations. Also, for the first time, a possibilistic approach is applied to overcome uncertain conditions in the order picking problem. Given the complexity of the problem, Benders' decomposition is implemented to solve the proposed model. The applicability of the proposed method is evaluated through a range of small to large test problems and an actual case study. The results indicate that the proposed exact method is capable of finding high-quality solutions within a reasonable computational time and number of iterations, which serves as evidence of its suitability for large-scale, complex real-world industrial contexts.

show abstract

“…Throughout the years, considerable attention has been directed toward the management of warehouse operations [1]. The process of locating items within a warehouse or fulfillment center and preparing them for dispatch to customers is commonly referred to as "warehouse picking".…”

Section: Introductionmentioning

confidence: 99%

“…One of the main research priorities is order picking, which is generally defined as the recovery of goods from storage sites to fulfill customer orders [2]. This is due to two factors: first, the substantial amount of manual work that choosing orders entails [3], and second, the fact that order picking is a very time-intensive task that has a direct influence on customer service [1,4].…”

Section: Introductionmentioning

confidence: 99%

“…We present a practical logistic order-picking model with a one-directional conveyor and buffers to which the racks and pickers are assigned. In the investigated distribution center, three versions of the layout are modeled: (1) each picker is allocated to a single buffer; (2) one picker is allocated to more than one buffer; and (3) more than one picker is allocated to one buffer. The criteria is to minimize the total time needed to complete all orders.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

Czerniachowska,

Wichniarek,

Żywicki

2023

Applied Sciences

View full text Add to dashboard Cite

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.

show abstract

New solution procedures for the order picker routing problem in U-shaped pick areas with a movable depot

Cited by 7 publications

References 63 publications

Comparison of MOEAs in an Optimization-Decision Methodology for a Joint Order Batching and Picking System

Comparison of MOEAs in an Optimization-Decision Methodology for a Joint Order Batching and Picking System

A multi-warehouse multi-period order picking system: A benders decomposition approach

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

Contact Info

Product

Resources

About