A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
One of the challenging facts of the Multi Objective Traveling Salesman Problem (MOTSP) is to find the best compromised solution. In this paper, we have proposed a modified transitive closure algorithm to solve MOTSP using Genetic Algorithm (GA). Modified Transitive Closure method generates all the initial solutions of each objective. By applying Genetic Algorithm (GA), compromised solutions are obtained. Numerical examples are provided to show the efficiency of the proposed algorithm for MOTSPdoi:10.35940/ijeat.b3940.129219 fatcat:4l5nz4wvgve2vevl32tee6wspa