Optimisation and application research of ant colony algorithm in vehicle routing problem. (4th April 2021)

• Record Type: Journal Article
• Authors: Niu, Lede; Xiong, Liran
• Is Part Of: International journal of computing science and mathematics. Volume 13:Number 2(2021)
• Page Start: 177
• Page End: 193
• Publication Date: 2021-04-04
• Subjects: ant colony algorithm -- vehicle routing problem -- parameter selection; Mathematics -- Periodicals; Computer science -- Periodicals; Mathematics -- Data processing -- Periodicals; 510.285
• Languages: English
• ISSNs: 1752-5055

Abstract

In this paper, an improved ant colony algorithm based on ant system is proposed in order to solve vehicle routing problem. When choosing the path, the 2-opt method is used to explore the reasonable selection of the parameters of the algorithm for vehicle routing problem taking the path savings among customers as heuristic information. The performance of ant colony algorithm is affected by the information heuristic factor α, expectation heuristic factor β and pheromone volatile factor ρ. The method breaks through empirically setting the ant colony algorithm parameter values. By calculation, the optimal parameters of the ant colony algorithm in solving the vehicle routing problem are: α ε [1.0, 1.7], β ε [4.5, 8.5], ρ ε [0.5, 0.6]. At last, an exploration is established to find the optimal solution by combining three parameters and the ant colony algorithm will have a better effect in the actual optimisation problem.