Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

OPTIMIZING BI-OBJECTIVE MULTIPLE TRAVELING SALESMEN ROUTES FOR DISASTER RELIEF LOGISTICS USING GENETIC ALGORITHM

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 19 No. 4 (2025) · hlm. 2507–2520

DOI
10.30598/barekengvol19iss4pp2507-2520
ISSN
2615-3017, 1978-7227
Terbit
2025-09-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Handling natural disasters such as floods requires efficient logistics distribution to minimize the negative impact on victims. Distribution route optimization becomes very important in this process. This paper applies a metaheuristic method using Genetic Algorithm to the Bi-objective Multiple Traveling Salesman Problem (BMTSP) to obtain a solution that minimizes the distance and time to deliver disaster relief logistics. Multiple vehicles are used in this study to represent delivery agents with two main objectives, namely minimizing total distance and travel time. Genetic Algorithm is applied by considering these two main objectives through the process of selection, crossover, mutation, and produces an effective Pareto solution. The results indicate that applying the Genetic Algorithm to the Bi-Objective Multiple Traveling Salesman Problem yields more efficient delivery routes—reducing both distance and time—compared to the Nearest Neighbor Algorithm. The simulation and testing in this study utilize data on distances and travel times among Central Java Regional Disaster Management Agency offices in 19 regencies—including a central depot—located in flood-prone areas of Central Java Province. The scenario involves two vehicles with identical load capacities.

Jaringan kolaborasi para penulis

7 penulis · 10 tautan kepenulisan bersama · 3 lintas organisasi

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

  • Diponegoro University
  • Zayed University
  • 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
Redemtus Heru TjahjanaDiponegoro University1
Zani Anjani RafsanjaniDiponegoro University1
Yogi A. ErlanggaZayed University1
Anindita Henindya PermatasariDiponegoro University1

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) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 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">OPTIMIZING BI-OBJECTIVE MULTIPLE TRAVELING SALESMEN ROUTES FOR DISASTER RELIEF LOGISTICS USING GENETIC ALGORITHM</dc:title>
	<dc:creator>Sihombing, Amos Hatoguan</dc:creator>
	<dc:creator>Herdiana, Ratna</dc:creator>
	<dc:creator>Pratama, Jovian Dian</dc:creator>
	<dc:description xml:lang="en-US">Handling natural disasters such as floods requires efficient logistics distribution to minimize the negative impact on victims. Distribution route optimization becomes very important in this process. This paper applies a metaheuristic method using Genetic Algorithm to the Bi-objective Multiple Traveling Salesman Problem (BMTSP) to obtain a solution that minimizes the distance and time to deliver disaster relief logistics. Multiple vehicles are used in this study to represent delivery agents with two main objectives, namely minimizing total distance and travel time. Genetic Algorithm is applied by considering these two main objectives through the process of selection, crossover, mutation, and produces an effective Pareto solution. The results indicate that applying the Genetic Algorithm to the Bi-Objective Multiple Traveling Salesman Problem yields more efficient delivery routes—reducing both distance and time—compared to the Nearest Neighbor Algorithm. The simulation and testing in this study utilize data on distances and travel times among Central Java Regional Disaster Management Agency offices in 19 regencies—including a central depot—located in flood-prone areas of Central Java Province. The scenario involves two vehicles with identical load capacities.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2025-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17256</dc:identifier>
	<dc:identifier>10.30598/barekengvol19iss4pp2507-2520</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 19 No 4 (2025): BAREKENG: Journal of Mathematics and Its Application; 2507-2520</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol19iss4year2025</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/17256/11057</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Ratna Herdiana, Amos Hatoguan Sihombing, Jovian Dian Pratama</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>