Comparation of Heuristic Constructing Algorithms Based on Sweep algorithm
Yaohua Wu · Logistics Technology · 2011
Based on the first phase solution of the sweep algorithm for the vehicle routing problem(VRP),three heuristic algorithms,namely the Nearest Insertion algorithm,Connex Hull Insertion algorithm and Farthest Insertion algorithm,are used to solve the phase two of the problem.After simulation experiment,the comparison results are obtained from two aspects: total distance and computation runtime.The result obtained shows that for VRPs already clustered through the sweep algorithm,Connex Hull Insertion algorithm is the most effective in the aspect of total distance although it has more runtime than the other two methods.Farthest Insertion algorithm and Nearest Insertion algorithm have no significant differences in runtime,but the former is superior in total distance.