Vehicle routing problem solution with integer linear programming and an application in a service network

Nowadays, logistic management is one of the processes that companies take into account when they perform their production / service activities, or where they face problems. Vehicle Routing Problem is one of the most common problem types in logistics management which has a wide variety in the literature and which varies according to the problem type. In this thesis, the Vehicle Routing Problem, its applications in the literature and VRP solution methods are mentioned in general and an application for a company in Ankara which provides shuttle service for the stuff is discussed. The company has 37 employees in three main districts with three vehicles at certain stops and leaves them at the stops after work. In this study, which is considered as Closed End Vehicle Routing Problem due to moving of the vehicles from the company and returning to the company, LINGO 18.0 program has been solved by using Integer Linear Programming method. The total distance calculated by changing the total distance of the routes formed according to the change in vehicle capacity and the total length of the route were calculated. The average time spent in the service of the personnel was calculated and the solution was analyzed.