2018
DOI: 10.22441/sinergi.2018.2.010
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Goods Distribution Route Assisted by Google Map With Cheapest Insertion Heuristic Algorithm (Cih)

Abstract: --

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0
1

Year Published

2021
2021
2021
2021

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 6 publications
0
2
0
1
Order By: Relevance
“…This compact street vendor concept utilizes and modifies a shipping container to make it interesting and proper to use. (Hignasari and Mahira 2018). Today, many innovations are made by utilizing shipping containers, one of the innovations is in the form of the booth.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…This compact street vendor concept utilizes and modifies a shipping container to make it interesting and proper to use. (Hignasari and Mahira 2018). Today, many innovations are made by utilizing shipping containers, one of the innovations is in the form of the booth.…”
Section: Resultsmentioning
confidence: 99%
“…Shipping container becomes the first choice in building compact housing or booth due to their robust structure, shock-resistant, recyclable, and easy-to-move features (Hignasari and Mahira 2018). Malcolm McLean is the holder of the patent of shipping container.…”
Section: Resultsmentioning
confidence: 99%
“…Metode algoritma Cheapest Insertion Heuristic (CIH) adalah metode yang dapat digunakan untuk menentukan rute yang harus ditempuh kendaraan untuk mencapai jarak terpendek (Utomo, Maylawati, & Alam, 2018). Algoritma CIH merupakan Algoritma Insertion yang setiap penambahan kota baru yang akan disisipkan ke dalam subtour memiliki nilai bobot penyisipan paling minimal pada permasalahan TSP yang dilakukan (Yulianto, 2018) (Hignasari & Mahira, 2018). Algoritma ini memberikan rute perjalanan yang tidak sama dengan sebelumnya tergantung dari urutan penyisipan kota-kota pada subtour yang bersangkutan dan algoritma cheapest insertion heuristic ini bisa juga digunakan untuk kasus Travelling Salesman Problem (TSP) dengan jumlah kota yang besar.…”
Section: Landasan Teoriunclassified