Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : syntax journal of software engineering computer science and information technology

PENERAPAN METODE BRANCH AND BOUND DALAM OPTIMASI RUTE PENGIRIMAN PRODUK SKINCARE BERDASARKAN MINIMASI BIAYA OPERASIONAL Serenity Devina Suryanto; Albert Cahayadi; Yohannes Yohannes
Syntax : Journal of Software Engineering, Computer Science and Information Technology Vol 7, No 1 (2026): Juni 2026
Publisher : Universitas Dharmawangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46576/syntax.v7i1.8948

Abstract

Skincare merupakan salah satu barang yang paling banyak didistribusikan. Distribusi produk skincare yang banyak juga membuat distributor mencari solusi dalam mencari rute pengiriman dengan guna meminimalkan biaya pengiriman. Permasalahan yang sering terjadi dalam proses distribusi adalah pemilihan rute pengiriman yang kurang optimal sehingga menyebabkan pengeluaran ekstra pada biaya transportasi. Rancangan sistem dalam upaya mencari rute optimal dengan biaya minimal menggunakan algoritma Branch and Bound dengan membatasi kemungkinan rute yang tidak memenuhi kriteria minimum sehingga proses pencarian menjadi lebih efisien. Data yang digunakan dalam penelitian meliputi Costs, Location, dan transportation modes pengiriman produk skincare. Penerapan ini menghasilkan cost minimum sebesar 772.40 dengan rute optimal pada transportation modes Air yang menjadi hasil yang paling efisien dibandingkan dengan transportion modes lain yaitu Road, Rail dan Sea. Berdasarkan hasil penelitian tersebut, dapat disimpulkan bahwa metode Branch and Bound mampu menghasilkan rute pengiriman yang lebih optimal dibandingkan metode konvensional, sehingga dapat mengurangi total biaya distribusi dan meningkatkan efisiensi proses pengiriman produk skincare. Dengan demikian, metode ini dapat dijadikan solusi dalam pengambilan keputusan untuk optimasi sistem distribusi pada perusahaan skincare.Kata Kunci— Branch and Bound , Optimasi pemilihan rute pengiriman, Skincare, Optimasi biaya. ABSTRACT Skincare is one of the most widely distributed products. The extensive distribution of skincare products also forces distributors to seek solutions in finding shipping routes to minimize shipping costs. A common problem in the distribution process is the selection of suboptimal shipping routes, which results in extra expenses on transportation costs. The system design in an effort to find the optimal route with minimal costs uses the Branch and Bound algorithm by limiting the possibility of routes that do not meet the minimum criteria so that the search process becomes more efficient. The data used in the study include Costs, Location, and transportation modes for skincare product delivery. This application produces a minimum cost of 772.40 with the optimal route in Air transportation modes being the most efficient result compared to other transportation modes, namely Road, Rail, and Sea. Based on the results of this study, it can be concluded that the Branch and Bound method is able to produce a more optimal shipping route than conventional methods, thereby reducing total distribution costs and increasing the efficiency of the skincare product delivery process. Thus, this method can be used as a solution in decision-making for optimizing the distribution system in skincare companies.Keywords— Branch and Bound , Delivery route optimization, Skincare, Cost Optimization.
PENERAPAN DYNAMIC PROGRAMMING PADA PENJADWALAN PENERBANGAN UNTUK MINIMASI DELAY Ariel Sudarsono; Raphael Lee; Yohannes Yohannes
Syntax : Journal of Software Engineering, Computer Science and Information Technology Vol 7, No 1 (2026): Juni 2026
Publisher : Universitas Dharmawangsa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.46576/syntax.v7i1.8911

Abstract

Abstrak— Keterlambatan penerbangan komersial menjadi tantangan besar dalam manajemen operasional bandara yang berdampak pada efisiensi sistem. Penelitian ini bertujuan mengoptimalkan penjadwalan penerbangan untuk meminimalkan total delay menggunakan algoritma Dynamic Programming. Eksperimen dilakukan menggunakan dataset maskapai penerbangan dari Kaggle dengan membatasi ruang lingkup pada 15.000 baris data pertama dan kapasitas waktu operasional harian sebesar 1.440 menit. Parameter weight ditentukan berdasarkan durasi terbang, sedangkan value dibentuk menggunakan fungsi penalti keterlambatan. Tahap post-processing diterapkan dengan aturan celah waktu minimum 20 menit untuk mengeliminasi konflik rute. Hasil penelitian menunjukkan algoritma berhasil menyusun kombinasi jadwal final berisi 16 penerbangan optimal. Penerapan metode ini terbukti efektif menekan total keterlambatan menjadi 107,0 menit dengan rata-rata delay sebesar 6,68 menit per penerbangan.Kata Kunci—Dynamic Programming, Keterlambatan Penerbangan, Optimasi Jadwal, Post-processing. AbstractCommercial flight delays present a major challenge in airport operational management, impacting system efficiency. This study aims to optimize flight scheduling to minimize total delays using Dynamic Programming. Experiments were conducted using an airline dataset from Kaggle, limiting the scope to the first 15,000 data rows with a daily operational time capacity of 1,440 minutes. The weight parameter was determined based on flight duration, while the value was formulated using a delay penalty function. A post-processing stage applied a minimum 20-minute time gap rule to eliminate route conflicts. The results show that the algorithm successfully generated a final schedule combination of 16 optimal flights. This approach effectively reduced the total delay to 107,0 minutes, achieving an average delay of only 6,68 minutes per flight.Keywords— Dynamic Programming, Flight Delays, Post-processing, Schedule Optimization.
Co-Authors Ade Hendri Pandrean Adhytio Mahendra Adrian Chandra Albert Cahayadi Andreas, Kevin Ariel Sudarsono Azarya, Philips Denny Beni Anthony Bobby Jaya Saputra Cahyati, Imelia Dwinora Calvin Oliver Saputra Candra Candra Celvine Adi Putra Cendy Prakarsah Daffa Yudha Musyaffa Dafid Dafid Dandy, Dandy Daniel Udjulawa Daniel Udjulawa Devella, Siska Dody, Muhammad Fadhel Muhammad Famerdi, Farhan Agung Farhan Agung Famerdi Farisi, Ahmad Febbiola Febbiola Felix Gunawan Femmy Johan Feristyani, Indah Firda Novia Rahmawati Gerry Jeven Timoti Glen, Billy Hafiz Irsyad Hafiz Irsyad Hartati, Ery Inayatullah Inayatullah Indah Feristyani Jaysen Stephanus Jendraja Husin Kotan Jennifer Verty Jericho Jericho Jerry Setiawan Jimmy Aprilyanto Johannes Petrus Jonathan Tanujaya Joseph Eduard Uly Loni Julian Rusli Tee Baldi Juliana Nasution Kelvin Arianto Kevin Andreas Klaudius Audie Irsansaputra Laksana, Jovansa Putra Leo Chandra Leonardo Leonardo M Dhafa Adjie Saputra M. Zaky Naufal Farisky Marcella, Dewi Meiriyama Meiriyama, Meiriyama Migel Orvin Febryan Molavi Arman Muhammad Ezar Al Rivan Muhammad Farid Athar Muhammad Radja Juang Jamemiko Muhammad Rizky Pribadi Muhammad Yudha Setiawan Muhdhor, Umar Novan Wijaya Nur Rachmat Pandi Pandi Pandi Pandi, Pandi Pandrean, Ade Hendri Philips Denny Azarya Prabowo, Adrianus Prasthio, Rial Putra, Lipi Amanda Raphael Lee Ricky Wijaya RR. Ella Evrita Hestiandari Sahpira, Mulia Saputra, Dika Sari, Yulya Puspita Selvie Selvie Serenity Devina Suryanto Setiawan, Jerry Siska Amelia Siska Devella Siti Fatimah Az Zahrah Sonia Sonia, Sonia Tanuwijaya, William Timoteus Ivan Sariyo Veraldo Verrino Adityya Wijang Widhiarso William Hadisaputra William Tanuwijaya Yeremia Agung Chandra Yoannita Yoannita Yoannita Yoannita, Yoannita Yulya Puspita Sari