Comparison of advantages and disadvantages among various algorithms in logistics path design—Taking H-group as an example. (December 2018)

• Record Type: Journal Article
• Authors: Yu, Miao; Li, Shuo; Kong, Menglei; Song, Jinguo; Yang, Jing; Ren, Guowen
• Is Part Of: Cognitive systems research. Volume 52(2018)
• Page Start: 843
• Page End: 852
• Publication Date: 2018-12
• Subjects: VRP -- Various algorithms -- Algorithm comparison; Cognition -- Periodicals; Cognitive engineering (System design) -- Periodicals; Artificial intelligence -- Periodicals; 153.05
• DOI: 10.1016/j.cogsys.2018.08.014
• Languages: English
• ISSNs: 1389-0417

Abstract

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.