جلد ۳۶، شماره ۲ - ( ۳-۱۴۰۴ )                   جلد ۳۶ شماره ۲ صفحات ۱۸۴-۱۷۰ | برگشت به فهرست نسخه ها


XML English Abstract Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Aliyari Boroujeni A, Khadivar A. Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm. IJIEPR 2025; 36 (2) :170-184
URL: http://ijiepr.iust.ac.ir/article-1-2111-fa.html
Solving the Traveling Salesman Problem Using a Modified Teaching-Learning Based Optimization Algorithm. نشریه بین المللی مهندسی صنایع و تحقیقات تولید. ۱۴۰۴; ۳۶ (۲) :۱۷۰-۱۸۴

URL: http://ijiepr.iust.ac.ir/article-۱-۲۱۱۱-fa.html


چکیده:   (۴۰۸ مشاهده)
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.
     
نوع مطالعه: پژوهشي | موضوع مقاله: Optimization Techniques
دریافت: 1403/6/19 | پذیرش: 1404/1/26 | انتشار: 1404/4/9

ارسال نظر درباره این مقاله : نام کاربری یا پست الکترونیک شما:
CAPTCHA

بازنشر اطلاعات
Creative Commons License این مقاله تحت شرایط Creative Commons Attribution-NonCommercial 4.0 International License قابل بازنشر است.

کلیه حقوق این وب سایت متعلق به نشریه بین المللی مهندسی صنایع و تحقیقات تولید می باشد.

طراحی و برنامه نویسی : یکتاوب افزار شرق

© 2025 CC BY-NC 4.0 | International Journal of Industrial Engineering & Production Research

Designed & Developed by : Yektaweb