A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Travel salesman problem (TSP) considered as one of the most important complex optimization problem. The complexity of TSP is due to many reasons, like different types of TSP, the number of visited cities, and the absence of real optimal solution to it. Many intelligent algorithms were proposed and enhanced to solve TSP, but none of them gave the real optimal solution; some solutions were close to the optimal solutions but with special conditions. In our research we reviewed related publisheddoi:10.5281/zenodo.4785093 fatcat:s62cji4vvfdwdnrolrrbb75t5m