MULTIPERIOD MULTI TRAVELING SALESMEN PROBLEM UNDER TIME WINDOW CONSTRAINTS

34131

Traveling salesman problem is a classical optimization model that can be used to model various real life problems. In this study, multiple traveling salesman problem, which is a generalized version of the traveling salesman problem is modeled as a 0 – 1 integer programming approach under time window co nstraints. Different from the models existing in the literature, the number of salesmen is treated as a decision variable. Another new feature of the model is the addition of multiple periods which is especially important in the presence of time window constraints. Proposed model can be used to determine the minimum required number of university representatives that are assigned to cities throughout Turkey during the midterm, final and make-up exams of the faculties of Distance Education, Economics and Business Administration. Developed model is tested with various example problems with differing number of cities and different scenarios using integer programming approach. Based on the results obtained, the performance of the model is discussed.

113

Multiple travelling salesmen problem , Time windows , Integer programming.

Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering

123

Anadolu University Journal of Science and Technology. A : Applied Sciences and Engineering