Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

A comparison of meta-heuristic and hyper-heuristic algorithms in solving an urban transit routing problems

IAES International Journal of Artificial Intelligence · Vol. 13 No. 3 (2024) · hlm. 2923–2933

DOI
10.11591/ijai.v13.i3.pp2923-2933
ISSN
2252-8938, 2089-4872
Terbit
2024-09-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Public transport is a serious problem that is difficult to solve in many countries. Public transport routing optimization problem also known as urban transit routing problem (UTRP) is time-consuming process, therefore effective approches are urgently needed. UTRP aims to minimize cost passenger and operator from a combination of route set. UTRP can be optimize with heuristics, meta-heuristics, and hyper-heuristics methods. In several previous studies, UTRP can be optimized with any meta-heuristics and hyper-heuristics methods. In this study we compare the performance of meta-heuristic methods, i.e. ill-climbing, simulated annealing, and hyper-heuristics method based on modified particle swarm optimization algorithm. The experimental results showed that the proposed methods could solve UTRP effectively. Regarding their performance, the results show that despite the generality of hyper-heuristics, their performance are competitive. More specifically, hyper-heuristics method is the best method compared to the other two methods in each dataset. In addition, compared to prior studies results, he proposed hyper-heuristics could outperform them in term of cost passenger of small dataset Mandl. The main contribution of this paper is that to best of our knowledge, it is the first study comparing the performance of meta-heuristics and hyper-heuristics approaches over UTRP.

Kata kunci

Jaringan kolaborasi para penulis

24 penulis · 78 tautan kepenulisan bersama · 7 lintas organisasi

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

  • Institut Teknologi Sepuluh Nopember
  • Universitas Muhammadiyah Malang
  • Universitas Katolik Widya Mandira
  • Afiliasi tidak diketahui
  • 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
Wiwik AnggraeniInstitut Teknologi Sepuluh Nopember3
Retno Aulia VinartiInstitut Teknologi Sepuluh Nopember3
Faizal MahanantoInstitut Teknologi Sepuluh Nopember3
Raras TyasnuritaInstitut Teknologi Sepuluh Nopember3
Muhammad Reza PahlawanInstitut 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
Febriliyan SamopaInstitut Teknologi Sepuluh Nopember1
Radityo Prasetianto WibowoInstitut Teknologi Sepuluh Nopember1
Tresnaning ArifiyahInstitut Teknologi Sepuluh Nopember1
Pujiadi PujiadiAfiliasi tidak diketahui1
Siti Aminatus ZehrohInstitut Teknologi Sepuluh Nopember1
Nur Aini LestariInstitut Teknologi Sepuluh Nopember1
Yeyen SudiartiInstitut Teknologi Sepuluh Nopember1
Muhammad Ilham PerdanaUniversitas Muhammadiyah Malang1
Adri Gabriel SooaiUniversitas Katolik Widya Mandira1
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.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijai.iaescore.com/index.php/IJAI/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A comparison of meta-heuristic and hyper-heuristic algorithms in solving an urban transit routing problems</dc:title>
	<dc:creator>Muklason, Ahmad</dc:creator>
	<dc:creator>Ahlan Robbani, Shof Rijal</dc:creator>
	<dc:creator>Riksakomara, Edwin</dc:creator>
	<dc:creator>Premananda, I Gusti Agung</dc:creator>
	<dc:subject xml:lang="en-US">soft computig;computer science;operation research</dc:subject>
	<dc:subject xml:lang="en-US">Hill climbing; Hyper-heuristics; Particle swarm optimization; Simulated annealing; Urban transit routing problem</dc:subject>
	<dc:description xml:lang="en-US">Public transport is a serious problem that is difficult to solve in many countries. Public transport routing optimization problem also known as urban transit routing problem (UTRP) is time-consuming process, therefore effective approches are urgently needed. UTRP aims to minimize cost passenger and operator from a combination of route set. UTRP can be optimize with heuristics, meta-heuristics, and hyper-heuristics methods. In several previous studies, UTRP can be optimized with any meta-heuristics and hyper-heuristics methods. In this study we compare the performance of meta-heuristic methods, i.e. ill-climbing, simulated annealing, and hyper-heuristics method based on modified particle swarm optimization algorithm. The experimental results showed that the proposed methods could solve UTRP effectively. Regarding their performance, the results show that despite the generality of hyper-heuristics, their performance are competitive. More specifically, hyper-heuristics method is the best method compared to the other two methods in each dataset. In addition, compared to prior studies results, he proposed hyper-heuristics could outperform them in term of cost passenger of small dataset Mandl. The main contribution of this paper is that to best of our knowledge, it is the first study comparing the performance of meta-heuristics and hyper-heuristics approaches over UTRP.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2024-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijai.iaescore.com/index.php/IJAI/article/view/22971</dc:identifier>
	<dc:identifier>10.11591/ijai.v13.i3.pp2923-2933</dc:identifier>
	<dc:source xml:lang="en-US">IAES International Journal of Artificial Intelligence (IJ-AI); Vol 13, No 3: September 2024; 2923-2933</dc:source>
	<dc:source>2252-8938</dc:source>
	<dc:source>2089-4872</dc:source>
	<dc:source>10.11591/ijai.v13.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijai.iaescore.com/index.php/IJAI/article/view/22971/14100</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Institute of Advanced Engineering and Science</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>