Open AccessAlgorithm for Multi- objective Traveling Salesman Problems based on Modified Transitive closure
Author(s) -
T. Karthy,
K. Ganesan
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.b3940.129219
Subject(s) - travelling salesman problem , transitive closure , closure (psychology) , mathematical optimization , genetic algorithm , algorithm , mathematics , transitive relation , computer science , combinatorics , economics , market economy
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