Akademik Veri Yönetim Sistemi
International Izmir Democracy University Engineering Symposium, İzmir, Türkiye, 28 Kasım 2024, ss.51, (Özet Bildiri)
The Travelling Repairman Problem (TRP) involves optimizing the routes that one or more repairmen
must follow to fulfill the service requests of specific customers. Various solution methods have been developed in the literature, considering different objectives such as profit maximization, cost minimization, and particularly the minimization of customer waiting times to enhance customer satisfaction. There are several fundamental assumptions for the classic TRP: each customer’s service request must be fulfilled by a repairman, and the repairmen typically start from a designated starting
point. This study addresses the Multiple Travelling Repairman Problem (MTRP), an extension of the
TRP, with the goal of minimizing total customer waiting times. Mixed-integer linear programming and constraint programming models have been developed to solve the problem. These mathematical models aim to determine the repairmen’s routes while taking into account customer service times and time window constraints. The models were tested on various instances, and the results were analyzed
to evaluate their efficiency and solution quality. It was shown that the constraint programming model provided higher-quality solutions with shorter computation times compared to the mixed-integer linear programming model.