A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning

A compressor manufacturer producing in Kocaeli/Dilovasi 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 approach the issue as a multi-depot vehicle routing problem with time windows (MDVRPTW) and construct a mixed-integer linear programming framework. The solution is deemed adequate in resolving the company's service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.