HMFA :A Hybrid Mutation-base Firefly Algorithm For Travelling Salesman Problem
سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 416
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
CITCOMP02_492
تاریخ نمایه سازی: 7 اسفند 1396
چکیده مقاله:
The Travelling Salesman Problem (TSP) is one of the major problems in graph theory and also is NP-Hard Problem. In this work, by improving the firefly algorithm (MFA), we introduced a new method for solving TSP. The result of the proposed method has compared with the other algorithms such as Firefly algorithm, GA and PSO. The Proposed Method out performs of other algorithms.
کلیدواژه ها:
NP-Hard problem ، Travelling Salesman Problem (TSP) ، Firefly algorithm (FA) ، Swapping mutation ، Inversion mutation ، Insertion mutation ، 2-Opt Mutation
نویسندگان
Mohammad Saraei
Department of Computer, Faculty of Technical, Arak Branch, Islamic Azad University, Arak, Iran.Young Researchers and Elite Club, Arak Branch, Islamic Azad University, Arak, Iran.
parvaneh mansouri
Department of Computer, Faculty of Technical, Arak Branch, Islamic Azad University, Arak, Iran/Department of Computer Science, Delhi University, Delhi, India