Optimization of Minimum Spanning Tree and Traveling Salesman Problems Arising in a University Campus Network

The network problem of a university campus is investigated in this study. The facilities such as departments, administration buildings, dormitory and etc. on the network are considered as the nodes. The aims of this study are twofold: finding the shortest distance which visits all nodes and finding the minimum path which connects all nodes. To achieve the aforementioned goals, the problem is modeled as a traveling salesman problem (TSP) and minimum spanning tree (MST), respectively. Two different binary integer programming models are developed and applied to the case study of Gaziantep University campus network with 72 nodes. The results of the models provide the feasible route to visit all nodes and the feasible path which interconnects every node pair of.