Combinatorial problem optimization using TLBO
Sahil Saharan, J. S. Lather, Ramaswamy Radhakrishnan · 2017
Travelling Salesman Problem(TSP) is an NP hard problem, which has been addressed via several heuristic algorithms like genetic algorithms (GA) etc. The paper presents TSP solution using Teaching Learning Based optimization(TLBO) which includes many similarities like the other nature-inspired algorithms. In addition, the strategy adds an auxiliary operator to regulate the sequence of array elements in mutation process with partial-mapped crossover used over the selected candidates of the population. Experimental study shows that introduced strategy can provide better convergence. The prominent feature of the strategy is in its stability and superior ways to handle computational complexity while dealing with TSP optimization as compared to GA.