Optimizing Storage and Picking Routes in Dual-Zone Warehouses Using Genetic Algorithms: A Case Study of YY Company
Jia Hui Ye (),
Chang Jun Liu () and
An-Shin Shia ()
Asian Business Research Journal, 2025, vol. 10, issue 5, 30-50
Abstract:
This research addresses the optimization of storage locations and picking routes in YY’s dual-zone warehouse, with the goal of cutting warehousing costs and enhancing operational efficiency. As the economy shifts and industrial structures upgrade, the logistics industry’s significance in the national economy grows increasingly evident. The Apriori algorithm discerns order item associations, informing the reorganization of storage allocations for optimized efficiency. On this basis, a target optimization model is constructed to further enhance the rationality of the storage layout. Regarding the optimization of picking paths, this paper presents a path optimization model tailored for multi-vehicle operations, based on the layout characteristics of YY’s warehouse. This paper validates the improved genetic algorithm’s effectiveness and practicality in optimizing double-zone warehouse storage and picking paths through Matlab simulations and comparisons with traditional methods.
Keywords: Apriori algorithm; Genetic algorithm; Picking path optimization; Storage location optimization; YY Company (YY’s). (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
https://ecsenet.com/index.php/2576-6759/article/view/429/166 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:ajn:abrjou:v:10:y:2025:i:5:p:30-50:id:429
Access Statistics for this article
More articles in Asian Business Research Journal from Eastern Centre of Science and Education
Bibliographic data for series maintained by Tracy William ( this e-mail address is bad, please contact ).