Özet:

In The Vehicle Routing Problem (VRP) can be described as the delivery or collection of goods from one or several depots to a set of customers. The problem is typically focused on the efficient use of a fleet of capacitated vehicles that must make a number of stops to serve a set of customers so as to minimize cost, subject to vehicle capacity constraint and service time restrictions imposed at the customer locations. VRP has been one of the most interesting and challenging problem in the literature, interesting in the sense that it is easy to describe yet difficult to solve and challenging considering that many approaches have been tried yet not even one exact approach which can solve all real-life VRP to optimality. VRP is an important distribution management problem that can be used to model many real-life systems. Some specific applications include school bus distribution, delivery of fuel, mail and newspapers, retail distribution, waste collection. The VRP has many variants which are not only of mathematical importance; most of them find application in reallife. This encourages researchers to design an algorithm which can produce an economically viable answer in a practical time frame. In this study exact and heuristic models for VRP are explained.