Abstract
There are two major optimization methods: Exact and Approximate methods. A well known exact method, Branch and Bound algorithm (B&B) and approximate methods, Elimination-based Fruit Fly Optimization Algorithm (EFOA) and Artificial Atom Algorithm (A3) are used for solving the Traveling Salesman Problem (TSP). For 56 destinations, the results of total distance, processing time, and the deviation between exact and approximate method will be compared where the distance between two destinations is a Euclidean distance and this study shows that the distance of B&B is 270 , EFOA is 270 and A3 is 288.38 which deviates 6.81%. For time processing aspect, B&B needs 12.5 days to process, EFOA needs 36.59 seconds, A3 needs 35.34 seconds. But for 29 destinations, exact method is more powerful than approximate method.
Publisher
Universidad Catolica Luis Amigo
Reference22 articles.
1. M. Gierszewski, and A. Kozlak, "The Impact of Congestion on The Cost of Public Transport in Starogard Gdanski", Transport Economics and Logistics, vol. 84, pp. 7-18, 2019. https://doi.org/10.26881/etil.2019.84.01
2. L. Kavka, I. Dockalikova, Z. Cujan, and G. Fedorko, "Technological and Economic Analysis in Interior Parts Manufacturing", Advances in Science and Technology Research Journal, vol. 14, no. 3, pp. 204-212, 2020. https://doi.org/10.12913/22998624/122062
3. F. Jorgensen, and J. Preston, "The Relationship between Fare and Travel Distance", Journal of Transport Economics and Policy, vol. 41, no. 3, pp. 451-468, 2007.
4. P. Rietveld, B. Zwart, B. van Wee, and T. van den Horn, "On the Relationship between Travel Time and Travel Distance of Commuters", European Congress of the Regional Science Association. Zurich, 2016.
5. J. D. Little, K. G. Murty, and D. W. Sweeney, "An Algorithm for the Traveling Salesman Problem", Operations Research vol. 11, no. 6, pp. 972-989, 1963. https://doi.org/10.1287/opre.11.6.972