Optimasi Rute Sales Coverage Menggunakan Algoritma Cheapest Insertion Heuristic Dan Layanan Google Maps Api

Abstract

Traveling Salesman Problem (TSP) is one of the distribution issues which is long discussed in the optimization review, where the review problem is how a salesman visits the entire travel route within the coverage area and returns to the starting point of departure with the rule that no destination should be visited more than once. PT. Panjunan is a company engaged in the products distribution of various principles. Currently the managing process of customer location data at the company is still not maximal due to the absence of calculations in every daily visit routes so it impact on the effectiveness of time. In addition, the absence of visualization of real customer data on the field leads to the error distribution and marketing of goods which is uneven, not on target and impact on the decline in sales value. One of the techniques used to accelerate the search solutions of TSP problems is to use an insertion algorithm, or also called the Cheapest Insertion Heuristic (CIH) algorithm. The discussion of this research is to study and apply CIH algorithm in determining the optimization of daily sales traffic route with the aim of this research is to make daily trip route optimization program by applying Cheapest Insertion Heuristics algorithm and provide real customer data visualization on original map in the field as analysis material for operational team and management by utilizing Google Maps API service. System development method used in this research using waterfall model with implementation tools is laravel framework and mySQL as DBMS.

Implementation of Cheapest Insertion Heuristic Algorithm in Determining Shortest Delivery Route

“…The selection of the new point is carried out simultaneously with the selection of the edge so that the minimum insertion value is obtained. Then the new point is inserted between the two points that make up the side that has been selected (Yulianto, 2018).…”

“…In TSP, the problem studied is to determine the shortest route that can be taken by a salesman who wants to visit several places without having to visit the same place more than once, and must return to the initial place of departure (Kusrini, 2007). One of the techniques used to speed up the search for solutions to the TSP problem is to use an insertion algorithm, also known as the Cheapest Insertion Heuristic (CIH) Algorithm (Yulianto, 2018).…”

Optimalisasi Produktivitas Dan Penjualan Mengunakan Metode Integer Programming

“…Selama menyelenggarakan organisasi, acapkali tujuan terarahkan ke upaya memperoleh hasil secara efisien dan efektif supaya maksimal. Optimalisasi juga bisa didefinisikan sebagai tahap untuk memperoleh kondisi yang bernilai maksimal dan minimal dari suatu peran (Yulianto & Setiawan, 2018).…”

Implementasi Algoritma Cheapest Insertion Heuristic dalam Menentukan Rute Pengiriman Barang

“…Pada TSP, masalah yang dikaji adalah mencari rute terpendek yang bisa dilalui salesman yang ingin mengunjungi beberapa kota tanpa harus mendatangi kota yang sama lebih dari satu kali dan harus kembali ke tempat awal keberangkatan [5] [6]. Salah satu teknik yang digunakan untuk mempercepat pencarian solusi masalah TSP adalah menggunakan algoritma penyisipan, atau disebut juga dengan Algoritma Cheapest Insertion Heuristic (CIH) [7].…”