Warehouse Picking Model for Single Picker Routing Problem in Multi Dimensional Warehouse Layout Using Genetic Algorithm Approach to Minimize Delay

Damayanti, Dida Diah; Setyawan, Erlangga Bayu; Andrawina, Luciana; Santosa, Budi

doi:10.1007/978-3-319-72550-5_13

Cited by 5 publications

(12 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Type Reference Order Picking Systems Picker-to-Parts [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], [31], [32], [33], [34], [35], [36], [37], [38], [39] Parts-to-Picker [40], [41], [42], [43] Operative Planning Issues…”

Section: Topicsmentioning

confidence: 99%

A Systematic Literature Review: Design and Control of Warehouse Order Picking in Development of E-commerce Transaction

Dida Diah Damayanti,

Prafajar Suksessanno Muttaqin,

Erlangga Bayu Setyawan

et al. 2024

IJIES

View full text Add to dashboard Cite

Order picking is the process of retrieving items from storage to meet a specific customer order, which is known to be the most labor-intensive and costly function among all the warehouse functions. This function is also important in that it has a critical impact on downstream customer service especially in facing the current covid-19 pandemic. This research aims to provide information, description and more comprehensively identifies the design and control of warehouse order picking by using empirical literature review. In this research, the stages are Identification of potential study, Study Selection based on criteria, quality assessment, data extraction, and data analysis. A systematic literature review identified 37 relevant articles for the research purpose. These articles focus on the design and control of warehouse order picking, aiming to enhance e-commerce transactions.

show abstract

Section: Topicsmentioning

confidence: 99%

A Systematic Literature Review: Design and Control of Warehouse Order Picking in Development of E-commerce Transaction

Dida Diah Damayanti,

Prafajar Suksessanno Muttaqin,

Erlangga Bayu Setyawan

et al. 2024

IJIES

View full text Add to dashboard Cite

show abstract

“…Single Picker Routing Problem: Single picker routing problem (SPRP) is the application of the shortest routing method in the warehouse to retrieve products ordered by customers and stored in certain storage locations in the warehouse [27], [28], [29], [30]. The purpose of the Single picker routing problem (SPRP) is to determine the path with the least cost that starts and ends at the same point when collecting all the stock-keeping units (SKUs) contained in the pick list from the storage locations in the warehouse.…”

Section: )mentioning

confidence: 99%

“…The purpose of the Single picker routing problem (SPRP) is to determine the path with the least cost that starts and ends at the same point when collecting all the stock-keeping units (SKUs) contained in the pick list from the storage locations in the warehouse. The single picker routing problem uses a calculation basis on the Traveling Salesman Problem method by considering several additional criteria [27] such as (1) Number of pickers (also can be set as a parameter); (2) Warehouse racking specifications; (3) Distance matrix between slots; (4) Warehouse Layouts.…”

Section: )mentioning

confidence: 99%

See 1 more Smart Citation

Intelligent Warehouse Picking Improvement Model for e-Logistics Warehouse Using Single Picker Routing Problem and Wave Picking

Damayanti

Novitasari²,

Setyawan³

et al. 2022

JOIV : Int. J. Inform. Visualization

View full text Add to dashboard Cite

Abstract— The development and use of technological innovations have changed people's behavior from an industrial society to an information society. It can be seen in the increase in people's consumption patterns from trading through physical stores (offline) to trading through electronic systems, often referred to as e-commerce. Logistics services are distribution actors in the downstream line which are tasked with delivering products from the fulfillment center from e-commerce to the end customer. The uncertainty of the number of requests is the biggest challenge for logistics service players. The growth of e-commerce has also led to an increase in sales volume in e-commerce which has given rise to a new generation of warehouses that are specifically tailored to the special needs of online retailers who directly serve the demands of end-customers in the business-to-consumer (B2C) segment. Traditional warehousing systems cannot handle orders with the characteristics of many transactions but smaller sizes. In addition, warehouses that handle e-commerce are also required to have a fast process in the warehouse because shipments must be made on the same day. In this study, the author aims to perform calculations to find the optimal order picking time in the warehouse, so orders in e-commerce can be processed faster by comparing the picking process time using ordinary Single Picker Routing Problem (SPRP) and combined with the concept of wave picking using Genetic Algorithm (GA). Based on a theoretical study in this paper, the combination between SPRP and wave picking can reduce 42.28% picking time.

show abstract

“…Por su naturaleza, el problema del ruteo de la preparación de pedidos en sistemas low-level picker-to-parts (almacenes 2D) se clasifica como un Steiner TSP, donde algunos nodos no tienen que ser visitados y otros nodos pueden ser visitados más de una vez (De Koster et al 2007). Por lo tanto, el PRP se considera NP-hard (Fu et al 2011), requiriendo de métodos de solución eficientes tales como las metaheurísticas poblacionales (Damayanti et al 2018), entre las cuales se pueden mencionar la optimización de colonia de hormigas y algoritmos genéticos (Jiménez-Carrión 2018), que no garantizan la obtención de un óptimo global, pero permiten encontrar una solución o un conjunto soluciones de alta calidad (López-Lezama, 2015).…”

Section: Introductionunclassified

Optimización por colonia de hormigas para el ruteo de la preparación de pedidos en almacenes de múltiples bloques

et al. 2021

View full text Add to dashboard Cite

Este artículo tiene como objetivo minimizar la distancia total recorrida para la preparación de pedidos (PRP), considerando almacenes 2D de múltiples bloques. La PRP se encarga de planificar la forma como se visitarán las diferentes posiciones de almacenamiento para satisfacer los requerimientos de cada orden del cliente. Para esto, aquí se formulan las distancias mínimas entre cada par de posiciones de almacenamiento a visitar en un tour. Se propone un algoritmo de optimización por colonia de hormigas (ACO, en inglés), al cual se le ajustan parámetros para garantizar un mejor desempeño. Con base en experimentos computacionales, se establece que el ACO propuesto brinda soluciones de alta calidad y genera ahorros satisfactorios frente a una metaheurística y dos heurísticas, requiriendo tiempos de computación viables para ambientes de simulación y ambientes de operación real de almacenes y centros de distribución. Se concluye que el algoritmo ACO propuesto para solucionar la PRP genera soluciones de alta calidad en tiempos de computación razonables.

show abstract

Warehouse Picking Model for Single Picker Routing Problem in Multi Dimensional Warehouse Layout Using Genetic Algorithm Approach to Minimize Delay

Cited by 5 publications

References 4 publications

A Systematic Literature Review: Design and Control of Warehouse Order Picking in Development of E-commerce Transaction

A Systematic Literature Review: Design and Control of Warehouse Order Picking in Development of E-commerce Transaction

Intelligent Warehouse Picking Improvement Model for e-Logistics Warehouse Using Single Picker Routing Problem and Wave Picking

Optimización por colonia de hormigas para el ruteo de la preparación de pedidos en almacenes de múltiples bloques

Contact Info

Product

Resources

About