PENCARIAN LINTASAN TERPENDEK DENGAN ALGORITME DIJKSTRA DAN MINIMUM SPANNING TREE DENGAN ALGORITME SOLLIN TERHADAP PERJALANAN WISATA SEJARAH DI KABUPATEN SUMENEP

Sumenep Regency is one of the districts on Madura Island where the tourism sector is experiencing rapid development and improvement. Sumenep Regency has a natural and cultural tourist attraction, making it a destination for tourists. Not only is the attraction of the culture of his cow easy, but Sumenep Regency has a very beautiful natural attraction. The condition of natural tourism consists of natural scenery, high hills, beaches, high asta and diversity of marine potential. One of the popular tourist objects is Pantai Pantai Sembilan, Gili Labak Island and Gilii which have the best oxygen levels in the world. Tourists from outside the region, especially those who first visited Sumenep Regency will have a little difficulty in accessing tourist attractions in this city because they do not know in detail the information about the location of these tourist attractions. The purpose of this research is to build an Android-based Geographical Information System using the Dijkstra Algorithm, which is expected to help tourists from outside the Sumenep City area in displaying routes from one tourist spot to another. The method that is the basis for designing this GIS is the Graph Method, by applying the shortest route search algorithm, Dijkstra's Algorithm. The expected results with this application are that it can help, simplify, and accelerate tourists in finding and obtaining information about the location of tourist attractions in Sumenep Regency. Based on the closest travel search trials using the Android Application it produces an accuracy of 95%.

To solve minimum exposure path (MEP) problem in wireless sensor networks more efficiently, this work proposes an algorithm called target guiding self-avoiding random walk with intersection (TGSARWI), which mimics the behavior of a group of random walkers that seek path to their destinations in a strange area. Target guiding leads random walkers move toward their end points, while self-avoiding prevents them from taking roundabout routes. Route intersections further accelerate the speed of seeking connected paths. Dijkstra algorithm (DA) is applied to solve MEP problem in a sub-network formed by multiple connected paths that walkers generate (called TGSARWI DA). Simulations show that the path exposure found by TGSARWI DA is very close to that by DA in the global network (Global DA), whereas the time complexity of computation is much lower. Compared with existing heuristic algorithms such as physarum optimization algorithm (POA), our algorithm shows higher generality and efficiency. This algorithm also exhibits good robustness to the fluctuations of parameters. Our algorithm could be very useful for the solution to MEP problem in fields with large- or high-density sensors.

The transportation main problems in a city is finding the shortest paths to reach a destination. Bandung city nowadays is experiencing high traffic. This study aimed to implement the algorithms for searching the shortest path. Many algorithms in finding the shortest paths are available. In this research, we tried a comparison between Bellman-Ford Algorithm and Dijkstra Algorithm to search the fastest path. This research used the roads in Bandung city as a case study. the initial node starts from Ir.H.Djuanda road and ends at Leuwipanjang terminal. The nodes passed are the main intersection in the Bandung city that can be skipped to the final destination. A Direct Comparison Approach method was used. The calculations have used a concept of graph and Haversine Formula for supporting a map obtained from Google Maps. The graph result was calculated using Bellman-Ford‘s Algorithm and Dijkstra's Algorithm. The results from the two algorithms were analyzed and compared. Both algorithms successfully found the best route. The result indicated that Dijkstra's algorithm can produce a shorter path compared with the Bellman-Ford Algorithm.

This paper suggests an algorithm that can shorten the complexity of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.

The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools.

This study presents the development of a Web-based Geographic Information System (Web GIS) aimed at mapping historical tourism sites in Sumenep Regency. The system integrates Location-Based Services (LBS) to enhance the delivery of spatial information and support tourism promotion. A prototype-based methodology was used in designing and building the application, which includes planning, requirements analysis, system design, data collection, and testing. The system architecture was modeled using UML diagrams, including use case, activity, and entity-relationship diagrams to ensure functionality and data integrity. Spatial and attribute data were collected through literature reviews and transformed into an interactive web platform that allows users to search for and visualize historical tourism locations. The system supports administrative features for data input and updates, alongside public-facing features such as maps and visitor statistics. Testing was conducted using black-box methods to verify the system’s performance and reliability. The final output is a fully functional Web GIS platform that enhances public access to tourism information and assists local authorities in managing tourism data effectively. This research contributes to the advancement of digital tourism infrastructure and promotes cultural heritage visibility in the region.

The Sumenep Regency Government since 2018 has planned to make Sumenep a tourism city. This is stated in the Sumenep Regency Government program called "Visit Sumenep 2018". As a region, tourism and culture play a major role in it, but the existing distribution of cultural tourism still has many shortcomings. This will certainly have an impact on the existence of historical cultural sites, visitor comfort and the economy of the community. The purpose of this study was to determine the strategic area of historical tourism in Sumenep Regency with 4A elements of culture (Attractions, Amenities, Accessibility and Ancilliary). The method used in this study is spatial analysis with consideration of 4A as a tourism supporter. The results of this study indicate that Sumenep Regency is a strategic area characterized by the interaction between 4A tourism and the distribution of historical and cultural tourism sites.
 Keywords: Spatial Analysis, Cultural History Tourism Site, Element 4A.

Purpose: Central Lombok Regency has many tourist attractions spread out, which often makes it difficult for tourists to determine the best travel route to visit several locations at once. Choosing the shortest route is an important factor because it can save time, energy, and fuel costs, especially in tourist trips with unstructured schedules. Therefore, an effective method is needed to determine the shortest route to improve the efficiency of tourist trips. This study analyzes the shortest route to tourist attractions in Central Lombok Regency using two popular graph algorithms, including Dijkstra Algorithm and Bellman-Ford Algorithms Method: In this study, the data used are 6 tourist attractions in Central Lombok Regency. Tourist attractions are represented by points on the graph. Then the edge represents the road connecting the tourist attractions and the weight represents the distance to each tourist attraction from a starting point. Then to determine the minimum shortest distance of each tourist attraction based on the graph, Dijkstra and Bellman-Ford algorithms are used. Result: The shortest path to tourist attractions in Central Lombok Regency is obtained based on the Dijkstra and Bellman-Ford Algorithms. Contribution: Through this analysis, the advantages and disadvantages of the two algorithms in the context of determining tourist routes in Central Lombok can be identified.

5 - Advanced Data Structures

The concept of a tree has been used in various areas of mathematics for over a century. In particular, trees appear to be one of the most fundamental notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods which seem to be inherently sequential. One of the contributions of this thesis is the introduction of several parallel techniques for the construction of various types of trees and the presentation of new parallel tree construction algorithms using these methods. Along with the parallel tree construction techniques presented here, we develop techniques which have broader applications. We use the Parallel Random Access Machine as our model of computation. We consider two basic methods of constructing trees: tree expansion and tree synthesis. In the tree expansion method, we start with a single vertex and construct a tree by adding nodes of degree one and/or by subdividing edges. We use the parallel tree expansion technique to construct the tree representation for graphs in the family of graphs known as cographs. In the tree synthesis method, we start with a forest of single node subtrees and construct a tree by adding edges or (for rooted trees) by creating parent nodes for some roots of the trees in the forest. We present a family of parallel and sequential algorithms to construct various approximations to the Huffman tree. All these algorithms apply the tree synthesis method by constructing a tree in a level-by-level fashion. To support one of the algorithms in the family we develop a technique which we call the cascading sampling technique. One might suspect that the parallel tree synthesis method can be applied only to trees of polylogarithmic height, but this is not the case.We present a technique which we call the valley filling technique and develop its accelerated version called the accelerated valley filling technique. We present an application of this technique to an optimal parallel algorithm for construction of minimax trees.

The cingkam tree (Bischofia javanica Blume) is a type of tree that can be found in various areas of Sumatra and Java. Cingkam trees have the potential to be developed regarding biodiversity assets and the ecosystem that surrounds them. The existence of this tree is threatened due to human activities such as habitat loss, overexploitation, pollution and climate change. Therefore, conservation efforts and sustainable use of Cingkam trees are needed. This research aims to determine data on the concept of the cingkam tree as a biodiversity asset in ecological learning. This study is a descriptive qualitative research. Data collection was carried out through observation, interviews and documentation. The data obtained was then analyzed using coding themes, identifying themes and drawing conclusions. The results showed that (1) cingkam trees (Bischofia javanica Blume) have unique characteristics and ecological roles, and can improve students' understanding of ecological concepts such as adaptation, symbiosis, and ecosystem services; (2) the integration of cingkam tree characteristics in learning was proven to foster greater awareness and appreciation of biodiversity conservation among students; (3) cingkam trees can make a significant contribution to ecological education to encourage students to actively participate in local biodiversity conservation efforts.

Improved TDV algorithm for three-dimensional space path planning in a complex radioactive environment with obstacles

In Wireless Sensor Networks, the power resources of the nodes are significantly restricted. Hence, a special treatment for their available energy is deeply required. In long distance transmission, Multi‐Hop (MH) techniques are preferred. Although MH minimizes the amount of energy cost consumed by each node along the path but finding the optimal routing path between nodes is still very interesting issues. This paper proposes a Balanced and Energy Efficient MH (BEEMH) algorithm that is developed based on Dijkstra algorithm. It gives great interest to the residual energy of nodes; hence higher energy nodes are exclusively elected to work as relays. Moreover, the total energy consumption at both TX and RX has been merged to model the weight of links between nodes. Finally, Dijkstra algorithm is employed to efficiently search for the minimum cost path. Furthermore, two proposed MH protocols are introduced. Both are mainly based on the BEEMH algorithm. MATLAB simulator has been used to evaluate BEEMH in comparison with other conventional algorithms such as; minimum transmission energy (MTE), energy saving oriented least‐hop routing algorithm (ESLHA), and energy saving‐oriented routing algorithm based on Dijkstra (ESRAD) under various scenarios of network models. Then the performance of our proposed protocols is compared with the related MH protocols.

An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and various such systems have been recently studied. For a successful economic ship routing system, an efficient algorithm is needed to search an optimal geographical path, and most of the previous systems were approaching to that problem through a minimal static-cost path search algorithm based on the Dijkstra algorithm. To apply that kind of search algorithm, the cost of every edge assigned with the estimated fuel consumption should be constant. However, that assumption is not practical at all considering that the actual fuel consumption is determined by the weather condition when the ship will pass the edge. To overcome such a limitation, we propose a new optimal ship routing system based on a minimal dynamic-cost path search algorithm by properly modifying the Dijkstra algorithm. In addition, we propose a method which efficiently reduces the search space by using the algorithm to decrease the running time. We compared our system with the shortest path-based sailing method over ten testing routes and observed that the former reduced the estimated fuel consumption than the latter by 2.36% on average and the maximum 4.82% with little difference of estimated time of arrival.

Rao-combined artificial bee colony algorithm for minimum dose path planning in complex radioactive environments