Route Optimization of Airplane Travel Plans Using the Tabu-Simulated Annealing Algorithm to Solve the Traveling Salesman Challenge 2.0

Edwin Dwi Ahmad, Ahmad Muklason, Ika Nurkasanah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

Abstract

Traveling Salesman Problem (TSP) has been emerged as NP-hard problem in which there is no exact algorithm that can solve it in polynomial time. There has been an increasing interest in implementing TSP to find the shortest travel route where the trip starts from a city and must end in the same city as the departure city in a condition that every city has to be visited exactly once. Another important feature of TSP is to find travel routes with the lowest possible cost. This paper investigates a new variant of TSP to solve airplane travel plans problem in the Travelling Salesman Challenge (TSC) 2.0. A hybrid Tabu Search and Simulated Annealing was used to solve the problem. The results show that the proposed algorithm can solve the problem and outperforms great deluge algorithm, i.e. 48.54% vs 41.33% measured by the improvement from the initial solution.

Original languageEnglish
Title of host publicationCENIM 2020 - Proceeding
Subtitle of host publicationInternational Conference on Computer Engineering, Network, and Intelligent Multimedia 2020
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages217-221
Number of pages5
ISBN (Electronic)9781728182834
DOIs
Publication statusPublished - 17 Nov 2020
Event2020 International Conference on Computer Engineering, Network, and Intelligent Multimedia, CENIM 2020 - Virtual, Surabaya, Indonesia
Duration: 17 Nov 202018 Nov 2020

Publication series

NameCENIM 2020 - Proceeding: International Conference on Computer Engineering, Network, and Intelligent Multimedia 2020

Conference

Conference2020 International Conference on Computer Engineering, Network, and Intelligent Multimedia, CENIM 2020
Country/TerritoryIndonesia
CityVirtual, Surabaya
Period17/11/2018/11/20

Keywords

  • Tabu Search and Simulated Annealing
  • Travel Salesman Problem
  • Travelling Salesman Challenge 2.0

Fingerprint

Dive into the research topics of 'Route Optimization of Airplane Travel Plans Using the Tabu-Simulated Annealing Algorithm to Solve the Traveling Salesman Challenge 2.0'. Together they form a unique fingerprint.

Cite this