Özet:

The cost of routing vehicles represents an important component of many transportation and distribution costs in a logistics system. The typical vehicle routing problem involves in designing a set of minimumcost routes for a fleet of vehicle. The vehicle routing problem with time windows is a generalization of the vehicle routing problem where the service of a customer can begin within the time window defined by the earliest and the latest times when the customer will permit the start of service. In this study, The Vehicle Routing problem that root of the logistic systems is handled as Time Window Vehicle Routing Problem to obtain the routes of the vehicles that are used by the Arçelik Authorized Service. These vehicles distribute the products which were sold to Sincan and Etimesgut Regions in Ankara. Recommended model was structured and solved with real datas using Mix Integer Programming. With respect to the results the improvings are shown and the optimal routes are obtained. By the matematical model, the customers’ demands, that authorized service provided with 761.399 km, could be also provided. The situation which the total distance could be reduced as 67.90% was demonstrated. The routes which could be provided on time and costed minimum was revealed