IJIEPR                   Back to the articles list | Back to browse issues page

XML Print

Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm
Ahmad Aliyari Boroujeni1 , Ameneh Khadivar 2
1- Department of Mathematics and Computer Science, Faculty of Sciences, University of Zanjan, Zanjan, IranDepartment of IT management, University of Alzahra, Tehran, Iran (Post-Doc)
2- Department of IT management, University of Alzahra, Tehran, Iran , a.khadivar@alzahra.ac.ir
Abstract:   (217 Views)
The Traveling Salesman Problem (TSP) is a well-known problem in optimization and graph theory, where finding the optimal solution has always been of significant interest. Optimal solutions to TSP can help reduce costs and increase efficiency across various fields. Heuristic algorithms are often employed to solve TSP, as they are more efficient than exact methods due to the complexity and large search space of the problem. In this study, meta-heuristic algorithms such as the Genetic Algorithm and the Teaching-Learning Based Optimization (TLBO) algorithm are used to solve the TSP. Additionally, a discrete mutation phase is introduced to the TLBO algorithm to enhance its performance in solving the TSP. The results indicate that, in testing two specific models of the TSP, the modified TLBO algorithm outperforms both the Genetic Algorithm and the standard TLBO algorithm in terms of convergence to the optimal solution and response time.
Keywords: Traveling Salesman problem, Modified Teaching-Learning Based, Optimization, Meta-heuristic algorithms, Graph theory
     
Type of Study: Research | Subject: Optimization Techniques
Received: 2024/09/9 | Accepted: 2025/04/15
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.