Solving CVRP via Rank Based ACS

In this paper we consider the Capacitated Vehicle Routing Problem (CVRP). Our solving strategy is based on a combination of ACS and ASrank, which we call Rank-Based ACS (ACSrank). Computational results show that the algorithm is competitive with other ACO algorithms and Simulated Annealing (SA).

کلیدواژه ها:

CVRP ، ACS ، ASrank ، Local search ، Saving heuristics