Optimasi Distribusi Guru Berdasarkan Traveling Salesman Problem (TSP)

Abstract

The unequal distribution of teachers in urban and rural areas makes the quality of education unequal. This obliges the central government to make changes for the better and more beneficial to the world of education through the 5 ministerial regulations (SKB 5 ministers). So far, these regulations have not worked as expected. Numerous obstacles to the reorganization or redistribution of teachers prevented the regulation from working. The genetic algorithm in the Traveling Salesman Problem (TSP) can be used to optimize the allocation of teachers. The concept is a heuristic search algorithm based on the mechanism of biological evolution. Diversity in biological evolution is the variation of chromosomes within individual organisms. This chromosome variation will affect the rate of reproduction and the level of the body's ability to stay alive. While the TSP concept is a search for a sequence of all locations (cities) to select locations that have not been selected one by one so that a complete tour route is generated from the original location, then visits all the other locations exactly once, and eventually returns to the original location. In this case, the city is assimilated to a school, while the distributed goods are assimilated to transferred teachers. Thus, TSP can optimize the distribution of teachers from schools with excess teachers to schools with teacher shortages.