A Compromise Decision Support Multi Objective Travelling Salesman Problem
T. Leelavathy1, K. Ganesan2
1T. Leelavathy, Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Katankulathur, Chennai, India.
2K. Ganesan*, Department of Mathematics, Faculty of Engineering and Technology, SRM Institute of Science and Technology, Katankulathur, Chennai, India.
Manuscript received on November 12, 2019. | Revised Manuscript received on November 24 2019. | Manuscript published on 30 November, 2019. | PP: 10259-10262 | Volume-8 Issue-4, November 2019. | Retrieval Number: D4501118419/2019©BEIESP | DOI: 10.35940/ijrte.D4501.118419
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© 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: The multi objective travelling salesman problem simultaneously optimizes several objectives. It is also called as shortest cyclic route model with multiple objectives provides the shortest route. In this article, the compromised decision support solutions are processed for a multi objective travelling salesman problem. The dynamic programming approach for optimal path with state space tree is used to get the shortest route for the objectives. Based on decision maker’s preference, the compromised solution for the multi objective travelling salesman problem is obtained. The proposed methodology is very simple and easy way to get the shortest route which is illustrated with an example.
Keywords: Multi Objective Travelling Salesman Problem; Dynamic Programming; Shortest Route; Preferred Solution.
Scope of the Article: Foundations Dynamics.