Algorithm for Multi- objective Traveling Salesman Problems based on Modified Transitive closure
T. Karthy1, K. Ganesan2
1T. Karthy, Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur, Chennai, India.
2K. Ganesan*, Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Kattankulathur,Chennai, India.
Manuscript received on November 22, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 2576-2581 | Volume-9 Issue-2, December, 2019. | Retrieval Number: B3940129219/2019©BEIESP | DOI: 10.35940/ijeat.B3940.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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 MOTSP.
Keywords: Traveling salesman problem, Route Conditions, modified transitive closure method, Genetic Algorithm.