ITM Web Conf.
Volume 43, 2022The International Conference on Artificial Intelligence and Engineering 2022 (ICAIE’2022)
|Number of page(s)||10|
|Published online||14 March 2022|
Utilization of the Prim Algorithm to Determine the Nearest Path Car Transportation Problems of Goods Carrier Box
1 UPN “Veteran” Yogyakarta, Country Indonesia
2 Ibn Zohr University, Agadir, Country Marocco
Prim’s algorithm has been proven to be able to be used in determining the closest path, minimum spanning tree in the problem of transporting box cars carrying goods. Based on the results of theoretical analysis tests that have been carried out from several experimental data, it can be obtained results showing that, the results of Prim’s algorithm complexity are as follows O(n2). By defining n here is the number of vertices contained in the graph. So it can be concluded that, empirically, the data from the average travel time of this prim algorithm shows a graph that has a quadratic nature. As for the large number of edges contained in a graph, it has no effect on the complexity of finding the nearest path, the problem of transporting box cars carrying goods is a minimum spanning tree using the Prims algorithm.
Key words: Prim Algorithm / Transportation Problem
© The Authors, published by EDP Sciences, 2022
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.