Figure 1 - uploaded by Andysah Putera Utama Siahaan
Content may be subject to copyright.
Similar publications
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how to check them. Moreover, we show that, for any finite group $G$ and any subgroup $P$ of the $d$-dimensional hyp...
This study aims to find the proper distance calculation method that will be applied to the Sidoarjo on Hands (SoH) application. This study was conducted by comparing three distance algorithms namely Euclidean Distance, Manhattan Distance, and Haversine Formula. The results showed that the Euclidean Distance method was the proper method because this...
One derivative type of the constant modulus algorithm (CMA) termed hierarchical CMA (HCMA) is investigated for its parallel implementation with 8 lanes. Taking the essence of CMA, HCMA is also the steepest descent under the least mean-square (LMS) criterion theoretically. To update the tap coefficients of the equalizer, HCMA utilizes adjustable mod...
Citations
... The Prim algorithm is a classical algorithm of graph theory, which can be used to find the minimum path of the network population in weighted graphs [32]. The algorithm entails finding the optimal path through greedy strategies. ...
Cluster routing is a critical routing approach in wireless sensor networks (WSNs). However, the uneven distribution of selected cluster head nodes and impractical data transmission paths can result in uneven depletion of network energy. For this purpose, we introduce a new routing strategy for clustered wireless sensor networks that utilizes an improved beluga whale optimization algorithm, called tCBWO-DPR. In the selection process of cluster heads, we introduce a new excitation function to evaluate and select more suitable candidate cluster heads by establishing the correlation between the energy of node and the positional relationship of nodes. In addition, the beluga whale optimization (BWO) algorithm has been improved by incorporating the cosine factor and t-distribution to enhance its local and global search capabilities, as well as to improve its convergence speed and ability. For the data transmission path, we use Prim's algorithm to construct a spanning tree and introduce DPR for determining the optimal route between cluster heads based on the correlation distances of cluster heads. This effectively shortens the data transmission path and enhances network stability. Simulation results show that the improved beluga whale optimization based algorithm can effectively improve the survival cycle and reduce the average energy consumption of the network.
... The Shortest Path Problem (SPP) specializes in determining the shortest distance between two nodes [7]. Several studies have solved the optimization problem using FWA and also the integration of MCDM-FWA method. ...
... There are lots of shortest path calculation methods that can be applied to find the optimal route between destinations, such as Dijkstra [36], A* [37], Floyd-Warshall [38,39], etc.. However, the most common algorithm used in calculating the shortest path is Dijkstra and A* [40][41][42][43]. ...
Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.
... Optimization can also use Prim algorithm to design autonomous drone controls in packet delivery (Wirabudi, Hafiza, and Fachrurrozi 2022) and determine the shortest or fastest path in logistics distribution (Lusiani, Sartika, Habinuddin, et al. 2021). The Prim algorithm can be compared to the Floyd-Warsall algorithm in optimization to determine the shortest path (Ramadhan, Siahaan, and Mesran 2018). Using a methodology based on the Prim Algorithm, we can improve the reliability index using artificial immune system techniques by applying graph theory considerations to improve computational performance and Pareto's rule of dominance (Alonso, Oliveira, and De Souza 2014). ...
The determination of the shortest route can be done using various methods, one of which is the Dijkstra algorithm. This algorithm is often used in routing problems with minimum weight in computer networks, communication networks and transportation networks. There are several applications of the Djikstra algorithm, namely solving the problem of the shortest path of neutrosophy, mapping tourism potential, and developing geographic information systems in the health sector. In this research, Dijkstra algorithm will be applied to optimize the mileage of the delivery of goods packages. Data and information namely the address, weight and number of customer packages carried by a courier in one delivery trip are obtained from the drop point of PT. J&T Express in Sarijadi area of Bandung City. Meanwhile, data about mileage is obtained from the Google Maps application. All this data is used to construct an initial model graph that is a connected weighted graph, where the location of a drop point or a customer is a vertex and a road connecting two locations is an edge on the graph. The weight in this graph is the mileage from the drop point to the customers or from one customer to another. Then, the Djikstra algorithm is run on this graph where the drop point is the starting point of the route, so that the courier visits all customers and returns again to the drop point. The resulting route is a cycle in the graph which is the shortest closed route at 1890 meters.
... Ramadhan ve diğ. ise Floyd-Warshall ve Prim algoritmalarının kıyaslamasını sunarak en kısa yol problemini ele almışlardır [23]. Çakır vd. ...
Logistics centers are important facilities which served possible transportation methods together and and carried out activities in harmony with each other such as transportation, storage, handling, distribution, consolidation, customs clearance, sorting, import, export and transit transactions, insurance and banking, infrastructure services, consultancy and production, etc. Due to the continuous demand for freight, freight transportation must be realized uninterrupted, in the shortest way, and optimal in terms of fuel consumption and transportation time. In this study, the problem of transportation of freight trains to logistics centers by the shortest route is discussed. When the literature on logistics villages is scanned; The contributions of logistics centers to the logistics sector have been examined, their strengths and weaknesses have been tried to be revealed, and studies on suggestions for effective and efficient operation have been observed. But in this study; with an engineering applications approach to the subject, it is aimed to obtain the most appropriate result for the route selection among the logistics centers by including twelve logistics centers operating throughout the country as well as seven logistics centers that are in the construction and tender stages, in the scope of the study. In generally the application area of the shortest path problems is to determine the shortest distance between the points in a network, the Floyd-Warshall Algorithm is preferred in this study in terms of determining the shortest path between any two nodes in the network. For this purpose, a graph consisting of a total of 33 nodes was created for the national railway network and the Floyd-Warshall algorithm was coded in the Python programming language to calculate the shortest route and the shortest route were determined between a total of nineteen logistics centers.
... Floyd-Warshall algorithm can calculate the smallest weight of all paths that connect between a pair of vertices and is carried out at the same time. Comparing all possible paths on each edge of all vertices in the graph (Ramadhan, Siahaan, & Mesran, 2018). ...
Vehicles that are increasingly needed by the community increase the volume of vehicle traffic, resulting in a high demand for parking spaces. Especially in public places such as campuses, offices, shopping centers, and other places. A parking lot is also needed that has a maximum capacity by determining the layout of the vehicle mileage in finding a parking location. In this paper, we are looking for the shortest path in the car park layout at FMIPA UNPAD using the Floyd-Warshall algorithm.
... In the evaluation of the previously initialized solution, the way-points represented by the genes g − i and g − i + 1 in the chromosome may not be adjacent. In this case, the travel cost and intermediate visited nodes correspond to a shortest path between the way-points are determined by using Floyd-Warshall (Ramadhan et al., 2018) algorithm. ...
This study addresses the monitoring mission problem using an USV equipped with an on-board LiDAR allowing to monitor regions inside its coverage radius. The problem is formulated as a bi-objective coverage path planning with two conflicting objectives : minimization of the consumed energy and maximization of the coverage rate. To solve the problem, we use two popular multi-objective evolutionary algorithms : Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and Pareto Archived Evolution Strategy (PAES). First, we compare the efficiency of these two algorithms and show that PAES allows to find solutions allowing to save more energy as compared to those provided by NSGA-II. Then, we propose a new method which improves the performance of evolutionary algorithms when solving covering path planning problems by reducing the chromosome size. We have applied this method on the used algorithms and simulation results shows a significant performance enhancement both PAES and NSGA-II.
... Da mesma forma que os demais algoritmos de busca, o algoritmo de Floyd-Warshall calcula os menores pesos de todos os caminhos que conectam um par de pontos, mas o faz em simultâneo para todos os pares de pontos. Outro ponto diferencial deste algoritmo é que ele aceita pesos negativos, enquanto os demais não permitem (Ramadhan, Siahaan and Mesran, 2018;Zhang et al., 2018). ...
... Durante o processo de execução o algoritmo usa a matriz de adjacência para armazenar arestas ao encontrar e encontrar caminho mais curto entre quaisquer dois pontos, somando os pesos destas arestas. Ele compara todos os caminhos possíveis no grafo e estima a seleção do caminho mais curto a cada estágio entre dois vértices até que seja conhecida o valor ótimo (Ramadhan, Siahaan and Mesran, 2018;Zhang et al., 2018). ...
In order to seek alternatives to accelerate the solution process in a reconfiguration problem, this article uses the notions of graph theory to propose the exploration of different techniques oriented to the topological decomposition of a distribution system and the search for paths with lower cost. The methodological process is divided into the presentation of algorithms for topological reduction, followed by the presentation of alternatives to the search for shortest paths. The results showed better performance for the decomposition performed by the Malgrange algorithm, bringing brevity to the process and similarity between the results of the short path search algorithms.
... The first experiment is aimed at determining the number of recursive steps that the VR computation algorithm should take to reach a satisfactory increase in coverage (close to that obtained by applying an exhaustive search of each user's direct and indirect near neighbourhoods), while additionally maintaining computational efficiency. More specifically, we have implemented an exhaustive search algorithm (Floyd-Warshall [45]) to find the maximum increase in coverage that can be obtained through the application of the CF VR algorithm. This maximum is reached when the algorithm in Listing 1 is permitted to search the complete direct and indirect near neighbourhood of each user U to compute VRs, which will then be exploited to formulate recommendations to U. To promote efficiency, however, it is possible to confine the search to a subset of each user's (direct and indirect) near neighbourhood; in this paper, we use the neighbourhood radius as a criterion for confining the search. ...
Collaborative filtering-based recommendation systems consider users’ likings and interests, articulated as ratings within a database to offer personalized recommendations. Unfortunately, many collaborative filtering datasets exhibit the “grey sheep” phenomenon, a state where no near neighbours can be found for certain users. This phenomenon is extremely frequent in datasets where users, on average, have rated only a small percentage of the available items, which are termed as sparse datasets. This paper addresses the “grey sheep” problem by proposing the virtual ratings concept and introduces an algorithm for virtual rating creation on the basis of actual ratings. The novelty behind this concept is that the introduction of the virtual ratings effectively reduces the user–item rating matrix sparsity, thus alleviating the aforementioned problem. The proposed algorithm, which is termed as CFVR, has been extensively evaluated and the results show that it achieves to considerably improve the capability of a collaborative filtering system to formulate tailored recommendations for each user, when operating on sparse datasets, while at the same time improves rating prediction quality.
... done with the Floyd-Warshall algorithm [15], which runs in O(|V | 3 ). Although the temporal complexity of this step is high, it is still a polynomial running time (cubic) depending on the size of the input. ...
We present GeoSP, a parallel method that creates a parcellation of the cortical mesh based on a geodesic distance, in order to consider gyri and sulci topology. The method represents the mesh with a graph and performs a K-means clustering in parallel. It has two modes of use, by default, it performs the geodesic cortical parcellation based on the boundaries of the anatomical parcels provided by the Desikan-Killiany atlas. The other mode performs the complete parcellation of the cortex. Results for both modes and with different values for the total number of sub-parcels show homogeneous sub-parcels. Furthermore, the execution time is 82 s for the whole cortex mode and 18 s for the Desikan-Killiany atlas subdivision, for a parcellation into 350 sub-parcels. The proposed method will be available to the community to perform the evaluation of data-driven cortical parcellations. As an example, we compared GeoSP parcellation with Desikan-Killiany and Destrieux atlases in 50 subjects, obtaining more homogeneous parcels for GeoSP and minor differences in structural connectivity reproducibility across subjects.
