Int J Performability Eng ›› 2017, Vol. 13 ›› Issue (6): 975-984.doi: 10.23940/ijpe.17.06.p18.975984

• Original articles • Previous Articles     Next Articles

Time Probabilistic Vehicle Optimal Route using Ant Colony Algorithm

Ming Fua, Jian Zhoua, *, and Lifang Wangb   

  1. aSchool of management science and engineering, Anhui University of Finance&Economics, Bengbu 233030, Anhui, China
    bSchool of international trade and economics, Anhui University of Finance&Economics, Bengbu 233030, Anhui, China

Abstract: Vehicle routing problem is one of hot issues in the past decade; the paper proposes an important variant of vehicle routing problem, which we name time probabilistic vehicle routing problem. We find the time spent on the road from point A to point B always changes because of dynamic road condition, dynamic weather et al. However, the probability is certain that the vehicle can travel from point A to Point B within certain time intervals. Ant colony algorithm is an efficient distributed algorithm, and has been widely used in various fields. The ant colony algorithm is introduced to obtain the optimal solution by observing the characteristics of the problem. The Ants also search for the next transfer node according to probability in ant colony algorithm. Ant colony algorithm can solve this kind of problem effectively.

Submitted on April 29, 2017; Revised on August 12, 2017; Accepted on September 23, 2017
References: 13