Flight-schedule using Dijkstra's algorithm with comparison of routes findings

<span>The Dijkstra algorithm, also termed the shortest-route algorithm, is a model that is categorized within the search algorithms. Its purpose is to discover the shortest-route, from the beginning node (origin node) to any node on the tracks, and is applied to both directional and undirected graphs. However, all edges must have non-negative values. The problem of organizing inter-city flights is one of the most important challenges facing airplanes and how to transport passengers and commercial goods between large cities in less time and at a lower cost. In this paper, the authors implement the Dijkstra algorithm to solve this complex problem and also to update it to see the shortest-route from the origin node (city) to the destination node (other cities) in less time and cost for flights using simulation environment. Such as, when graph nodes describe cities and edge route costs represent driving distances between cities that are linked with the direct road. The experimental results show the ability of the simulation to locate the most cost-effective route in the shortest possible time (seconds), as the test achieved 95% to find the suitable route for flights in the shortest possible time and whatever the number of cities on the tracks application.</span>

Analysis of Security Vulnerability Levels of In-Vehicle Network Topologies Applying Graph Representations

This article investigates cybersecurity issues related to in-vehicle communication networks. In-vehicle communication network security is evaluated based on the protection characteristics of the network components and the topology of the network. The automotive communication network topologies are represented as undirected weighted graphs, and their vulnerability is estimated based on the specific characteristics of the generated graph. Thirteen different vehicle models have been investigated to compare the vulnerability levels of the in-vehicle network using the Dijkstra's shortest route algorithm. An important advantage of the proposed method is that it is in accordance with the most relevant security evaluation models. On the other hand, the newly introduced approach considers the Secure-by-Design concept principles.

The Sea Route Planning for Survey Vessel Intelligently Navigating to the Survey Lines

Marine surveying is an important part of marine environment monitoring systems. In order to improve the accuracy of marine surveying and reduce investment in artificial stations, it is necessary to use high-precision GNSS for shipborne navigation measurements. The basic measurement is based on the survey lines that are already planned by surveyors. In response to the needs of survey vessels sailing to the survey line, a method framework for the shortest route planning is proposed. Then an intelligent navigation system for survey vessels is established, which can be applied to online navigation of survey vessels. The essence of the framework is that the vessel can travel along the shortest route to the designated survey line under the limitation of its own minimum turning radius. Comparison and analysis of experiments show that the framework achieves better optimization. The experimental results show that our proposed method can enable the vessel to sail along a shorter path and reach the starting point of the survey line at the specified angle.

PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

This study aims to determine the shortest route in the application of online transportation services which is the main attraction for entrepreneurs who want to start looking for their fortune in technology and transportation, given the enormous opportunity where the human population is very large. increased, and some human activities had to be carried out. fulfilled. Some online transportation service companies use paid features provided by Google to determine the shortest distance and route, thus costing a lot of money. In this study, to determine the shortest route on a journey, it is necessary to calculate using an algorithm method, namely the dijkstra algorithm which is an algorithm used to solve the problem of the shortest route or the shortest path from one point to another at a point. weighted graph, The distance between vertices is the weight value of each edge in the graph. A graph that has a weight must be positive (weight >= 0). Dijkstra's algorithm itself uses a greedy strategy in its operation, where in each step the chosen one with the smallest weight connects the selected node with other nodes that have not been selected. Keywords: dijkstra algorithm, online transportation service, shortest route,

The Mathematical Model for searching the Shortest Route for TB Patients with the help of Dijkstra’s Algorithm

In this research paper, we have studied TB (Tuberculosis) patients who come from different traffic routes in order to seek medical help and treatment in Karachi, Sindh, Pakistan. In this research work, we have focused on the transportation problems of the TB patients. These TB patients can travel on the paths having minimum distance as found out in this paper using Dijktra’s Algorithm. People hope that they have better treatment opportunities and financial medical relief in the government and private hospitals in Karachi. There are many private hospitals in the city but unfortunately, they provide expensive treatments. As a consequence, people belonging to the poor or lower and middle classes approach government hospitals adequately. Among them, Nazimabad Chest Hospital for TB patients (under the supervision of Dow University of Health Sciences) is providing better facilities as compared to the other hospitals involved in providing medical treatments for the similar medical issues. Nazimabad Chest Hospital for TB patients is renowned for its high quality treatment of TB patients. The hospital is located inside Government Hospital Nazimabad (under the control of Dow University), Karachi. It has latest equipments, competent and qualified staff to treat TB patients. Patients have to visit the hospital on weekly basis from their homes and residences. They use several combinations of traffic routes to reach the hospital as these patients live in different areas like, Malir Cantt, Safari Park, Hassan Square, North-Nazimabad, North Karachi, Gulshan-e-Iqbal, etc. A path or road is required which takes the least amount of time and subsequently reduces the transportation charges. In this paper, an effort has been made to locate the shortest route for the convenience for these TB patients. In this paper, a mathematical model has been developed by using the method of Dijkstra’s algorithm to attain the desired objective.

Determination of the Shortest Route on the Distribution System using Ant Colony Optimization (ACO) Algorithm (Case Study: Alfamidi Palu Branch – PT. Midi Utama Indonesia)

The distribution system of goods is one of the most important parts for every company. The company certainly has many route options to visit, and this is expected to be conducted efficiently in terms of time. In the distribution of goods by Alfamidi company in Palu City which has 51 outlets include into the category of Traveling Salesman Problem (TSP) because of many route options that can be visited. The problem can be solved by employing the Ant Colony Optimization (ACO) method which is one of the algorithms Ant Colony System (ACS). The ACS acquires principles based on the behavior of ant colonies and applies three characteristics to determine the shortest route namely status transition rules, local pheromone renewal and global pheromones. The result showed that the shortest route of the distribution of goods based on the calculation of selected iterations was ant 1 with the shortest total distance obtained 86.98 km.

Artificial Intelegence Pemanfaatan Metode Hill Climbing Mencari Lintasan Terpendek Objek Wisata Menggunakan sistem Informasi

The search is often used to search for the shortest route, the Hill Climbing Method is a part of the test that uses heuristic functions. The problem that is often encountered is in the form of miscalculations in calculating the distance so that it requires long distances, costs a lot and takes a very long time. To solve this case, it can be solved by making a structure graph by looking at the city points from the two sides of the point to be passed. Using an algorithm can help make it easier to find a location and save time and travel costs that will be passed. This advantage is that all points will be obtained and checked from the right and left sides one by one so as to obtain effective and maximum results. The Hill Climbing method that will be used has the concept of a geographic information system as a guide and is used as a system for decision making. The heuristic search method is one of the methods commonly used in finding a way

APLIKASI ALGORITMA FLOYD-WARSHALL DENGAN PENDEKATAN MADM DALAM MENENTUKAN RUTE TERPENDEK PENGANGKUTAN SAMPAH

Currently, the problem of environmental hygiene caused by the accumulation of garbage becomes a serious problem for every community. In addressing this problem, an efficient waste transport process is required. This study aims to find the shortest route of garbage transportation in Gorontalo city by using Floyd Warshall Algorithm by finding the smallest weight between each point (Vertex). In this study, the weights used in the Floyd Warshall Iteration Algorithm were Alternative weights obtained by the Multi-Attribute Decision-Making approach (MADM). The criteria for determining weights in MADM use three indicators that affect the efficiency of garbage transportation, namely Distance, time, and congestion. The route used in this study is the dump truck route with 17 garbage transportation points. After obtaining the Alternate weight and iteration using Floyd Warshall algorithm obtained the shortest route with the smallest trajectory weight of 110.845.

Framework proposal for adaptive mobile intelligent agents

Intelligent agents are computational entities which have elements that provide them with the ability to perceive and manipulate their environment: sensors and actuators. These are characterized by displaying various properties that adapt and achieve their objectives. Autonomy, learning, collaboration and reasoning are examples of these properties which together make them intelligent artificial entities. This article shows the development of a framework that has made it possible to speed-up the construction of a system of adaptive mobile intelligent agents, called SySAge. The system agents have integrated search and learning techniques for the execution of automated processes focused on solving search, classification and optimization problems. It has been found that through learning, the agents were able to estimate input parameters and apply them in estimating the shortest route in a graph, considering cost and penalty aspects. To determine the choice of search technique, a probabilistic selection was used. The autonomous behavior of each agent was appreciated through the various attempts to solve the search problem and not to focus the information acquired individually on a single agent.

The Effect of Navigation Demand on Decision Making in a Dynamic, Sport-Inspired Virtual Environment

Athletes commonly make decisions about the passability of closing gaps when navigating sport environments. This study examined whether increased temporal pressure to arrive at a desired location modifies these decisions. Thirty participants navigated toward a waypoint in a virtual, sport-inspired environment. To do so, they had to decide whether they could pass through closing gaps of virtual humans (and take the shortest route) or steer around them (and take a longer route). The decision boundary of participants who were time pressured to arrive at a waypoint was biased toward end gaps of smaller sizes and was less reliably defined, resulting in a higher number of collisions. Effects of temporal pressure were minimized with experience in the experimental task. Results indicate that temporal pressure affects perceptual–motor processes supporting information pickup and shapes the information–action coupling that drives compliance with navigation demands. Theoretical and practical implications are discussed.