Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

Hybrid iterated local search algorithm for optimization route of airplane travel plans

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 13 No. 4 (2023)

DOI
10.11591/ijece.v13i4.pp4700-4707
ISSN
2722-2578, 2088-8708
Terbit
2023-08-01
Penerbit
Institute of Advanced Engineering and Science
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the Tabu-SA algorithm.

Jaringan kolaborasi para penulis

15 penulis · 42 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Institut Teknologi Sepuluh Nopember
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Edwin RiksakomaraInstitut Teknologi Sepuluh Nopember3
Retno Aulia VinartiInstitut Teknologi Sepuluh Nopember2
Faizal MahanantoInstitut Teknologi Sepuluh Nopember2
Raras TyasnuritaInstitut Teknologi Sepuluh Nopember2
Shof Rijal Ahlan RobbaniInstitut Teknologi Sepuluh Nopember2
Yusnardo TendioInstitut Teknologi Sepuluh Nopember2
Helena Angelita DepariInstitut Teknologi Sepuluh Nopember2
Muhammad Arif NurimanInstitut Teknologi Sepuluh Nopember2
Anang FirdausInstitut Teknologi Sepuluh Nopember1
Vicha Azthanty SupoyoInstitut Teknologi Sepuluh Nopember1
Muhammad Reza PahlawanInstitut Teknologi Sepuluh Nopember1
Wiwik AnggraeniInstitut Teknologi Sepuluh Nopember1
Mursyidatun NabilahInstitut Teknologi Sepuluh Nopember1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Data ini berasal dari Crossref (yang disetorkan penerbit), karena endpoint OAI-PMH milik jurnal tidak dapat di-harvest.

Sumber metadata: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, pertama di-harvest 27 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata sebagai oai_dc, dikonversi dari Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Hybrid iterated local search algorithm for optimization route of airplane travel plans</dc:title><dc:creator>Muklason, Ahmad</dc:creator><dc:creator>Agung Premananda, I Gusti</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span lang="EN-US"&amp;gt;The traveling salesman problem (TSP) is a very popular combinatorics problem. This problem has been widely applied to various real problems. The TSP problem has been classified as a Non-deterministic Polynomial Hard (NP-Hard), so a non-deterministic algorithm is needed to solve this problem. However, a non-deterministic algorithm can only produce a fairly good solution but does not guarantee an optimal solution. Therefore, there are still opportunities to develop new algorithms with better optimization results. This research develops a new algorithm by hybridizing three local search algorithms, namely, iterated local search (ILS) with simulated annealing (SA) and hill climbing (HC), to get a better optimization result. This algorithm aimed to solve TSP problems in the transportation sector, using a case study from the Traveling Salesman Challenge 2.0 (TSC 2.0). The test results show that the developed algorithm can optimize better by 15.7% on average and 11.4% based on the best results compared to previous studies using the Tabu-SA algorithm.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2023-08-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v13i4.pp4700-4707</dc:identifier><dc:identifier>10.11591/ijece.v13i4.pp4700-4707</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 13 No 4 (2023); 4700</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/31071/16748</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>