What is it about?

Finding the shortest route to visit an amount of cities and return to the starting city is called the Travelling Salesman Problem (TSP). It is an combinatorial optimization problem. It can be stated as follows "Finding the shortest route for a salesman starting on a given city, visiting each of a specified group of cities, and returning to the original point of departure".

Featured Image

Read the Original

This page is a summary of: Application of Fuzzy Sets for the Improvement of Routing Optimization Heuristic Algorithms, Transport and Telecommunication Journal, January 2016, De Gruyter,
DOI: 10.1515/ttj-2016-0031.
You can read the full text:

Read

Contributors

The following have contributed to this page