Abstract
In order to improve the efficiency of picking operation and reduce the cost of picking goods, the optimization of picking path has become an urgent problem for current enterprise. In this paper, the mathematical model of the shortest distance between cargo grids, between cargo grids and check stations, between check stations and check stations is established. In order to complete the picking operation as soon as possible, the optimization target model of picking path is established, then the optimization model is transformed into the shortest distance between the check platform, the cargo grid and check platform. The greedy algorithm and simulated annealing algorithm are used to solve the problem, and the results are compared. It is concluded that under the same task order, the picking path obtained by simulated annealing algorithm saves nearly 8.05%, and fully reduces the useless path in the process of walking, so as to reduce the cost and improve the efficiency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
2020 Math Cup’s Mathematical Modeling Challenge for Universities (2020). http://www.mathorcup.org/detail/2294
Li, J., Zhou, W., Chen, F.: Research on the application of picking path optimization strategy in B2C e-commerce warehouse. Oper. Res. Manage. Res. 23(01), 7–14 (2014). (in Chinese)
Fang, D., Peng, Y.: Research on warehouse picking path optimization with multiple lateral roadways. Logistics Technol. Surg. 35(5), 130–135+156 (2016). (in Chinese)
Li, S.: Research on optimal design and control of picking operation in distribution center. Southwest Jiaotong University (2008). (in Chinese)
Xuejing, D., Feifei, S., Yunhao, W.: Research on optimization of small parcel delivery route. Logistics Technol. 37(4), 29–35 (2018). (in Chinese)
Si, S., Sun, Z.: Mathematical Modeling Algorithm and Application. National Defense Industry Press, Beijing, vol. 4, pp. 399–402 (2017). (in Chinese)
Haoyang, Y.: Picking route optimization method based on genetic algorithm. China Sci. Technol. Inf. 8, 91–94 (2019). (in Chinese)
Huang, L., Chang, L., Gao, Z.: Intelligent rate adaptation based on improved simulated annealing algorithm. I. J. Comput. Network Inf. Secur. 1, 9–16 (2010)
Yang, C.L., Nguyen, T.P.Q.: Constrained clustering method for class-based storage location assignment in warehouse. Ind. Manage. Data Syst. 116(4), 667–689 (2016)
Hall, R.W.: Distance approximations for routing manual pickers in a warehouse. IE Transtractions 25(4), 76–87 (1993)
Dewi, N.K., Putra, A.S.: Application of greedy algorithm on traffic violation enforcement. I. J. Educ. Manage. Eng. 1, 1–10 (2021)
Chen, Z., Valraktarakis, G.L.: Integrated scheduling of production and distribution operations. Manage. Sci. 51(4), 614–628 (2005)
Cheng, C.-Y., Chen, Y.-Y., Chen, T.-L.: Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem. Prod. Econ. 5, 1–10 (2015)
Armentano, V.A., Shiguemoto, A.L., L∅kketangen, A.: Tabu search with path relinking for an integrated production-distribution problem. Comput. Oper. Res. 38(8), 1199–1209 (2011)
Qi, C., Hu, L.: Optimization of vehicle routing problem for emergency cold chain logistics based on mini-mum loss. Phys. Commun. 40, 101085 (2020)
Dias, U.V., Rane, M.E.: Block-based compressive sensed thermal image reconstruction using greedy algorithms. I. J. Image Graph. Sign. Proces. 10, 36–42 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Fan, B. (2022). Optimization Model of Warehouse Picking Path Based on Simulated Annealing Algorithm. In: Hu, Z., Zhang, Q., Petoukhov, S., He, M. (eds) Advances in Artificial Systems for Logistics Engineering. ICAILE 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 135. Springer, Cham. https://doi.org/10.1007/978-3-031-04809-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-031-04809-8_51
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-04808-1
Online ISBN: 978-3-031-04809-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)