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.

1.
Haider A.
Abdulkarim
and
Ibrahim F.
Alshammari
, "
Comparison of Algorithms for Solving Traveling Salesman Problem
",
International Journal of Engineering and Advanced Tecnnology (IJEAT)
. ISSN: , Volume-
4
Issue-
6
, August(
2015
).
2.
Cagla
Cergibozan
, "
Metaheuristic Solution Approaches for Traveling Salesman and Traveling Repairman Problems
", thesis, (
2013
)
IZMIR
.
3.
Yang
Shuai
,
Shao
Yunfeng
and
Zhang
Kai
, “
An effective method for solving multiple travelling salesman problem based on NSGA-II
”.
Systems Science & Control Engineering: an Open Access Journal
, Vol.
7
, No.
2
108
116
,(
2019
).
4.
Xiang
Z.
,
Chen
Z.
,
Gao
X.
,
Wang
X.
, Di F.,
Li
L.
,
Liu
G.
and
Zhang
Y.
, “
Solving Large-Scale TSP using a Fast Wedging Insertion Partitioning Approach
”,
Hindawi publishing Corporation, Mathematical Problems in Engineering
, Vol.
2015
, Article ID 854218, , (
2015
).
5.
Wolfgang
Garn
Balanced dynamic multiple travelling salesman: algorithms and continuous approximations
arXiv:2008.12063vl [math. OC] 27 Aug (
2020
).
6.
Barraq Subhi
Kaml
and
Mihamed Saad
Ibrahim
, “
Solving the Multi-Objective Travelling Salesman Problem with Real Data Application
”,
Journal of Al-Nahrain University
, Vol.
21
(
3
), September, DOI: , pp.
146
161
, (
2018
).
7.
Hoogeveen
H.
, "
Invited review of multicriteria scheduling
",
European Journal of Operational Research
167
,
592
623
(
2005
).
8.
Kolman
B.
, “
Introductory Linear Algebra with Applications
”,
Macmillan Publishing company
, 4th edition, (
1988
).
9.
Pineda
P.
, “Implementation and Solutions of the Traveling Salesman Problem (TSP) in R”, In
Partial Fulfillment of State 4395-Senior Project, Department of Mathematics and Statistics
,
Spring
, (
2017
).
10.
Faez H.
Ali
and
Sajad M.
Mohammed
, “
New Improved Heuristic Method for Solving Travelling Salesman Problem
”,
Iraqi Journal of Science
, Vol.
59
, No.
4C
, pp:
2289
2300
, DOI: , (
2018
).
This content is only available via PDF.
You do not currently have access to this content.