Having the best solution for Vehicle Routing Problem (VRP) is still in demand. Beside, Cuckoo Search (CS) is a popular metaheuristic based on the reproductive strategy of the Cuckoo species and has been successfully applied in various optimizations, including Capacitated Vehicle Routing Problem (CVRP). Although CS and hybrid CS have been proposed for CVRP, the performance of CS is far from the state-of-art. Therefore, this study proposes a hybrid CS with Simulated Annealing (SA) algorithm for the CVRP, consisting of three improvements—the investigation of 12 neighborhood structures, three selections strategy and hybrid it with SA. The experiment was conducted using 16 instances of the Augerat benchmark dataset. The results show that 6 out of 12 neighborhood structures were the best and the disruptive selection strategy is the best strategy. The experiments’ results showed that the proposed method could find optimal and near-optimal solutions compared with state-of-the-art algorithms.
Cuckoo search via Lévy flights for the capacitated vehicle routing problem
