Title: Optimal path selection for logistics transportation based on an improved ant colony algorithm

Authors: Xiangqian Wang; Huizong Li; Jie Yang; Chaoyu Yang; Haixia Gui

Addresses: School of Economic and Management, Anhui University of Science and Technology, Huainan 232001, China ' School of Economic and Management, Anhui University of Science and Technology, Huainan 232001, China ' School of Computing and Information Technology, University of Wollongong, NSW 2522, Australia ' School of Economic and Management, Anhui University of Science and Technology, Huainan 232001, China ' School of Economic and Management, Anhui University of Science and Technology, Huainan 232001, China

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.

Keywords: ant colony algorithm; optimal path; logistics transportation; vehicle routing.

DOI: 10.1504/IJES.2020.108869

International Journal of Embedded Systems, 2020 Vol.13 No.2, pp.200 - 208

Received: 18 Mar 2019
Accepted: 06 May 2019
Published online: 05 Aug 2020 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article