Abstract
Abstract In this study, the well-known traveling salesman problem (TSP) with relational optimization problem is defined as a method of solution used in genetic algorithms (GA). TSP is a problem about finding the shortest route starting from one city and turning back to the same city while considering only one pass through each city (points, nodes or components) where the distances between each city are known. In this study, the GA based method is developed for solving the travelling salesman problem, and applied to the problem of finding the optimal route for Istanbul Electricity Tram and Tunnel Operations (IETT) audit team which provides public transport services in Istanbul
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
