@inproceedings{6c0eb6b1abfe4b08857f207e3d6304a3,
title = "Route Optimization of Airplane Travel Plans Using the Tabu-Simulated Annealing Algorithm to Solve the Traveling Salesman Challenge 2.0",
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.",
keywords = "Tabu Search and Simulated Annealing, Travel Salesman Problem, Travelling Salesman Challenge 2.0",
author = "Ahmad, {Edwin Dwi} and Ahmad Muklason and Ika Nurkasanah",
note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 International Conference on Computer Engineering, Network, and Intelligent Multimedia, CENIM 2020 ; Conference date: 17-11-2020 Through 18-11-2020",
year = "2020",
month = nov,
day = "17",
doi = "10.1109/CENIM51130.2020.9297892",
language = "English",
series = "CENIM 2020 - Proceeding: International Conference on Computer Engineering, Network, and Intelligent Multimedia 2020",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "217--221",
booktitle = "CENIM 2020 - Proceeding",
address = "United States",
}