<![CDATA[The FBI Optimization (FBIO) represents one of the most novel metaheuristics which has been experimented with to solve Traveling Salesman Problem (TSP), demonstrating superior performance compared to tradition-al algorithms. Unlike conventional approaches that start with exploration and gradually shift to exploitation, FBIO maintains a dominant exploration phase throughout its iterations. Beginning with 100% exploration and tapering to approximately 90% dominance in exploration by the end of the process, FBIO effectively navigates the solution space, uncovering more promising routes. This exploration-centric approach enables FBIO to achieve solutions that are 8.39% closer to the near-optimal result compared to its counterparts. The algorithm’s enhanced performance in TSP highlights its potential applicability to other combinatorial optimization challenges. By prioritizing exploration, FBIO offers a robust framework for addressing complex prob-lems and ensures a comprehensive search of the solution space. Its ability to deliver high quality near-optimal solutions makes FBIO a valuable tool for future research, presenting new opportunities for solving various optimization problems and advancing practical problem-solving methodologies]]>
Copyrights © 2025
