Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 18 No. 3 (2024) · hlm. 1471–1482

DOI
10.30598/barekengvol18iss3pp1471-1482
ISSN
2615-3017, 1978-7227
Terbit
2024-07-31
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

This research discusses the optimization of the assignment of waste vehicle routes and transportation, which are responsible for transporting waste from temporary disposal sites to final disposal sites. The aim is to minimize the remaining waste at temporary disposal sites, thus creating a clean and comfortable environment. The focus of this research is determining the number of trips (rit) for each vehicle (dump trucks and arm roll trucks) on each route. Besides aiming to minimize the remaining waste at temporary disposal sites as the main priority, there are also other priorities, namely minimizing fuel usage and the working time within a day. Therefore, in accordance with the characteristics of the problem, where there are multiple objectives and an integer solution is required, The Simplex-Preemptive Goal Programming with the Branch and Bound method is proposed as the solution method. The optimal solution has been obtained. The result includes the optimal number of trips (rit) for each waste transport vehicles (dump trucks and arm roll trucks) on each routes.

Jaringan kolaborasi para penulis

23 penulis · 64 tautan kepenulisan bersama

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

  • Universitas Jambi
  • 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
Corry SorminUniversitas Jambi2
Gusmi KholijahUniversitas Jambi1
Mahya IhsanUniversitas Jambi1
Z GusmanelyUniversitas Jambi1
Arnild Augina MekarisceUniversitas Jambi1
Zuli RodhiyahUniversitas Jambi1
Samsidar SamsidarAfiliasi tidak diketahui1
Oka Lesmana SAfiliasi tidak diketahui1
Samsidar SamsidarUniversitas Jambi1
Ichy Lucya RestaUniversitas Jambi1
Putri Nurul Kusuma WhardaniAfiliasi tidak diketahui1
Maulina TanjungUniversitas Jambi1
Mhd RahmanUniversitas Jambi1
Lestari SimamoraUniversitas Jambi1
Khairul AlimUniversitas Jambi1
Cut MultahadahUniversitas Jambi1
Nurul PratiwiUniversitas Jambi1
Wardi SyafmenUniversitas Jambi1
Fevi HanestiUniversitas Jambi1

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">THE SIMPLEX - PREEMPTIVE GOAL PROGRAMMING WITH BRANCH AND BOUND METHOD FOR OPTIMIZING WASTE VEHICLE ROUTES AND TRANSPORTATION</dc:title>
	<dc:creator>Fadhila, Rifa</dc:creator>
	<dc:creator>Rarasati, Niken</dc:creator>
	<dc:creator>Rozi, Syamsyida</dc:creator>
	<dc:creator>Putra, Fernando Mersa</dc:creator>
	<dc:description xml:lang="en-US">This research discusses the optimization of the assignment of waste vehicle routes and transportation, which are responsible for transporting waste from temporary disposal sites to final disposal sites. The aim is to minimize the remaining waste at temporary disposal sites, thus creating a clean and comfortable environment. The focus of this research is determining the number of trips (rit) for each vehicle (dump trucks and arm roll trucks) on each route. Besides aiming to minimize the remaining waste at temporary disposal sites as the main priority, there are also other priorities, namely minimizing fuel usage and the working time within a day. Therefore, in accordance with the characteristics of the problem, where there are multiple objectives and an integer solution is required, The Simplex-Preemptive Goal Programming with the Branch and Bound method is proposed as the solution method. The optimal solution has been obtained. The result includes the optimal number of trips (rit) for each waste transport vehicles (dump trucks and arm roll trucks) on each routes.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-07-31</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/11054</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss3pp1471-1482</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 18 No 3 (2024): BAREKENG: Journal of Mathematics and Its Application; 1471-1482</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol18iss3year2024</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/11054/8581</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Rifa Fadhila, Niken Rarasati, Syamsyida Rozi, Fernando Mersa Putra</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>