A Compromise Decision Support Multi Objective Travelling Salesman Problem

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.