Optimisation and application research of ant colony algorithm in vehicle routing problem Online publication date: Tue, 13-Apr-2021
by Lede Niu; Liran Xiong
International Journal of Computing Science and Mathematics (IJCSM), Vol. 13, No. 2, 2021
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.
Online publication date: Tue, 13-Apr-2021
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com