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 op...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of cases on information technology Ročník 26; číslo 1; s. 1 - 19
Hlavní autoři: Chen, Zhi, Liu, Jie, Wang, Ying
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hershey IGI Global 01.01.2024
Témata:
Algorithms
Ant colony optimization
Big Data
Cargo
Convergence
Electronic commerce
Genetic algorithms
Genetics
Intelligence
Logistics
Mathematical optimization
Optimization
Optimization models
Swarm intelligence
Warehouse stores
Warehouses
ISSN:1548-7717, 1548-7725
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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%.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1548-7717
1548-7725
DOI:10.4018/JCIT.332809