Performance Analysis of Classical Algorithms for the Traveling Salesman Problem
The Mindanawan Journal of Mathematics · 30.11.2024 · 6 (2) · 79
DOI: 10.62071/tmjm.v6i2.716 ↗Kurz gefasst
Fachartikel in der Zeitschrift The Mindanawan Journal of Mathematics, online erschienen am 30.11.2024. Verfasst von Rene Luna-Garcia und 2 weiteren Autor:innen.
Abstract (Originalsprache)
The Traveling Salesman Problem (TSP) is a fundamental optimization problem with wide-ranging applications in logistics, routing, and network design. This paper presents a comprehensive performance analysis of classical algorithms applied to solve the TSP, including exact methods like Brute Force and Dynamic Programming, and heuristic approaches such as Particle Swarm Optimization (PSO), Simulated Annealing (SA), Genetic Algorithms (GA), and k-Nearest Neighbors (KNN). The study evaluates these algorithms across multiple problem instances, varying in scale and complexity, to compare their solution quality, computational efficiency, and scalability.
Zitieren
APA
Luna-Garcia, R., Candano, T. M., & Caga-anan, R. (2024). Performance Analysis of Classical Algorithms for the Traveling Salesman Problem. The Mindanawan Journal of Mathematics, 6(2), 79. https://doi.org/10.62071/tmjm.v6i2.716
Vancouver
Luna-Garcia R, Candano TM, Caga-anan R. Performance Analysis of Classical Algorithms for the Traveling Salesman Problem. The Mindanawan Journal of Mathematics. 2024;6(2):79. doi:10.62071/tmjm.v6i2.716
BibTeX
@article{LunaGarcia2024,
author = {Luna-Garcia, Rene and Candano, Thricia Mae and Caga-anan, Randy},
title = {Performance Analysis of Classical Algorithms for the Traveling Salesman Problem},
journal = {The Mindanawan Journal of Mathematics},
year = {2024},
volume = {6},
number = {2},
pages = {79},
doi = {10.62071/tmjm.v6i2.716}
}
EUVIMED