Optimal path selection for logistics transportation based on an improved ant colony algorithm
by Xiangqian Wang; Huizong Li; Jie Yang; Chaoyu Yang; Haixia Gui
International Journal of Embedded Systems (IJES), Vol. 13, No. 2, 2020

Abstract: The ant colony algorithm, as a heuristic intelligent optimisation algorithm, has succeeded in solving many real-world problems, such as the vehicle routing. However, the traditional ant colony algorithm has suffered from several shortcomings, including the premature stagnation and slow convergence. To address these issues, an improved ant colony algorithm is proposed in this paper. The main contribution is to adaptively adjust key parameters during the evolution. Later the proposed algorithm is validated by addressing the vehicle routing problem. Two real-world datasets are collected from two logistic enterprises separately (i.e., YUNDA and YTO) based in Huainan City, China. Comprehensive experiments have been performed by applying the proposed algorithm to search for the optimal path. Meanwhile, the comparison between the traditional ant colony algorithm and the improved algorithm has been conducted accordingly. Experimental result shows that the proposed algorithm achieves better performance in minimising routing path and reducing the computational cost.

Online publication date: Wed, 05-Aug-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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 subs@inderscience.com