scholarly journals PERENCANAAN RUTE DISTRIBUSI PRODUK SOSIS MERAH MENGGUNAKAN NEAREST INSERTION HEURISTIC DI PT. XYZ

JUMINTEN ◽  
2020 ◽  
Vol 1 (5) ◽  
pp. 73-84
Author(s):  
Ferina Indah Lusiana ◽  
Rr Rochmoeljati
Keyword(s):  
Insertion Heuristic

PT.XYZ merupakan perusahaan yang bergerak dalam bidang Industri Perunggasan Terpadu di Indonesia. Saat ini rute pengiriman yang terbentuk berdasarkan perkiraan saja tanpa adanya suatu metode untuk menghitung jarak yang ditempuh. Selain itu terdapat 15 agen yang harus dilayani dengan kapasitas angkut yang terbatas dan setiap agen menentukan jadwal pelayanan yang berbeda-beda, mengakibatkan beberapa agen bisa dilalui lebih dari sekali sehingga mengakibatkan bertambahnya jarak tempuh yang mengakibatkan meningkatnya biaya transportasi. Untuk mengatasi masalah tersebut, perusahaan membutuhkan solusi permasalahan dengan menggunakan metode Nearest Insertion Heuristic. Tujuan penelitian ini adalah menentukan rute pendistribusian agar diperoleh jarak tempuh dan ongkos transportasi yang minimum dengan mempertimbangkan kapasitas angkut kendaraan dan waktu pelayanan tertentu yang ditetapkan oleh para agen dengan menggunakan metode Nearest Insertion Heuristic. Metode Nearest Insertion Heuristic merupakan metode yang digunakan untuk evaluasi  kenaikan  minimum  jarak  antar pemasok dengan pemasok baru yang akan dikunjungi (pelanggan yang terdekat). Hasil penelitian ini adalah didapatkan rute, yaitu total jarak tempuh yang optimal sebesar 320,7 km dengan memberikan penghematan jarak 19,2% dan total waktu sebesar 17,16 jam dengan memberikan penghematan waktu 22,77 %. Biaya transportasi yang dikeluarkan sebesar Rp.1.086.321,- dengan memberikan penghematan biaya sebesar 22 %. Dengan demikian, dapat disimpulkan bahwa rute optimal metode nearest insertion heuristic lebih baik dari rute awal perusahaan.

A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows

1998 ◽  
Vol 46 (3) ◽  
pp. 330-335 ◽  
Author(s):  
Michel Gendreau ◽  
Alain Hertz ◽  
Gilbert Laporte ◽  
Mihnea Stan
Keyword(s):  
Traveling Salesman Problem ◽  
Time Windows ◽  
Traveling Salesman ◽  
The Traveling Salesman Problem ◽  
Insertion Heuristic

scholarly journals OPTIMIZATION OF GOODS DISTRIBUTION ROUTE ASSISTED BY GOOGLE MAP WITH CHEAPEST INSERTION HEURISTIC ALGORITHM (CIH)

SINERGI ◽  
2018 ◽  
Vol 22 (2) ◽  
pp. 132
Author(s):  
L. Virginayoga Hignasari ◽  
Eka Diana Mahira
Keyword(s):  
Minimum Distance ◽  
Traveling Salesman ◽  
Optimal Distribution ◽  
Total Distance ◽  
Completion Problem ◽  
Shortest Route ◽  
The Difference ◽  
The Traveling Salesman Problem ◽  
The Relationship ◽  
Insertion Heuristic

In the distribution of goods, the efficiency of goods delivery one of which was determined by the path that passed to deliver the goods. The problem of choosing the shortest route was known as the Traveling Salesman Problem (TSP). To solve the problem of choosing the shortest route in the distribution of goods, the algorithm to be used was Cheapest Insertion Heuristic (CIH). This study aims to determine the minimum distance traveled by using the CIH algorithm.  Researchers determine the route and distance of each place visited by using google map. The concept in the CIH algorithm was to insert an unexpired city with an additional minimum distance until all cities are passed to get the solution of the problem. The step completion problem with CIH algorithm was: 1) search, 2) making sub tour; 3) change the direction of the relationship, 4) repeat the steps so that all places are included in the sub tour. Theoretically, the total distance calculated using the CIH algorithm is 20.2 km, while the total distance calculated previously traveled with the ordered route is 25.2 km. There was a difference of 5 km with the application of CIH algorithm. The difference between the distance certainly has an impact on the optimal distribution of goods to the destination. Therefore, CIH algorithm application can provide a solution for determining the shortest route from the distribution of goods delivery.

scholarly journals Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem

2016 ◽  
Vol 2016 ◽  
pp. 1-15
Author(s):  
Ziauddin Ursani ◽  
David W. Corne
Keyword(s):  
Wide Spectrum ◽  
Statistical Significance ◽  
Worst Case ◽  
Case Complexity ◽  
Worst Case Complexity ◽  
Travelling Salesperson Problem ◽  
Insertion Heuristic

In this paper, complexity curtailing techniques are introduced to create faster version of insertion heuristics, that is, cheapest insertion heuristic (CIH) and largest insertion heuristic (LIH), effectively reducing their complexities fromO(n3)toO(n2)with no significant effect on quality of solution. This paper also examines relatively not very known heuristic concept of max difference and shows that it can be culminated into a full-fledged max difference insertion heuristic (MDIH) by defining its missing steps. Further to this the paper extends the complexity curtailing techniques to MDIH to create its faster version. The resultant heuristic, that is, fast max difference insertion heuristic (FMDIH), outperforms the “farthest insertion” heuristic (FIH) across a wide spectrum of popular datasets with statistical significance, even though both the heuristics have the same worst case complexity ofO(n2). It should be noted that FIH is considered best among lowest order complexity heuristics. The complexity curtailing techniques presented here open up the new area of research for their possible extension to other heuristics.

Sign in / Sign up

Export Citation Format

Share Document