Analisis Optimasi Jalur Distribusi Menggunakan Pendekatan (Traveling Salesman Problem) untuk Meningkatkan Efisiensi Biaya Distribusi pada CV. Merdeka Pasuruan

Gespeichert in:
Bibliographische Detailangaben
Titel: Analisis Optimasi Jalur Distribusi Menggunakan Pendekatan (Traveling Salesman Problem) untuk Meningkatkan Efisiensi Biaya Distribusi pada CV. Merdeka Pasuruan
Autoren: Maulidi, M Agus
Quelle: Jurnal Teknik Industri Terintegrasi (JUTIN); Vol. 8 No. 4 (2025): October; 4142-4150
Verlagsinformationen: LPPM Universitas Pahlawan Tuanku Tambusai, 2025.
Publikationsjahr: 2025
Schlagwörter: Optimization, Traveling Salesman Problem, Branch and Bound Algorithm, Distribution
Beschreibung: CV. Merdeka is a company engaged in the construction of MWC NU REJOSO and MWC NU NGULING buildings. After seeing the demand for branch expansion, this growth can also be seen in an increase in distribution costs. The main goal is to find the route with the shortest total distance for analyzing this data using the Traveling Salesman Problem method. Based on the results and discussion, it is concluded that manual calculations provide optimal results, namely paths A to B is the shortest route that can be taken with a distance of 14.3 kilometers
Publikationsart: Article
Dateibeschreibung: application/pdf
Sprache: English
ISSN: 2620-8962
Zugangs-URL: https://journal.universitaspahlawan.ac.id/index.php/jutin/article/view/46624
Rights: CC BY SA
Dokumentencode: edsair.upttjournal...b7e51e2b4911352d53003b16a2ff0b80
Datenbank: OpenAIRE
Beschreibung
Abstract:CV. Merdeka is a company engaged in the construction of MWC NU REJOSO and MWC NU NGULING buildings. After seeing the demand for branch expansion, this growth can also be seen in an increase in distribution costs. The main goal is to find the route with the shortest total distance for analyzing this data using the Traveling Salesman Problem method. Based on the results and discussion, it is concluded that manual calculations provide optimal results, namely paths A to B is the shortest route that can be taken with a distance of 14.3 kilometers
ISSN:26208962