Due to the effects of the COVID-19 pandemic and the rise of online shopping, the offline sales of IKEA Fuzhou have been declining since 2020. Because the cost of distribution warehouse is a major expense for offline chain furniture retailers, and the picking process is a key activity in distribution warehouse operations. To reduce the cost of distribution warehouse and alleviate the survival pressure of the offline chain furniture retailers, this paper focuses on optimizing the picking route of the IKEA Fuzhou distribution warehouse. It starts by creating a two-dimensional coordinate system for the storage location of the distribution warehouse using the traditional S-type picking strategy to calculate the distance and time of the sorting route. Then, the problem of optimizing the picking route is then transformed into the travelling salesman problem (TSP), and picking route optimization model is developed using a genetic algorithm to analyze the sorting efficiency and picking route optimization. Results show that the order-picking route using the genetic algorithm strategy is significantly better than the traditional S-type picking strategy, which can improve overall sorting efficiency and operations, reduce costs, and increase efficiency. Thus, this establishes an implementation process for the order-picking path based on genetic algorithm optimization to improve overall sorting efficiency and operations, reduce costs, increase efficiency, and alleviate the survival pressure of pandemic-affected enterprises.
References
[1]
Chen, X.Y., Xiang, S.L. and Tao, T. (2019) Development Status of Furniture E-Commerce Platform. ChinaForestProductsIndustry, 56, 55-58.
[2]
Li, X.X. and Zhang, Y.L. (2019) Analysis on Marketing Strategy of IKEA Home in Guangzhou. ModernManagement, 9, 445-453. https://doi.org/10.12677/MM.2019.94055
[3]
Ma, X.G. (2016) Development Status and Trend of Warehouse Picking Technology. Logistics&MaterialHandling, 21, 110-114.
[4]
Cheng, S.Q. (2003) Discussion on Planning and Management of Storage Space in Distribution Center. ChinaStorage&Transport, No. 3, 50-53.
[5]
Wang, H., Fu, Z. and Zuo, W. (2009) Genetic Algorithm for Picking Routing Problem in 2-Block Warehouse. ComputerEngineeringandApplications, 45, 224-228.
[6]
Liu, Y.P. (2016) Research on of Warehouse Picking System Based on Multi AGV for Electronic Commerce. Master’s Thesis, Shan Dong University, Jinan.
[7]
Wu, X.L. (2019) A Summary of the Application of Intelligent Algorithms in Intelligent Warehouse. Logistics&MaterialHandling, 8, 118-123.
[8]
Mantel, R.J., Schuur, P.C. and Heragu, S.S. (2007) Order Oriented Slotting: A New Assignment Strategy for Warehouses. EuropeanJournalofIndustrialEngineering, 1, 301-316. https://doi.org/10.1504/EJIE.2007.014689
[9]
Potvin, J.-Y. (1996) Genetic Algorithms for the Traveling Salesman Problem. AnnalsofOperationsResearch, 63, 337-370. https://doi.org/10.1007/BF02125403
[10]
Khan, F.H., Khan, N., Inayatullah, S. and Nizami, S.T. (2009) Solving TSP Problem by Using Genetic Algorithm. InternationalJournalofBasic&AppliedSciences, 9, 79-88.
[11]
Hariyadi, P.M., Nguyen, P.T., Iswanto, I. and Sudrajat, D. (2020) Traveling Salesman Problem Solution Using Genetic Algorithm. JournalofCriticalReviews, 7, 56-61.
[12]
Sun, Y. (2008) Development of the Application of Improved-GA in Mechanical Design Optimization. JournalofYunnanAgriculturalUniversity, 23, 99-102.
[13]
Chen, X.Y., Dai, Y.H. and Chen, J.Y. (2021) Research on Picking Route Planning of Warehouse System. TechniquesofAutomationandApplications, 40, 85-89.
[14]
Li, S.B., Song, Q.S., Li, Z.A., Zhang, X.X. and Zhe, L.X. (2020) Review of Genetic Algorithm in Robot Path Planning. ScienceTechnologyandEngineering, 2, 423-431.
[15]
Yu, H.Y. (2019) Picking Path Optimization Method Based on Genetic Algorithm. ChinaScienceandTechnologyInformation, 8, 91-94.
[16]
Cui, Q. (2021) Research on the Optimization of Picking Process in Warehouse Center of Enterprise A. Master’s Thesis, Hebei University of Engineering, Handan.
[17]
Zhou, H., Song, M. and Pedrycz, W. (2018) A Comparative Study of Improved GA and PSO in Solving Multiple Traveling Salesmen Problem. AppliedSoftComputing, 64, 564-580. https://doi.org/10.1016/j.asoc.2017.12.031
[18]
Okonji, C., Omotosho, O.J. and Ogbonna, A.C. (2020) A Comparative Analysis of Four Path Optimization Algorithm. InternationalJournalofCommunicationsandNetworks, 3, 1-11.
[19]
Sebo, J. and Busa Jr., J. (2020) Comparison of Advanced Methods for Picking Path Optimization: Case Study of Dual-Zone Warehouse. InternationalJournalofSimulationModeling, 19, 410-421. https://doi.org/10.2507/IJSIMM19-3-521
[20]
Sun, J.Y., Che, Z.R., Niu, Y.R., Zhang, Y.Y. and Han, F. (2020) Joint Optimization of Picking Operation Based on Nested Genetic Algorithm. JournalofComputerApplications, 12, 3687-3694.
[21]
Wang, X.X. (2021) Order Batch Optimization of Y Distribution Center Considering Picking Distance and Time Limit Constraints. Master’s Thesis, Beijing Jiaotong University, Beijing.
[22]
Yan, J., Chang, L. and Feng, L.H. (2022) Online Order Batching and Picking Path Planning Model and Algorithm. ComputerEngineeringandApplications, 4, 283-289.
[23]
Li, S.Z. and Wang, Z. (2002) Research on Order Picking Path Optimization—Application of S-Shape Heuristic Method in Picking in Distribution Center. Logistics&MaterialHandling, 7, 67-70.
[24]
Petersen, C.G., Cao, X. and Aase, G.R. (2021) COVID-19 Pandemic Implications for Order Picking Operations. OpenJournalofBusinessandManagement, 9, 2866-2878. https://doi.org/10.4236/ojbm.2021.96160
[25]
Li, J.B., Zhou, W. and Chen, F. (2014) Applied Optimal Strategies for Warehouse Picking Routing in B2C. OperationsResearchandManagementScience, 23, 7-14.
[26]
Chen, H.K., Xiao, T.Y., Shi, J.R., Zhuang, Q.J. and Xu, Y. (2020) Research on the Optimization of Warehouse Picking Based on Multi-Layer Feed Forward Neural Network. AdvancesinAppliedMathematics, 9, 2010-2016. https://doi.org/10.12677/AAM.2020.911233
[27]
Ratliff, H.D. and Rosenthal, A.S. (1983) Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. OperationsResearch, 31, 507-521. https://doi.org/10.1287/opre.31.3.507
[28]
Bottani, E., Cecconi, M., Vignali, G. and Montanari, R. (2012) Optimisation of Storage Allocation in Order Picking Operations through a Genetic Algorithm. InternationalJournalofLogisticsResearchandApplications, 15, 127-146. https://doi.org/10.1080/13675567.2012.694860
[29]
Mukhopadhyay, D.M., Balitanas, M.O., Farkhod, A., Jeon, S.H. and Bhattacharyya, D. (2009) Genetic Algorithm: A Tutorial Review. InternationalJournalofGridandDistributedComputing, 2, 25-32.
[30]
Chudasama, C., Shah, S.M. and Panchal, M. (2011) Comparison of Parents Selection Methods of Genetic Algorithm for TSP. Proceedings of International Conference on Computer Communication and Networks CSI-COMNET-2011, New York, 4-6 December 2011, 85-87.
[31]
Deep, K. and Mebrahtu, H. (2012) Variant of Partially Mapped Crossover for the Travelling Salesman Problems. International Journal of Combinatorial Optimization Problems and Informatics, 3, 47-69.
