Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 3

OPTIMIZING CARTON PRODUCT DELIVERY BY SOLVING TRAVELLING SALESMAN PROBLEM AT PACKAGING COMPANIES

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

DOI
10.30598/barekengvol18iss3pp1803-1816
ISSN
2615-3017, 1978-7227
Terbit
2024-08-02
Penerbit
PATTIMURA UNIVERSITY
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Optimization of delivery routes is one form of increasing business productivity to achieve the company's main goal of distributing each product to customers. The Traveling Salesman Problem (TSP) is a combinatorial optimization problem where a salesman goes on a distribution journey that starts from the depot, then visits all customers exactly once, and ends with returning to the depot. This study aims to optimize the distribution route of carton products for packaging companies using the TSP model. The research methodology includes observation, interviews, and document studies to understand the distribution process of carton products at packaging companies. To complete the TSP model, Branch and Bound (BB) and Nearest Neighbor (NN) methods are applied to find the best solution for determining the distribution route of carton products. The way the BB method works is by utilizing branch cuts and boundaries to reduce search space and speed up the resolution process. In the NN method, the nearest point is chosen to get the shortest route distance. Research findings show that the use of the BB method results in a mileage difference from the initial route of 125 km (53% more efficient) and a fuel cost difference of 121,231 IDR (45% cheaper). Meanwhile, the NN method results in a mileage difference from the initial route of 115 km (48.94%) and a fuel cost difference of 109,901 IDR (41.27%). So, the method that produces the best solution is the BB method. The limitations of this study lie in the scale of the model used and the assumptions underlying the analysis. Future research can broaden the scope of the model and consider other factors that may affect the distribution of carton products. The results of this study contribute to improving the efficiency of carton product distribution.

Jaringan kolaborasi para penulis

6 penulis · 10 tautan kepenulisan bersama

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

  • University of Singaperbangsa Karawang
  • 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
Fahriza Nurul AzizahUniversity of Singaperbangsa Karawang3
Rheza VahlepyUniversity of Singaperbangsa Karawang2
Candra Galang Gemilang PutraUniversity of Singaperbangsa Karawang1

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 CARTON PRODUCT DELIVERY BY SOLVING TRAVELLING SALESMAN PROBLEM AT PACKAGING COMPANIES</dc:title>
	<dc:creator>Aisyah, Fitri Sakinatul</dc:creator>
	<dc:creator>Winarno, Winarno</dc:creator>
	<dc:creator>Rinaldi, Dimas Nurwinata</dc:creator>
	<dc:description xml:lang="en-US">Optimization of delivery routes is one form of increasing business productivity to achieve the company's main goal of distributing each product to customers. The Traveling Salesman Problem (TSP) is a combinatorial optimization problem where a salesman goes on a distribution journey that starts from the depot, then visits all customers exactly once, and ends with returning to the depot. This study aims to optimize the distribution route of carton products for packaging companies using the TSP model. The research methodology includes observation, interviews, and document studies to understand the distribution process of carton products at packaging companies. To complete the TSP model, Branch and Bound (BB) and Nearest Neighbor (NN) methods are applied to find the best solution for determining the distribution route of carton products. The way the BB method works is by utilizing branch cuts and boundaries to reduce search space and speed up the resolution process. In the NN method, the nearest point is chosen to get the shortest route distance. Research findings show that the use of the BB method results in a mileage difference from the initial route of 125 km (53% more efficient) and a fuel cost difference of 121,231 IDR (45% cheaper). Meanwhile, the NN method results in a mileage difference from the initial route of 115 km (48.94%) and a fuel cost difference of 109,901 IDR (41.27%). So, the method that produces the best solution is the BB method. The limitations of this study lie in the scale of the model used and the assumptions underlying the analysis. Future research can broaden the scope of the model and consider other factors that may affect the distribution of carton products. The results of this study contribute to improving the efficiency of carton product distribution.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2024-08-02</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/12421</dc:identifier>
	<dc:identifier>10.30598/barekengvol18iss3pp1803-1816</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; 1803-1816</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/12421/8615</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2024 Fitri Sakinatul Aisyah, Winarno Winarno, Dimas Nurwinata Rinaldi</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>