Journal of Northeastern University ›› 2012, Vol. 33 ›› Issue (9): 1240-1243+1252.DOI: -

• OriginalPaper • Previous Articles     Next Articles

Logistics routing optimization based on improved ant colony algorithm

Xu, Jiu-Qiang (1); Xing, Pei-Long (1); Kong, Qiu-Shi (1); Liu, Da-Peng (1)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Online:2012-09-15 Published:2013-04-04
  • Contact: Xu, J.-Q.
  • About author:-
  • Supported by:
    -

Abstract: Due to computation complexity, lower accuracy and premature convergence of the conventional algorithm, the ant colony algorithm was improved to solve the routing problem of logistics. In order to eliminate the problems that ant colony algorithm is easy to be stagnant and its convergence is slow, the algorithm was improved including the following points such as the transfer strategies of the ants, the pheromone update method and the integration of genetic algorithm. To solve the path optimization of simultaneous delivery and pickup, the heuristic function was added and the transfer strategies were designed, which made the algorithm conduct a search by considering a combination of factors reasonably, and could find the next right point more comprehensively and more accurately, then, a better path could be gotten.

CLC Number: