Application of heuristic algorithms in warehouse order picking routes

Cipto Purwanto, Rienna Oktarina

Abstract


Order picking is a costly activity in warehouse operations, accounting for up to 65% of total warehouse operational costs. This study aims to improve the efficiency and productivity of the order picking process in a warehouse by applying two heuristic methods, namely the S-Shape and aisle-by-aisle approaches. Data were processed using InterActive Freight & Warehouse software, which is designed for warehousing and logistics management with interactive features that assist in optimizing order picking routes. The software employs heuristic methods, such as the S-Shape and aisle-by-aisle strategies, to reduce the distance workers travel to pick goods. The results show that the S-Shape method significantly reduces workers' travel distance compared to other methods. Thus, the application of heuristic methods in optimizing order picking routes proves effective in enhancing warehouse operational efficiency. The S-Shape method yields an average total distance traveled of 678.729 meters, while the aisle-by-aisle method results in 684.04 meters. Additionally, the S-Shape method increases line order productivity from 30 lines of orders per packing list to 84 lines of orders per packing list, with a cycle time of 45.25 seconds to complete the picking process for one line of orders.

Keywords


Heuristic method; Order picking; Travel distance; Warehousing

Full Text:

PDF

References


J. J. Bartholdi, III dan S. T. Hackman, Warehouse & Distribution Science, Warehouse-Science.com, 2019, [Online]. Tersedia: https://www.warehouse-science.com/book/WarehouseAndDistributionScience_0.96.pdf.

R. de Koster, T. Le-Duc, and K. J. Roodbergen, “Design and control of warehouse order picking: A literature review,” Eur J Oper Res, vol. 182, no. 2, pp. 481–501, Oct. 2007.

G. Dunn, H. Charkhgard, A. Eshragh, dan E. Stojanovski, “A modified algorithm for optimal picker routing in a single block warehouse,” arXiv, 19 Sep. 2024, [Online]. Tersedia: https://arxiv.org/abs/2409.13219.

Z. Kai and G. Chuanhou, “Improved formulations of the joint order batching and picker routing problem,” Jul. 2022, [Online]. Available: http://arxiv.org/abs/2207.05305

G. Richards, Warehouse Management: A Complete Guide to Improving Efficiency and Minimizing Costs in the Modern Warehouse 3rd Edition, 3rd ed. Kogan Page, 2017.

M. Ten Hompel and T. Schmidt, Warehouse Management: Automation and Organization of Warehouse and Order Picking Systems. Springer Science & Business Media., 2007.

C. Theys, O. Bräysy, W. Dullaert, and B. Raa, “Using a TSP heuristic for routing order pickers in warehouses,” Eur J Oper Res, vol. 200, no. 3, pp. 755–763, Feb. 2010.

S. Hong and Y. Kim, “A route-selecting order batching model with the S-shape routes in a parallel-aisle order picking system,” Eur J Oper Res, vol. 257, no. 1, pp. 185–196, Feb. 2017, doi: 10.1016/j.ejor.2016.07.017.

A. Leroy, A. Caris, B. Depaire, T. van Gils, and K. Braekers, “A case study on order picking schedule deviations and their contributing factors,” Comput Ind Eng, vol. 203, p. 111019, May 2025, doi: 10.1016/j.cie.2025.111019.

Mukhlisin and Lien Herliani Kusumah, “Perbaikan Produktivitas Picking Order dengan Metode Routing Heuristic di Gudang Pusat Suku Cadang Otomotif,” 2018. [Online]. Available: https://www.otosia.com,

T. Lee, H. Y. Fibrianto, and S. Hong, “Order batching problems in parallel-aisle order picking systems with larger-than-bin orders,” Journal of the Operational Research Society, vol. 75, no. 10, pp. 1893–1909, Oct. 2024, doi: 10.1080/01605682.2023.2283526.

Y. Su, M. Li, X. Zhu, and C. Li, “Steiner TSP based on aisle as a unit for order picking,” Comput Ind Eng, vol. 168, p. 108026, Jun. 2022, doi: 10.1016/j.cie.2022.108026.

K. Zhang and C. Gao, “Improved formulations of the joint order batching and picker routing problem,” Int J Prod Res, vol. 61, no. 21, pp. 7386–7409, Nov. 2023, doi: 10.1080/00207543.2022.2149872.

J. O. Ong and T. Joseph, “A Review of Order Picking Improvement Methods,” J@TI Undip, vol. IX, no. 3, 2014.

X. Feng and X. Hu, “A Heuristic Solution Approach to Order Batching and Sequencing for Manual Picking and Packing Lines considering Fatiguing Effect,” Scientific Programming, vol. 2021, no. 1, Jan. 2021.

Y. Li, F. A. Méndez-Mediavilla, C. Temponi, J. Kim, and J. A. Jimenez, “A Heuristic Storage Location Assignment Based on Frequent Itemset Classes to Improve Order Picking Operations,” Applied Sciences, vol. 11, no. 4, p. 1839, Feb. 2021, doi: 10.3390/app11041839.

S. Mou, “Integrated Order Picking and Multi-Skilled Picker Scheduling in Omni-Channel Retail Stores,” Mathematics, vol. 10, no. 9, May 2022, doi: 10.3390/math10091484.

İ. Çobanoğlu, İ. Güre, and V. Bayram, “Data driven storage location assignment problem considering order picking frequencies: A heuristic approach,” Pamukkale University Journal of Engineering Sciences, vol. 27, no. 4, pp. 520–531, 2021, doi: 10.5505/pajes.2021.34979.

A. Chandra, “Analisis Order Picking dengan Menggunakan Metode Routing Heuristics di Gudang PT. GMS,” Jurnal Metris, vol. 16, pp. 83–90, 2015.

E. K. A. Pakpahan, R. Silitonga, and A. P. Utomo, “Minimasi Jarak Tempuh Order Picking pada Gudang dengan Karakteristik Two-Cross Aisle Layout,” Journal of Integrated System, vol. 3, no. 1, pp. 1–8, Jun. 2020, doi: 10.28932/jis.v3i1.2159.

J. A. Cano, “Order picking optimization based on a picker routing heuristic: Minimizing total traveled distance in warehouses,” dalam Handbook of Research on the Applications of International Transportation and Logistics for World Trade, Ed. G. Musolino, Hershey, PA, USA: IGI Global, 2020, pp. 74–96.

S. Quader and K. K. Castillo-Villar, “Design of an enhanced multi-aisle order-picking system considering storage assignments and routing heuristics,” Robot Comput Integr Manuf, vol. 50, pp. 13–29, Apr. 2018, doi: 10.1016/j.rcim.2015.12.009.

G. Casydi, A. Y. Ridwan, dan M. D. Astuti, “Simulation design for storage allocation strategy analysis using interaction frequency heuristic to minimize picking time in FMCG warehouse,” ResearchGate, 2018, [Online]. Tersedia: https://www.researchgate.net/publication/324819315.

A. R. F. Pinto, M. S. Nagano, and E. Boz, “A classification approach to order picking systems and policies: Integrating automation and optimization for future research,” Results in Control and Optimization, vol. 12, Sep. 2023, doi: 10.1016/j.rico.2023.100281.

T. Rojanapitoon and J. Teeravaraprug, “Economic Order Picker Routing Considering Travel Time and Vehicular Energy Consumption with Varying Aisle Traffic,” International Journal of Intelligent Engineering and Systems, vol. 13, no. 3, pp. 317–328, 2020, doi: 10.22266/ijies2020.0430.31.

E. Costa e Silva, M. Cruz, I. C. Lopes, and A. Moura, "A Mathematical Model for Supermarket Order Picking," in Progress in Industrial Mathematics at ECMI 2014, Cham: Springer, 2016, pp. 189–196. doi: 10.1007/978-3-319-23413-7_25.

X. Jiang, L. Sun, Y. Zhang, dan X. Hu, “Order batching and sequencing for minimising the total order completion time in pick-and-sort warehouses,” Expert Syst. Appl., vol. 187, p. 115914, Jan. 2022, doi: 10.1016/j.eswa.2021.115914.

P. H. V. Penna, A. Subramanian, and L. S. Ochi, “An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem,” Journal of Heuristics, vol. 19, no. 2, pp. 201–232, Apr. 2013, doi: 10.1007/s10732-011-9186-y.

D. Merkle, M. Middendorf, and H. Schmeck, “Ant colony optimization for resource-constrained project scheduling,” IEEE Transactions on Evolutionary Computation, vol. 6, no. 4, pp. 333–346, Aug. 2002, doi: 10.1109/TEVC.2002.802450.

L. Polten and S. Emde, “Scheduling automated guided vehicles in very narrow aisle warehouses,” Omega (United Kingdom), vol. 99, Mar. 2021, doi: 10.1016/j.omega.2020.102204.




DOI: http://dx.doi.org/10.62870/jiss.v10i2.28595

Refbacks

  • There are currently no refbacks.


  is supported by