Optimization application of vehicle routing problem with time windows in automation company

Vehicle Routing Problem with the Time Windows aims to find minumum route distance in accordance with the given earliest and latest finish times. VRPTW is the problem of finding the route with the minumum distance and determining the customer order of the vehicles visiting the routes by considering the service times and time windows. The aim of this study is to create an optimization model for an automation company who provides installation and after sale services in Ankara. Also, to develop it in line with the needs of the company. The main goal of the work is to satisfy each customer's demand in accordance with the time windows and to minimize the cost/distance of the company's vehicles. In order to do that model have been constructed with these time constraints and run many different scenarios with real customer's data. As a result, a new scenario has been created thus the company is able to direct their team for failure analysis demand. This study will contribute to the literature as it is a study that has not been discussed in the automation sector before. In the scope of the study, mixed integer linear programming was used and the model was solved with MATLAB. It was examined with different customer data whether the model reflects real life problem and it was ready for the use of the company.