Key points are not available for this paper at this time.
In this paper we will suggest to discuss Multi-Criteria Travelling Salesman Problem (MCTSP) with two criteria; distance and time. And we investigate new exact and heuristic methods for solving MCTSP. In the theoretical part from this paper, we discussed the mathematical formulation of the discussed problem. While in the practical part we will propose the Branch and Bound method, as an exact method with new upper and lower bounds, which is solving MCTSP for n ≤ 40 in reasonable time. While for heuristic methods, we propose four methods which are gave good results comparing with the exact methods. These results prove the efficiency of these methods for solving MCTSP.
Ahmed et al. (Sun,) studied this question.