Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Penentuan Rute Terpendek Pengiriman Barang pada PT AMSA menggunakan Algoritma Dijkstra

View through CrossRef
Dijkstra's algorithm is one of the algorithms in graph theory that is used to solve the problem of the shortest path of a graph at each vertex that has a non-negative value. This algorithm was discovered by Edsger Wybe Dijkstra, a scientist from the Netherlands. The search for the shortest route for product delivery can be calculated through the application of the Dijkstra algorithm in the problem being faced. The problem of decision making for selecting the shortest route is still manual, so it experiences several obstacles, including the absence of a systematic and computerized system to assist the decision-making process in determining the route for shipping goods, the determination of shipping routes still depends on manual estimates so that the time taken between deliveries becomes inconsistent, the operational costs of shipping are relatively high because there is no optimal route determination system. Facing these problems, a system is needed that can minimize delays and increase effectiveness in shipping goods, namely determining the shortest route using the Dijkstra algorithm. This system works by finding various alternative routes for shipping goods at PT AMSA to address various structured and unstructured problems using data and models. To process this data and models, a method called the Dijkstra algorithm is required. Based on the description above, researchers will create a method for determining the shortest route for shipping goods at PT AMSA using the Dijkstra algorithm to facilitate the company's process of determining the shortest route.
Title: Penentuan Rute Terpendek Pengiriman Barang pada PT AMSA menggunakan Algoritma Dijkstra
Description:
Dijkstra's algorithm is one of the algorithms in graph theory that is used to solve the problem of the shortest path of a graph at each vertex that has a non-negative value.
This algorithm was discovered by Edsger Wybe Dijkstra, a scientist from the Netherlands.
The search for the shortest route for product delivery can be calculated through the application of the Dijkstra algorithm in the problem being faced.
The problem of decision making for selecting the shortest route is still manual, so it experiences several obstacles, including the absence of a systematic and computerized system to assist the decision-making process in determining the route for shipping goods, the determination of shipping routes still depends on manual estimates so that the time taken between deliveries becomes inconsistent, the operational costs of shipping are relatively high because there is no optimal route determination system.
Facing these problems, a system is needed that can minimize delays and increase effectiveness in shipping goods, namely determining the shortest route using the Dijkstra algorithm.
This system works by finding various alternative routes for shipping goods at PT AMSA to address various structured and unstructured problems using data and models.
To process this data and models, a method called the Dijkstra algorithm is required.
Based on the description above, researchers will create a method for determining the shortest route for shipping goods at PT AMSA using the Dijkstra algorithm to facilitate the company's process of determining the shortest route.

Related Results

SIMULASI ALGORITMA A* DAN DIJKSTRA PADA WAN
SIMULASI ALGORITMA A* DAN DIJKSTRA PADA WAN
Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan...
SIMULASI ALGORITMA A* DAN DIJKSTRA PADA WAN
SIMULASI ALGORITMA A* DAN DIJKSTRA PADA WAN
Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan...
Simulasi Algoritma A* Dan Dijkstra Pada WAN
Simulasi Algoritma A* Dan Dijkstra Pada WAN
Perubahan kompleksitas jalur pada internet sejalan dengan meningkatnya perkembangan internet. Sehingga Network flow optimization menjadi permasalahan utama terkait dengan pemilihan...
Algoritma Tabu Search untuk Graf Optimasi Rute Pengiriman Barang
Algoritma Tabu Search untuk Graf Optimasi Rute Pengiriman Barang
Abstrak. Dalam industri jasa ekspedisi, efisiensi rute pengiriman barang sangat penting untuk menekan biaya operasional dan meningkatkan kepuasan pelanggan. Dengan meningkatnya vol...
Abstrak: Algoritma Dijkstra merupakan algoritma yang dapat mendukung pencarian rute tercepat dengan memetakan lintasan alternatif dalam mencari rute perjalanan. Tujuan dari penelit...
Pencarian Jalur Terpendek dengan Algoritma Dijkstra
Pencarian Jalur Terpendek dengan Algoritma Dijkstra
Abstrak — Persoalan dalam menemukan jalur terpendek seiring dengan penghematan waktu yang tersingkat. Hal ini menjadi penting dalam kedinamisan masyarakat perkotaan. Jumlah rute ya...

Back to Top