Shuffled Frog Leaping Algorithm and its Application to
Traveling Salesman Problem Transportation services and costs of these services holds an important place for most of organizations. Whenever a transportation activity is conducted, choosing the shortest of the routes is cruical because of the transportation cost and time efficiency benefits. Heuristic algorithms are developed for computationally hard-to-solve traveling salesman problem, which provides near-optimal solutions in acceptable time ranges, besides exact algorithms. In this research, a relatively new heuristic algorithm named shuffled frog leaping algorithm is studied and traveling salesman problem is used as the subject to the application. A customized model of shuffled frog leaping algorithm which aims to minimize the tour length for the traveling salesman problem is created within this study. An application for this model is prepared as a computer program using C++ programming language. A number of tests are executed for this shuffled frog leaping algorithm application and notable results are obtained.
