SOLVING THE TRAVELING SALESMAN PROBLEM USING THE META-HEURISTIC SEARCH TABOO IN MATLAB
MATLAB®, metaheuristics, Tabu Search, programming
This work presents the Traveling Salesman Problem (PCV) and a methodology to solve it, which is the Tabu Search (BT) meta-heuristic, as a mathematical strategy and the MATLAB® programming software as a tool to implement this solution. Thus, the following question arises: how to use BT metaheuristics and MATLAB® software to solve PCV? A secondary question is how to approach teaching computer programming in high school classes? Thus, the general objective is to solve the PCV and, as a specific objective, to reflect the importance of the subject of computer programming for high school students. As research methodology, some books and internet sites were read and the software MATLAB® and GNU-OCTAVE were used to compare the results. As a result, the PCV solution in the two proposed softwares and a discussion on the teaching of computer programming in mathematics classes as a stimulus to the student.