Optimization of Transport Routes Through a Social Interaction Algorithm-Based Application
摘要
In this paper, we present a prototype application designed to solve the Traveling Salesman Problem (TSP). This application allows for obtaining high-quality solutions within reasonable time frames using bio-inspired algorithms, specifically variants of Ant Systems such as Ant Colony System, Max-Min Ant System and Best-Worst Ant System. We will review the operation of each of these algorithms and apply them interactively to solve TSP instances. These algorithms will be compared with the deterministic Lin-Kernighan algorithm to demonstrate their effectiveness.