2021
DOI: 10.30837/itssi.2021.15.069
|View full text |Cite
|
Sign up to set email alerts
|

Performance Analysis of Optimization Methods for Solving Traveling Salesman Problem

Abstract: The subject of this research is distance and time of several city tour problems which known as traveling salesman problem (tsp). The goal is to find out the gaps of distance and time between two types of optimization methods in traveling salesman problem: exact and approximate. Exact method yields optimal solution but spends more time when the number of cities is increasing and approximate method yields near optimal solution even optimal but spends less time than exact methods. The task in this study is to ide… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Comparing exact and approximate methods the conclusion is the exact method performs and has poor worst-case behavior [26]. The exact algorithm used is brute force and branch and bound, stating that branch and bound is the most efficient algorithm [27].…”
Section: Introductionmentioning
confidence: 99%
“…Comparing exact and approximate methods the conclusion is the exact method performs and has poor worst-case behavior [26]. The exact algorithm used is brute force and branch and bound, stating that branch and bound is the most efficient algorithm [27].…”
Section: Introductionmentioning
confidence: 99%