Özet:

The route planning of service vehicles is an important issue for large-scale enterprises which have hundreds of employee. Especially for the flexible shift system which brings about uncertainty for the drivers, the route plans have to be formed daily by the managers. This study addresses the route optimization problem of an automotive company which aims to minimize total transportation cost of the service fleet and proposes a mixed integer mathematical model to solve problem. The objective of the mathematical model is to minimize fixed and transportation cost of the fleet by considering vehicle capacities and travelling time constraints. The mathematical model is tested on a randomly generated problem set which consist of different sized instances for homogeneous service fleet. The computational results obtained by the Gurobi solver show that the proposed mathematical model is capable to find route plans for the real-life service vehicles routing decisions that can minimize total transportation cost of the fleet.  

Anahtar Kelimeler: