Pencarian Rute Optimal Dengan Metode Steepest Ascent Hill Climbing Untuk Tempat Wisata Di Bandung Menggunakan Android

The lack of information on the path to tourist attractions makes tourists confused in choosing the shortest path. To overcome this, this study proposes an optimal route search system with the steepest ascent hill climbing method to find the most optimal route to tourist attractions. The search process for this tourist spot begins by looking for the latitude and longitude distance of each tourist spot along with the distance between tourist attractions using google maps, then the distance is entered into the steepest ascent hill climbing method with the initial stage of determining the number of combinations, where the combination results in the number of derivative trails. Then swap the initial path with the derivative path using graph theory. This process is repeated so that if the initial trajectory is smaller than the descended path, the effective route and route will be displayed on google maps. So based on the system testing conducted, the steepest ascent hill climbing method used as the main method of this research can be implemented in the search for the most effective or fastest route using the undirected graph method for the exchange process between tourist attractions

Decentralized Intelligent Search of Tourist Routes Based on Check-In Data

The location social network generates a large amount of data; these dada reflect the user's preferences and the popularity of the route, and a new model is provided for travel route search. Based on this demand, a problem of local distributed travel route search is proposed for group users. In this problem, the personal preferences of group users are combined, and an access route is found with partial POI (point of interest) and the largest group profit. The check-in data are used to generate a POI transfer relationship diagram based on the user's transfer between POIs, and route search is performed on the relationship diagram. In order to improve the search efficiency, a two-layer transfer relationship diagram is designed according to the popularity and transfer relationship of POI, the POI is generalized, and a hierarchical query is realized. A branch and bound search strategy optimization algorithm is designed, and the control relationship between nodes is used for pruning; the search efficiency of the algorithm is further improved.

Development and Implementation of an Arctic Sea Route Search System

With the reduction in extent of Arctic Ocean sea ice in recent years, commercial use of Arctic Sea shipping routes has attracted increasing attention. An urgent task for promoting the use of safe and cost-efficient routes in the Arctic Sea is the construction of a navigation support system. Such a system is essential not only for monitoring and forecasting the extent of sea ice but also for integrating such information in determination of the optimal route. This research developed an Arctic Sea Route Search System that has been published as a web application on the Arctic Data archive System website. Ship speed is calculated based on an approximate expression of actual Automatic Identification System data and an Ice Index, which is an index that reflects the ease of navigation based on ice type and the ship’s ice class. The A* algorithm searches for the optimal route using a search graph that places nodes at the grid positions of input data. Comparison of several test calculations using different parameters confirmed that the route search system provides reasonable results.

Pencarian Agen HNI-HPAI Terdekat Wilayah Kisaran Menggunakan Metode Haversine

HNI-HPAI is a network of halal-based companies in Indonesia that sell herbal products. HPAI has a variety of products, such as herbal medicine products for health, household products, and others. On the other hand, HPAI also has a certificate issued by the National Syari'ah Council-MUI which has complied with sharia principles in meeting the needs of the community, which currently pays attention not only top quality but also to its halalness. This study discusses the search for HNI-HPAI agents in Kisaran City who have difficulty finding the location of these agents, especially for people outside the Kisaran Area and buyers who do not know the location and the closest route for existing HNI-HPAI agents. in the Range Region. The results of this study are a web-based Geographic Information System for searching the nearest HNI-HPAI agent in the Kisaran area using the haversine method. Keywords: Geographical Information System; HNI-HPAI; Nearest Route Search; Haversine Method Abstrak: HNI-HPAI merupakan jaringan perusahaan berbasis halal di Indonesia yang menjual produk-produk herbal. HPAI mempunyai berbagai macam produk, seperti produk obat-obatan herbal untuk kesehatan, produk kebutuhan rumah tangga, dan lain-lain. Disisi lain HPAI juga sudah memiliki sertifikat yang dikeluarkan Dewan Syari’ah Nasional-MUI dimana sudah memenuhi prinsip syari’ah dalam memenuhi kebutuhan masyarakat yang saat ini tidak hanya memperhatikan kualitasnya saja, tetapi juga kehalalannya. Penelitian ini membahas mengenai pencarian agen-agen HNI-HPAI yang ada di Kota Kisaran yang memiliki masalah sulitnya dalam menemukan lokasi agen-agen tersebut khususnya bagi masyarakat yang ada di luar Wilayah Kisaran serta pembeli tidak tahu lokasi serta rute terdekat agen HNI-HPAI yang ada di Wilayah Kisaran. Hasil dari penelitian ini berupa Sistem Informasi Geografis pencarian agen HNI-HPAI terdekat Wilayah Kisaran berbasis web menggunakan metode haversine. Kata kunci: Sistem Informasi Geografis; HNI-HPAI; Pencarian Rute Terdekat; Metode Haversine

A Genetic-Algorithm-Based Optimization Routing for FANETs

In view of the characteristics of high mobility of FANETs nodes, combined with the features of Topology-based class routing protocol on-demand search, a Genetic-algorithm-based routing (GAR) protocol is proposed for FANETs which based on improved genetic algorithm for FANETs route search, and it taking into account the link stability, link bandwidth, node energy, and other factors. GAR improves the selection, crossover, and variation operators of the genetic algorithm so that GAR can finally plan an optimized route from the communication initiating node to the destination node quickly using a smaller cost. The experimental results show that GAR can largely improve the throughput, reduce the delay and improve the stability of the network, which is more suitable for FANETs.

SMSEI-SDN: A Suppression Method of Security Incident Impact for the Inter-Domain Routing System Based on Software-Defined Networking

Security incidents such as natural disasters and power outages can cause inter-domain routing system regional failures, significantly impact the Internet’s safety. Reducing the impact of security incidents is essential for maintaining the stability of the Internet. One of the major impacts of security incidents is that many UPDATE messages will generate, which may easily cause network oscillations. This paper presents the UPDATE messages analysis during the six security incidents and finds that many duplicates and invalid messages are the leading cause of network instability. To effectively process these UPDATE messages, this paper proposes an UPDATE message preprocessing algorithm by analyzing the UPDATE operating mechanism to remove duplicate and invalid messages. Aiming at the problem of slow route search in existing route update methods using software-defined networking (SDN), this paper designs a RIB hierarchical structure for multi-level retrieval and proposes SMSEI-SDN combination with current route update strategies. Experimental results show that when a security incident occurs, by removing duplicate and invalid messages, SMSEI-SDN can reduce the total number of messages by an average of 19% and a maximum of 34.9% within the 60 s of caching time. Besides, SMSEI-SDN can reduce the routing update time by more than 99.98% compared to existing methods. This work provides insights for network operators and researchers interested in security incident impact suppression in the inter-domain routing system.

Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing

With the constant growth of requirements to the quality of infocommunication services, special attention is paid to the management of information transfer in wireless self-organizing networks. The clustering algorithm based on the Motley signal propagation model has been improved, resulting in cluster formation based on the criterion of shortest distance and maximum signal power value. It is shown that the use of the improved clustering algorithm compared to its classical version is more efficient for the route search process. Ant and simulated annealing algorithms are presented to perform route search in a wireless sensor network based on the value of the quality of service parameter. A comprehensive routing method based on finding the global extremum of an ordered random search with node addition/removal is proposed by using the presented ant and simulated annealing algorithms. It is shown that the integration of the proposed clustering and routing solutions can reduce the route search duration up to two times.

Implementasi Algoritma Dijkstra pada Aplikasi Go-Tahu dengan Pencarian Rute Terpendek ke Pabrik Tahu

Currently, the food business sector is increasing, one of which is tofu producers in South Tangerang. Many people who want to buy tofu of good quality but do not know the closest distance to the factory is located. In this research, we will use Dijkstra's Algorithm which is applied to the Android software to determine the shortest distance from one point to the tofu factory which is the chosen destination. Using the Dijkstra algorithm, an application will be designed, namely a mobile-based Go-Tofu for finding the closest route to the tofu factory. The route search process is carried out with a graph that has a weight and an area that is connected to a predetermined route. In the application test, it produces the shortest route from a house to the tofu factory with the smallest total weight of 11 kilometers based on the test results in the study.Keywords:Dijkstra’s Algorithm, Android, Flutter, Shortest Line, Tofu Factory.