A Heuristics for Vehicle Routing Problem of Large -scale Logistics Systems
Xing Liu · Chinese Agricultural Mechanization · 2008
A hybrid heuristics based on sweep clustering and tabu search (STH) is proposed for the large-scale vehicle routing problem (LSVRP). In the STH, all customers being clustered into several zones, within each of which a vehicle routing is constructed and optimized, then every two adjacent zones are combined as a whole to optimise. The clustering simplifies the large-scale problem into several small-scale problems that can be computed respectively; the combination of every two adjacent zones improves the global search capability of the heuristic. Computation results show the heuristics is a very effective heuristics for the LSVRP.