2019
DOI: 10.33005/tekmapro.v13i1.64
|View full text |Cite
|
Sign up to set email alerts
|

PENENTUAN RUTE DISTRIBUSI PRODUK GAS UNTUK MEMINIMUMKAN BIAYA DISTRIBUSI DENGAN METODE CLARKE & WRIGHT SAVING DI CV. SURYA INTI GAS

Abstract: Penelitian ini dibuat untuk mengatasi permasalahan rute distribusi yang ada di perusahaan. Perusahaan sudah memiliki rute sendiri untuk mendistribusikan produknya tetapi, tidak mempertimbangkan jarak terdekat. Hal ini mengakibatkan biaya distribusi yang mahal. Masalah ini akan diselesaikan dengan Metode Clarke and Wright Saving. Digunakannya metode Clarke and Wright Saving ini diharapkan dapat memberikan kontribusi dalam memecahkan persoalan rute distribusi sehingga diperoleh jarak terpendek atau jarak optimal… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…The biggest saving value is (5,6), so the arc (5,6) on the graph can be joined to graph t = 1. The biggest saving value is (6,7) and the arc (6,7) cannot be joined to graph t = 1 because exceeding the capacity. Then a new route will be formed namely 1 tt .…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The biggest saving value is (5,6), so the arc (5,6) on the graph can be joined to graph t = 1. The biggest saving value is (6,7) and the arc (6,7) cannot be joined to graph t = 1 because exceeding the capacity. Then a new route will be formed namely 1 tt .…”
Section: Resultsmentioning
confidence: 99%
“…After the data is collected, the data is processed using the Clarke Wright and Sequential Insertion Algorithm. The Clarke Wright Algorithm steps: [6], [7] Step 1: Determining customer data, amount of vehicle capacities and request as required input…”
mentioning
confidence: 99%