Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

A BI-OBJECTIVE COST MINIMIZATION MODEL FOR THE INSULAR TOUR ROUTE PLANNING PROBLEM

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 1 (2024) · hlm. 0437–0448

DOI
10.30598/barekengvol18iss1pp0437-0448
ISSN
2615-3017, 1978-7227
Terbit
2024-03-01
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This article presents a study on the development of a bi-objective cost problem optimization model in planning tourist routes in the island zone. This problem is a new variant of the tour route plan problem. Bi-objective view of two cost components, namely maritime transportation costs and ground transportation costs. Two models were formulated using a mixed integer linear programming approach. The first model was designed to minimize one of the two cost components separately. The second model was bi-objective cost minimization based on the priority weights of the two costs. It was designed to determine minimum transportation costs based on priority weights. Model testing was carried out through numerical experiments on several cases that often occur in industries in Maluku, Indonesia, especially tourism and goods shipping. Each case has variations in the number of islands and nodes. As a result, the model can demonstrate its adaptability to changes in objectives and parameters. For cases that do not have a single solution, an increase in the network structure on the number of islands and nodes will increase the variety of efficient alternative solutions. The set of efficient solutions also shows an inverse relationship between MTC and GTC. The results also show that MTC minimization cannot be used as a reference for TC minimization in cases with many nodes and islands. Efforts to minimize MTC in the island zone impact reducing total costs but do not mean minimizing total costs. In addition, based on the exponential trend line of computing time, the number of nodes has a more significant influence on computing time compared to the number of islands.

Jaringan kolaborasi para penulis

3 penulis · 3 tautan kepenulisan bersama

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

  • Universitas Pattimura
  • 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

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">A BI-OBJECTIVE COST MINIMIZATION MODEL FOR THE INSULAR TOUR ROUTE PLANNING PROBLEM</dc:title>
	<dc:creator>Afifudin, Mohammad Thezar</dc:creator>
	<dc:creator>Muspida, Muspida</dc:creator>
	<dc:creator>Sahar, Dian Pratiwi</dc:creator>
	<dc:description xml:lang="en-US">This article presents a study on the development of a bi-objective cost problem optimization model in planning tourist routes in the island zone. This problem is a new variant of the tour route plan problem. Bi-objective view of two cost components, namely maritime transportation costs and ground transportation costs. Two models were formulated using a mixed integer linear programming approach. The first model was designed to minimize one of the two cost components separately.&amp;nbsp; The second model was bi-objective cost minimization based on the priority weights of the two costs. It was designed to determine minimum transportation costs based on priority weights.&amp;nbsp;Model testing was carried out through numerical experiments on several cases that often occur in industries in Maluku, Indonesia, especially tourism and goods shipping.&amp;nbsp;Each case has&amp;nbsp;variations in the number of islands and nodes. As a result, the model can demonstrate its adaptability to changes in objectives and parameters.&amp;nbsp;For cases that do not have a single solution, an increase in the network structure on the number of islands and nodes will increase the variety of efficient alternative solutions. The set of efficient solutions also shows an inverse relationship between MTC and GTC. The results also show that MTC minimization cannot be used as a reference for TC minimization in cases with many nodes and islands. Efforts to minimize MTC in the island zone impact reducing total costs but do not mean minimizing total costs. In addition, based on the exponential trend line of computing time, the number of nodes has a more significant influence on computing time compared to the number of islands.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-03-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/10607</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss1pp0437-0448</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 1 (2024): BAREKENG: Journal of Mathematics and Its Application; 0437-0448</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss1year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/10607/7505</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Mohammad Thezar Afifudin, Muspida Muspida, Dian Pratiwi Sahar</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>