PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM

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 o...

Full description

Saved in:
Bibliographic Details
Published in:Sučasnij stan naukovih doslìdženʹ ta tehnologìj v promislovostì (Online) no. 1 (15); pp. 69 - 75
Main Authors: Agung, Chandra, Christine, Natalia
Format: Journal Article
Language:English
Published: Kharkiv National University of Radio Electronics 31.03.2021
Subjects:
approximate methods
exact method
gaps
optimization method
traveling salesman problem
ISSN:2522-9818, 2524-2296
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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 identify and formulate each algorithm for each method, then to run each algorithm with the same input and to get the research output: total distance, and the last to compare both methods: advantage and limitation.  Methods used are Brute Force (BF) and Branch and Bound (B&B) algorithms which are categorized as exact methods are compared with Artificial Bee Colony (ABC), Tabu Search (TS) and Simulated Annealing (SA) algorithms which are categorized as approximate methods or known as a heuristics method. These three approximate methods are chosen because they are effective algorithms, easy to implement and provide good solutions for combinatorial optimization problems. Exact and approximate algorithms are tested in several sizes of city tour problems: 6, 9, 10, 16, 17, 25, 42, and 58 cities. 17, 42 and 58 cities are derived from tsplib: a library of sample instances for tsp; and others are taken from big cities in Java (West, Central, East) island. All of the algorithms are run by MATLAB program. The results show that exact method is better in time performance for problem size less than 25 cities and both exact and approximate methods yield optimal solution. For problem sizes that have more than 25 cities, approximate method – Artificial Bee Colony (ABC) yields better time which is approximately 37% less than exact and deviates 0.0197% for distance from exact method. The conclusion is to apply exact method for problem size that is less than 25 cities and approximate method for problem size that is more than 25 cities. The gap of time will be increasing between two methods when sample size becomes larger.
AbstractList 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 identify and formulate each algorithm for each method, then to run each algorithm with the same input and to get the research output: total distance, and the last to compare both methods: advantage and limitation.  Methods used are Brute Force (BF) and Branch and Bound (B&B) algorithms which are categorized as exact methods are compared with Artificial Bee Colony (ABC), Tabu Search (TS) and Simulated Annealing (SA) algorithms which are categorized as approximate methods or known as a heuristics method. These three approximate methods are chosen because they are effective algorithms, easy to implement and provide good solutions for combinatorial optimization problems. Exact and approximate algorithms are tested in several sizes of city tour problems: 6, 9, 10, 16, 17, 25, 42, and 58 cities. 17, 42 and 58 cities are derived from tsplib: a library of sample instances for tsp; and others are taken from big cities in Java (West, Central, East) island. All of the algorithms are run by MATLAB program. The results show that exact method is better in time performance for problem size less than 25 cities and both exact and approximate methods yield optimal solution. For problem sizes that have more than 25 cities, approximate method – Artificial Bee Colony (ABC) yields better time which is approximately 37% less than exact and deviates 0.0197% for distance from exact method. The conclusion is to apply exact method for problem size that is less than 25 cities and approximate method for problem size that is more than 25 cities. The gap of time will be increasing between two methods when sample size becomes larger.
Author Christine, Natalia
Agung, Chandra
Author_xml – sequence: 1
  givenname: Chandra
  orcidid: 0000-0002-0338-1588
  surname: Agung
  fullname: Agung, Chandra
– sequence: 2
  givenname: Natalia
  orcidid: 0000-0002-4260-684X
  surname: Christine
  fullname: Christine, Natalia
BookMark eNo9kN1OgzAYhhszE-fcDXjEDYD9gdIe4mRbE6ALxSV60hRazJY5DHji3cuY8eh78-XNkzfPPZidu7MD4BHBgEBG4idRKSUCDDEKUBRAym_AHEc49DHmdDZl7HOG2B1YDsMRQohZTMf6HKhdWq5lmSfFKvWSIsnelFCeXHtyV4lcvCeVkIWXp9VWvihvbHpKZntRbLyqTPZpdkkqyVI1ErxdKZ-zNH8At605DW75dxfgdZ1Wq62fyY1YJZnfoIhwvx4XkNZQSi3ihrXYWVPDJmrryMVN47BjNmywMcxYDq1jIY-dZRAyakMTxWQBxJVrO3PUX_3h0_Q_ujMHPT26_kOb_vvQnJw2HLehRbW1DoecxoywNowaZmLEiOFoZOErq-m7Yehd-89DUE-W9WRZXyxrFOnRMvkFeVRrCw
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.30837/ITSSI.2021.15.069
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Business
EISSN 2524-2296
EndPage 75
ExternalDocumentID oai_doaj_org_article_a92f4d1bdde24967838f45c8a7183a91
10_30837_ITSSI_2021_15_069
GroupedDBID AAYXX
ADBBV
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c1539-b6023fa666d19a8f2edab0c5fb5e7cce2e8d4c2aa8ad90de8497ed80086d4a573
IEDL.DBID DOA
ISSN 2522-9818
IngestDate Fri Oct 03 12:50:52 EDT 2025
Sat Nov 29 06:22:13 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1 (15)
Language English
License http://creativecommons.org/licenses/by-nc-sa/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c1539-b6023fa666d19a8f2edab0c5fb5e7cce2e8d4c2aa8ad90de8497ed80086d4a573
ORCID 0000-0002-4260-684X
0000-0002-0338-1588
OpenAccessLink https://doaj.org/article/a92f4d1bdde24967838f45c8a7183a91
PageCount 7
ParticipantIDs doaj_primary_oai_doaj_org_article_a92f4d1bdde24967838f45c8a7183a91
crossref_primary_10_30837_ITSSI_2021_15_069
PublicationCentury 2000
PublicationDate 2021-03-31
PublicationDateYYYYMMDD 2021-03-31
PublicationDate_xml – month: 03
  year: 2021
  text: 2021-03-31
  day: 31
PublicationDecade 2020
PublicationTitle Sučasnij stan naukovih doslìdženʹ ta tehnologìj v promislovostì (Online)
PublicationYear 2021
Publisher Kharkiv National University of Radio Electronics
Publisher_xml – name: Kharkiv National University of Radio Electronics
SSID ssj0002876021
ssib044762074
ssib036251356
Score 2.1387603
Snippet 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...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 69
SubjectTerms approximate methods
exact method
gaps
optimization method
traveling salesman problem
Title PERFORMANCE ANALYSIS OF OPTIMIZATION METHODS FOR SOLVING TRAVELING SALESMAN PROBLEM
URI https://doaj.org/article/a92f4d1bdde24967838f45c8a7183a91
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2524-2296
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002876021
  issn: 2522-9818
  databaseCode: DOA
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2524-2296
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044762074
  issn: 2522-9818
  databaseCode: M~E
  dateStart: 20170101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1JS8QwFA4iIl7EFXdy8CYduyQmOVbtOAOd6TCtg3op2Qp6GMXt9_uSzkhvXryVEh7p95KXfK9vQegcOEd4ZYgJVGJVQAwLA8kiHQjVNMbySFKflTbL2XjMHx7EpNPqy8WEteWBW-AupYgbYiIF2xCYApjWhDeEag4SeSJ93nocMtEhU7CSwCrTqFN4jRDY88uqLy_epcSuQp-UFcMFJBBwbLUZNQlcSdjlsAJTBuQxjnoR7YUuGrpzanWK-_tTqL-FNhfXR5y2095GK3a-g9aX0eu7qJxkU-B1I9dyBqfjNH8shyUu-riYVGCmnrxHCo-yalDclhhG4rLIZ8PxHa6m6SzL3VOZ5lkJEvBkWlzn2WgP3fez6mYQLPomBBrslwgUfFrSSCAmJhKSN7E1UoWaNopaprWNLTdEx1JyaUQIGiGCWcMduzEElJPso9X569weIKw1NVRL6_42emcRBT0kIFwrw4Syh-hiiUv91pbHqIFWeBRrj2LtUKwjWgOKh-jaQfc70pW29i9A4fVC4fVfCj_6DyHHaMPNq00uPEGrn-9f9hSt6e_P54_3M7-WfgBTGMG4
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=PERFORMANCE+ANALYSIS+OF+OPTIMIZATION+METHODS+FOR+SOLVING+TRAVELING+SALESMAN+PROBLEM&rft.jtitle=Su%C4%8Dasnij+stan+naukovih+dosl%C3%ACd%C5%BEen%CA%B9+ta+tehnolog%C3%ACj+v+promislovost%C3%AC+%28Online%29&rft.au=Chandra+Agung&rft.au=Natalia+Christine&rft.date=2021-03-31&rft.pub=Kharkiv+National+University+of+Radio+Electronics&rft.issn=2522-9818&rft.eissn=2524-2296&rft.issue=1+%2815%29&rft_id=info:doi/10.30837%2FITSSI.2021.15.069&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_a92f4d1bdde24967838f45c8a7183a91
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2522-9818&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2522-9818&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2522-9818&client=summon