Optimization of Routes for Covered Walkways at University Campus by Kruskal Algorithm

The adverse weather conditions affect the mobility in the open spaces at university campus due the difficulty to walk in sunny or runny days. This paper describes the process to define the routes to be covered at university campus, the selection of the routes is based on the necessity of those could connect all the dependencies with minimum total distance. Kruskal algorithm was used to obtain the routes that ensure minimum total distance to be covered and the intercommunication directly or indirectly between the 22 nodes around the campus which represents all campus dependencies. Finally, a mathematical model of binary integer linear programming was formulated basis on the solution obtained by Kruskal algorithm. The solution shows as result 271.38 m of walkways to be covered that was obtained after 12 interactions of Kruskal algorithm.