Analysis Determination Of Shortest Route Delivery Using Dijkstra Algorithm

Lestari S A, Puspa A K


Over the rapid technological developments in the field of business especially now a lot of companies that create delivery services goods. With various bustle owned, service users delivery of goods more want something practical, fast, and economical especially for local communities urban areas. In perform delivery services goods  main concern is the time and cost efficiency, by sending goods via freight, of course we expect the optimal route in order to arrive on time and do not takes a lot of travel expenses such as gasoline. The shortest route problem is a classic problem often encountered in daily life in various sectors of life, including in the field of transportation. This problem becomes an important issue because it deals with the problem minimizing the cost and time required efficiency. Shortest path is the search for the shortest route or path between nodes that exist in graph. Cost generated is minimum. the shortest path is one problem that can be solved by using graph. if given a weighted graph, the shortest path problem is how do we seek a path in the graph that minimizes the weighted sum forming the side of the track. (arix oyouz: 2013). Transport is one of the most important part in our daily lives that will enable us to reach the place of destination faster and eficient. Transport users in his journey would require so much faster shortest path to the place of destination and it takes a lot of time and transport costs

Full Text:



Bilqis Amaliah, CF (2016). Finding the Shortest Paths Among Cities In Java Island Node Using

Combination Based On Dijkstra Algorithm,16.International journal on smart sensing and

intelligent systems vol 9, No. 4, December 2016.

Edsger W, 1 (2015).About Dijkstra'salgorithm.Retrieved February 12, 2017, from

(Harsono, 2 (nd). 9 understanding Implementation according toexperts.Retrieved February 11,

, from> Management:

Murdick, RG (2014). 36 Understanding System According to theexperts.Retrieved February 12,

, from http: //hedisasrawan.blogspot / 2014/01/25definition-system-by-the-ahli.html

RJ (2013). definition According to expertanalysis.Retrieved February 11, 2017, from https: / /

S. Sivakumar, DC (nd). International Journal on Recent and Innovation Trends in Computing and

Communications ISSN: 2321-8169 Volume: 2 Issue: 3. Rallway Route Optimization System

Using Dijkstra Method,8.

S., M. (2010). Understanding observation method definition.Retrieved February 12, 2017, from = utf-8 & aq = t &

rls = org.mozilla: en-US: official & client = firefox-a

Sri Andayani, EW (2014). ISBN: 979-29-0276-3. Determination Shortest These Merauke City

Trash Collection Using Dijkstra's algorithm,7.

Mandy Anisiyah, FA (2011). vol. 6. 3 September 2011. The determination of Rue Shortest

Towards Health Centers Based Dijkstra Method Using WebGIS,6


  • There are currently no refbacks.

International Conference on Engineering and Technology Development (ICETD)
Bandar Lampung University
ISSN: 2301-5690