Implementation of Dijkstra Algorithm and Multi-Criteria Decision-Making for Optimal Route Distribution

Rosita, Yesy Diah; Rosyida, Erly Ekayanti; Rudiyanto, M. Adik

doi:10.1016/j.procs.2019.11.136

Cited by 37 publications

(30 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It should be added that more and more often in computer-aided systems of choosing the optimal distribution routes for goods, multi-criteria mathematical models are used, which take into account many qualitative and quantitative parameters; this requires their additional standardization and determination of their priority level [52]. An example is the work of Aghalari et al [53], in which they presented the problem of optimizing the entire biomass-to-pellet supply system.…”

Section: Discussionmentioning

confidence: 99%

Estimating the Optimal Location for the Storage of Pellet Surplus

Bochniak

Stoma

2021

Energies

View full text Add to dashboard Cite

This paper deals with the problem of managing the surplus that arises during the seasonal production of pellets, which will be sold in the period of increased demand. Dijkstra’s algorithm is used in issues connected with finding a new storage place with a view of the optimisation of the transport costs of pellets produced by a company in 18 different towns in the Lubelskie Voivodeship in Poland. The most optimal location for the new pellet storage site has been determined, for which the total length of the traveled routes is the shortest, taking into account the actual shares of individual plants in the total production. The construction of the graph with the shortest paths was made on the basis of the existing network of available transport roads, and the nodes of the graph were their intersections. The most advantageous storage location of pellets was identified by the calculation the total transport cost using a minimum-cost tree of shortest paths. Based on the estimated transport assumptions, the lowest total cost of transport from all 18 plants was 3092.0 (km), which corresponds to an average distance to production plants of 89.7 km and 61.7 km to estimated selling distribution. The new storage point is suggested near the town of Piaski. Average cost of travel for all trees obtained for existing plant locations and subsequent distribution to points of sale was 4113.7 (km), while standard deviation 735.2 (km). Additionally, a relative increase in costs was estimated in the case of selecting other locations. Using spatial interpolation and geoprocessing tools, a map—showing the increase in pellet transport costs in relation to the most optimal solution—was developed. The constructed map allows for a better analysis of cost increases than a single point. It was stated that the increase in transport costs does not exceed 10% of lowest cost for 17.6% area of studied area. It was found that the most convenient area is shifted to the south of the voivodship and improperly adopted storage location can increase transport costs by up to 75%.

show abstract

Section: Discussionmentioning

confidence: 99%

Estimating the Optimal Location for the Storage of Pellet Surplus

Bochniak

Stoma

2021

Energies

View full text Add to dashboard Cite

show abstract

“…The Graphhopper routing service based on Dijkstra algorithm was used for the comparison experiments in this paper. [27] proposed a multi-criterion decision making of optimal route based on Dijkstra algorithm.…”

Section: Algorithm Implementation and Evaluationmentioning

confidence: 99%

A Dynamic and Scalable User-Centric Route Planning Algorithm Based on Polychromatic Sets Theory

Wang

Gao

et al. 2022

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

Existing navigation services provide route options based on a single metric without considering user's preference. This results in the planned route not meeting the actual needs of users. In this paper, a personalized route planning algorithm is proposed, which can provide users with a route that meets their requirements. Based on the multiple properties of the road, the Polychromatic Sets (PS) theory is introduced into route planning. Firstly, a road properties description scheme based on the PS theory was proposed. By using this scheme, users' travel preferences can be quantified, and then personalized property combination schemes can be constructed according to these properties. Secondly, the idea of setting priority for road segments was utilized. Based on a user's travel preference, all the property combination schemes can be prioritized at relevant levels. Finally, based on the priority level, an efficient path planning scheme was proposed, in which priority is given to the highest road segments in the target direction. In addition, the system can constantly obtain real-time road information through mobile terminals, update road properties, and provide other users with more accurate road information and navigation services, so as to avoid crowded road segments without excessively increasing time consumption. Experiment results show that our algorithm can realize personalized route planning services without significantly increasing the travel time and distance. In addition, source code of the algorithm has been uploaded on GitHub for this algorithm to be used by other researchers.

show abstract

“…Diagram alir penelitian (flowchart) mengacu pada [5], terdiri atas beberapa tahapan yang dilakukan secara komprehensif. Tahapan-tahapan ini dilakukan guna mendapatkan hasil review yang mendalam berdasarkan artikel-artikel yang dipilih.…”

Section: A Diagram Alir Penelitianunclassified

Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah

Hakim¹,

Satria²,

Arief³

et al. 2021

Expert. Jurnal. Sistem. Inf. dan. teknologi

View full text Add to dashboard Cite

Dijkstra is a greedy algorithm that gives a choice of several available shortest routes and then provides a solution. The application of Dijkstra's Algorithm in everyday life is very diverse. This study collects research results regarding the application of Dijkstra's Algorithm to solve everyday problems such as the shortest path problem, this mini-review paper can explain the study of Dijkstra's Algorithm for various things, including solving bi-objective shortest routes, multi-objective routes, emergency evacuation, Dijkstra's graph, the connection between LBS features, best route distribution, and fuzzy solution.

show abstract

Implementation of Dijkstra Algorithm and Multi-Criteria Decision-Making for Optimal Route Distribution

Cited by 37 publications

References 6 publications

Estimating the Optimal Location for the Storage of Pellet Surplus

Estimating the Optimal Location for the Storage of Pellet Surplus

A Dynamic and Scalable User-Centric Route Planning Algorithm Based on Polychromatic Sets Theory

Aplikasi Algoritma Dijkstra dalam Penyelesaian Berbagai Masalah

Contact Info

Product

Resources

About