Özet:

The vehicle routing problem is a popular NP-Hard class combinatorial optimization problem. Some constraints as capacity and time can be added to the problem to make it compatible with the real life application. It is very difficult to solve this problem for large real-life data sets in polynomial time using exact solution methods. The exact solution methods can solve only small instances of the problem. Because of this feature, to get near optimal solutions in acceptable CPU times, heuristics and metaheuristcs methods are widely used in recent years. A great many of heuristics methods have been proposed in the literature for solving Capacitated Vehicle Routing Problem by this time. In this paper, we have conducted a literature review about metaheuristcs and their application to the capacitated vehicle routing problem

Anahtar Kelimeler: