Forensic-Based Investigation Optimization to Solving Traveling Salesman Problem
DOI:
https://doi.org/10.33557/33050y35Keywords:
FBI Optimization, Metaheuristic, Traveling Salesman ProblemAbstract
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
References
[2] R. Matai, S. Singh, and M. L. Mittal, “Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches,” in Traveling Salesman Problem, D. Davendra, Ed., Rijeka: IntechOpen, 2010, p. Ch. 1. doi: 10.5772/12909.
[3] G. Dantzig, R. Fulkerson, and S. Johnson, “Solution of a Large-Scale Traveling-Salesman Problem,” Journal of the Operations Research Society of America, vol. 2, no. 4, pp. 393–410, 1954, [Online]. Available: http://www.jstor.org/stable/166695
[4] A. H. Land and A. G. Doig, “An Automatic Method of Solving Discrete Programming Problems,” Econometrica, vol. 28, no. 3, pp. 497–520, 1960, doi: 10.2307/1910129.
[5] J. E. Mitchell, “Branch-and-Cut Algorithms for Combinatorial Optimization Problems,” in Handbook of Applied Optimization, P. M. Pardalos and M. G. C. Resende, Eds., New York: Oxford University Press, 2002, pp. 65–77.
[6] E. Horowitz and S. Rajasekaran, Computer Algorithms, 1st ed. New York: W.H. Freeman, 1997.
[7] K. Braekers, K. Ramaekers, and I. Van Nieuwenhuyse, “The vehicle routing problem: State of the art classification and review,” Comput Ind Eng, vol. 99, pp. 300–313, 2016, doi: https://doi.org/10.1016/j.cie.2015.12.007.
[8] W. Yang, L. Deng, Q. Niu, and M. Fei, “Improved Shuffled Frog Leaping Algorithm for Solving Multi-aisle Automated Warehouse Scheduling Optimization,” in AsiaSim 2013, G. Tan, G. K. Yeo, S. J. Turner, and Y. M. Teo, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp. 82–92.
[9] L. Li, Y. Cheng, L. Tan, and B. Niu, “A Discrete Artificial Bee Colony Algorithm for TSP Problem,” in Bio-Inspired Computing and Applications, D.-S. Huang, Y. Gan, P. Premaratne, and K. Han, Eds., Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 566–573.
[10] G. Reinelt, “Discrete and Combinatorial Optimization,” http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/tsp.
Downloads
Published
Issue
Section
License
Jurnal Tekno by journal.binadarma.ac.id/index.php/jurnaltekno is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
