Perbandingan Pendekatan Dynamic Programming dan Branch and Bound dalam Optimasi Beban Muatan Logistik: Studi Kasus Kantor Pos Balikpapan

Santosa, Theo Adi (2026) Perbandingan Pendekatan Dynamic Programming dan Branch and Bound dalam Optimasi Beban Muatan Logistik: Studi Kasus Kantor Pos Balikpapan. Bachelor thesis, Institut Teknologi Kalimantan.

	Text 02221013_cover.pdf Restricted to Repository staff only until 4 October 2028. Download (413kB) | Request a copy
	Text 02221013_statement_of_authenticity.pdf Restricted to Repository staff only until 4 October 2028. Download (240kB) | Request a copy
	Text 02221013_publishing_agreement.pdf Restricted to Repository staff only until 4 October 2028. Download (256kB) | Request a copy
	Text 02221013_approval_sheet.pdf Restricted to Repository staff only until 4 October 2028. Download (141kB) | Request a copy
	Text 02221013_preface.pdf Restricted to Repository staff only until 4 October 2028. Download (261kB) | Request a copy
	Text 02221013_abstract_id.pdf Restricted to Repository staff only until 4 October 2028. Download (268kB) | Request a copy
	Text 02221013_abstract_en.pdf Restricted to Repository staff only until 4 October 2028. Download (277kB) | Request a copy
	Text 02221013_table_of_content.pdf Restricted to Repository staff only until 4 October 2028. Download (286kB) | Request a copy
	Text 02221013_illustrations.pdf Restricted to Repository staff only until 4 October 2028. Download (213kB) | Request a copy
	Text 02221013_tables.pdf Restricted to Repository staff only until 4 October 2028. Download (326kB) | Request a copy
	Text 02221013_notations.pdf Restricted to Repository staff only until 4 October 2028. Download (252kB) | Request a copy
	Text 02221013_chapter_1.pdf Restricted to Repository staff only until 4 October 2028. Download (551kB) | Request a copy
	Text 02221013_chapter_2.pdf Restricted to Repository staff only until 4 October 2028. Download (910kB) | Request a copy
	Text 02221013_chapter_3.pdf Restricted to Repository staff only until 4 October 2028. Download (690kB) | Request a copy
	Text 02221013_chapter_4.pdf Restricted to Repository staff only until 4 October 2028. Download (1MB) | Request a copy
	Text 02221013_conclusions.pdf Restricted to Repository staff only until 4 October 2028. Download (253kB) | Request a copy
	Text 02221013_bibliography.pdf Restricted to Repository staff only until 4 October 2028. Download (283kB) | Request a copy
	Text 02221013_enclosure.pdf Restricted to Repository staff only until 4 October 2028. Download (675kB) | Request a copy
	Text 02221013_paper.pdf Restricted to Repository staff only until 4 October 2028. Download (372kB) | Request a copy
	Text 02221013_presentation.pdf Restricted to Repository staff only until 4 October 2028. Download (4MB) | Request a copy
	Text 02221013_form020.pdf Restricted to Repository staff only until 4 October 2028. Download (169kB) | Request a copy

Abstract

Kantor Pos Balikpapan menghadapi keterbatasan kapasitas kendaraan distribusi yang tidak sebanding dengan jumlah bag kiriman, sehingga diperlukan mekanisme pemilihan muatan berdasarkan prioritas kiriman. Penelitian ini bertujuan mengoptimalkan pemilihan muatan logistik menggunakan metode Dynamic Programming dan Branch and Bound dengan memodelkan permasalahan sebagai Integer Knapsack Problem. Skor prioritas kiriman dibentuk menggunakan pendekatan Analytical Hierarchy Process (AHP) berdasarkan kriteria jenis layanan, tujuan bag, dan asal bag, kemudian digunakan sebagai fungsi tujuan dengan kendala kapasitas kendaraan distribusi sebesar 1362 kg. Hasil penelitian menunjukkan bahwa kedua metode optimasi menghasilkan solusi optimal karena memperoleh total skor prioritas kiriman termuat yang lebih tinggi dibandingkan dengan kebijakan Kantor Pos Balikpapan, sesuai dengan tujuan optimasi yang ditetapkan pada model Integer Knapsack Problem. Berdasarkan simulasi pengiriman selama tiga periode, kebijakan instansi menghasilkan penumpukan kiriman sebanyak 69 bag pada akhir periode pengiriman. Sementara itu, penerapan metode optimasi mampu mengurangi penumpukan menjadi 32 bag menggunakan Dynamic Programming dan 36 bag menggunakan Branch and Bound. Berdasarkan hasil pengujian waktu komputasi, Branch and Bound menunjukkan waktu komputasi yang lebih cepat dibandingkan Dynammic Programming dengan rata-rata waktu komputasi secara berturut-turut sebesar 5.540308 dan 24.077527 satuan detik.

Item Type:	Thesis (Bachelor)
Subjects:	Q Science > QA Mathematics
Divisions:	Jurusan Matematika dan Teknologi Informasi > Matematika
Depositing User:	Theo Adi Santosa
Date Deposited:	09 Jul 2026 06:59
Last Modified:	09 Jul 2026 06:59
URI:	http://repository.itk.ac.id/id/eprint/26229

Actions (login required)

View Item