Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Aliyari Boroujeni Ahmad; Khadivar Ameneh

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2025 | Volume:36 | Issue:2 Page(s): 170-184

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm

Author(s)

Aliyari Boroujeni Ahmad | Khadivar Ameneh | Issue Writer Certificate

Keywords

Traveling Salesman problem

Modified Teaching-Learning Based

Optimization

Meta-heuristic algorithms

Graph theory

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans