Günlük planlı bakım ve onarım planlaması için zaman pencereli çok depolu araç rotalama problemi

A compressor manufacturer producing in Kocaeli/Dilovası region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The service types and times are agreed upon with the customer before service planning. The vehicles and their respective operators for a given planning day are known, with the service personnel's starting and ending points being the residences. All the planned services must be satisfied in the time windows customers give. We deal the issue as a multi-depot vehicle routing problem with time windows (MDVRPTW) and construct a mixed-integer linear programming framework. The mathematical model solution is sufficient to solve the company's 3.000-6.000 maintenance demand problems. A clustering heuristic that provides a good solution in a short time has been developed to solve large instances of malfunction and part replacement requests coming to the vehicle routing and after-sales service side.