{"title":"大数据群智能优化算法在电子商务物流仓库智能管理中的应用","authors":"Zhi Chen, Jie Liu, Ying Wang","doi":"10.4018/jcit.332809","DOIUrl":null,"url":null,"abstract":"A dynamic mutation probability formula is utilized to optimize the model. In order to solve the logistics warehouse path problem, the ant colony optimization algorithm, optimized by a genetic algorithm, is employed to construct a logistics warehouse path optimization model. This model effectively optimizes the logistics warehouse paths. Test results comparing the convergence and distribution of non-inferior solutions demonstrated that the proposed model outperforms others in terms of convergence and non-inferior solution distribution. In practical logistics warehouse optimization, applying the proposed model to optimize cargo locations can significantly enhance the effectiveness of the objective function. The optimization resulted in improvements for all four objective functions related to cargo location, with reduction rates of 10.38%, 30.88%, 51.78%, and 88.49%, respectively. For the optimization of logistics warehouse paths, the original distance was 47.6m, which was reduced to 27.8m after optimization. Consequently, the picking distance decreased by 41.60%.","PeriodicalId":43384,"journal":{"name":"Journal of Cases on Information Technology","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Big Data Swarm Intelligence Optimization Algorithm Application in the Intelligent Management of an E-Commerce Logistics Warehouse\",\"authors\":\"Zhi Chen, Jie Liu, Ying Wang\",\"doi\":\"10.4018/jcit.332809\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A dynamic mutation probability formula is utilized to optimize the model. In order to solve the logistics warehouse path problem, the ant colony optimization algorithm, optimized by a genetic algorithm, is employed to construct a logistics warehouse path optimization model. This model effectively optimizes the logistics warehouse paths. Test results comparing the convergence and distribution of non-inferior solutions demonstrated that the proposed model outperforms others in terms of convergence and non-inferior solution distribution. In practical logistics warehouse optimization, applying the proposed model to optimize cargo locations can significantly enhance the effectiveness of the objective function. The optimization resulted in improvements for all four objective functions related to cargo location, with reduction rates of 10.38%, 30.88%, 51.78%, and 88.49%, respectively. For the optimization of logistics warehouse paths, the original distance was 47.6m, which was reduced to 27.8m after optimization. Consequently, the picking distance decreased by 41.60%.\",\"PeriodicalId\":43384,\"journal\":{\"name\":\"Journal of Cases on Information Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-10-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Cases on Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/jcit.332809\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Cases on Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/jcit.332809","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Big Data Swarm Intelligence Optimization Algorithm Application in the Intelligent Management of an E-Commerce Logistics Warehouse
A dynamic mutation probability formula is utilized to optimize the model. In order to solve the logistics warehouse path problem, the ant colony optimization algorithm, optimized by a genetic algorithm, is employed to construct a logistics warehouse path optimization model. This model effectively optimizes the logistics warehouse paths. Test results comparing the convergence and distribution of non-inferior solutions demonstrated that the proposed model outperforms others in terms of convergence and non-inferior solution distribution. In practical logistics warehouse optimization, applying the proposed model to optimize cargo locations can significantly enhance the effectiveness of the objective function. The optimization resulted in improvements for all four objective functions related to cargo location, with reduction rates of 10.38%, 30.88%, 51.78%, and 88.49%, respectively. For the optimization of logistics warehouse paths, the original distance was 47.6m, which was reduced to 27.8m after optimization. Consequently, the picking distance decreased by 41.60%.
期刊介绍:
JCIT documents comprehensive, real-life cases based on individual, organizational and societal experiences related to the utilization and management of information technology. Cases published in JCIT deal with a wide variety of organizations such as businesses, government organizations, educational institutions, libraries, non-profit organizations. Additionally, cases published in JCIT report not only successful utilization of IT applications, but also failures and mismanagement of IT resources and applications.