Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
11002265 | Cognitive Systems Research | 2018 | 16 Pages |
Abstract
There are many kinds of VRP problems and there are many ways to solve them. In this paper, we use ant colony algorithm, genetic algorithm, and annealing algorithm to optimize the selection of the logistics path of H-group located at He Nan Province. It establishes an algorithm evaluation system, and analyzes the performance of the three algorithms in six dimensions from qualitative and quantitative perspectives. Through MATLAB data calculation, we found that the ant colony algorithm performs equally well on the solution quality, solution efficiency, code storage, robustness, adaptability, and optimality.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Miao Yu, Shuo Li, Menglei Kong, Jinguo Song, Jing Yang, Guowen Ren,