Kernel Search for the Capacitated Vehicle Routing Problem
Zuzana Borčinová
Abstract
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics. We present a matheuristic method for CVRP that adopts the main idea of the Kernel Search algorithm (KS) based on decomposing the original problem into sub-problems that are easier to solve. Unlike the original scheme of KS, our approach uses the Clarke–Wright savings algorithm to construct a sequence of smaller sub-problems, which are subsequently solved using mathematical programming strategies. The computational experiments performed on a set of benchmark instances showed that the proposed matheuristics achieves good results in acceptable computational time.