Construction and improvement heuristics applied to the capacitated vehicle routing problem

The capacitated vehicle routing is a combinatorial optimization problem of that has aroused major interest because it is present in critical areas (logistics, transport and other) and it is a problem of considerable difficulty. There are currently several techniques that have been developed to try to solve this problem efficiently. In this paper, we present a solution to this problem based on the strategy of different single techniques combination to obtain the best results. Computing experiments have been conducted on six instances of well-known data sets available in literature.