A Hybrid Shuffled Frog Leaping Algorithm for Solvingthe Symmetric Traveling Salesman Problem

Publish Year: 1393
نوع سند: مقاله کنفرانسی
زبان: English
View: 535

This Paper With 5 Page And PDF Format Ready To Download

  • Certificate
  • من نویسنده این مقاله هستم

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این Paper:

شناسه ملی سند علمی:

ICEES01_245

تاریخ نمایه سازی: 16 اسفند 1394

Abstract:

In this paper we propose a hybrid shuffled frogleaping algorithm for solving symmetric travelling salesmanproblem. The hybrid shuffled frog leaping is obtained bycombination of shuffled frog leaping and a local search methodin a hybridizing strategy. The obtained solutions of proposedalgorithm are compared with the solutions obtained by hybridgenetic algorithm. The obtained results demonstrate thathybridizing can considerably improve the performance ofunique algorithms. Also the different versions of shuffled frogleaping algorithms have a better performance then their geneticalgorithm competitors

Authors

Morteza Alinia Ahandani

Department of electrical engineering, Islamic AzadUniversity, Langaroud branch, Langaroud, IranYoung Researchers and Elite Club, Langaroud Branch,Islamic Azad University, Langaroud, Iran

Hosein Alavi-Rad

Department of electrical engineering, Islamic AzadUniversity, Langaroud branch, Langaroud, IranYoung Researchers and Elite Club, Langaroud Branch,Islamic Azad University, Langaroud, Iran