A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
A hybrid heuristic ant colony algorithm is proposed and applied to solving the two echelon vehicle routing problem, which combines three heuristic or meta-heuristics. The problem is divided into m+1 CVRP by a separation strategy (distance-based cluster). Then better feasible solutions are built by an improve ant colony optimization with multiple neighborhood descent (IACO_MND), which is taken as the initial solution of the threshold-based local search procedure, two different neighborhooddoi:10.1016/j.proeng.2011.08.630 fatcat:zxetajgxsfatzi7qigh46hmtxu