scholarly journals PENERAPAN ALGORITMA DIJKSTRA PADA APLIKASI JASA TRANSPORTASI ONLINE DI KOTA MEDAN

2022 ◽  
Vol 7 (1) ◽  
Author(s):  
Abdul Alfattah Hidayah
Keyword(s):  
Weighted Graph ◽  
Dijkstra Algorithm ◽  
Positive Weight ◽  
Transportation Services ◽  
Service Companies ◽  
Transportation Service ◽  
Shortest Route ◽  
Shortest Distance ◽  
Weight Value ◽  
Main Attraction

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,

scholarly journals The Implementation Of Bellman-Ford Algorithm In Rembang Tourism Mobile Application As A Tourism Information Media

2019 ◽  
Vol 3 (1) ◽  
pp. 46-56
Author(s):  
Eko Supraptono ◽  
Arief Arfriandi ◽  
Sulus Ilhamti Rizqian
Keyword(s):  
Mobile Application ◽  
Weighted Graph ◽  
Black Box ◽  
Tourist Attraction ◽  
Tourist Attractions ◽  
Shortest Route ◽  
Shortest Distance ◽  
Information Media ◽  
Tourism Information ◽  
Graph Testing

Tourism is one of the methods to publish the beauty of nature or the uniqueness of culture in a region that spreads from the coast up to the mountains. The distribution and the access to tourist attractions require mobile application. In creating the application, Bellman – Ford algorithm was used to get the shortest route. The algorithm was the Bellman – Ford algorithm which was used to calculate the shortest distance to the tourist attraction on the weighted graph. Testing the functionality of the application used a black box. The results showed that functions on the mobile application could run well. The compatibility testing showed 100% compatibility with a number of Android devices. In addition, the usability testing showed that the application was appropriate to use with percentage by 82.7% of the 30 respondents. The "Rembang tourism" mobile application can be used by users of information about tourism.

scholarly journals SISTEM INFORMASI GEOGRAFIS MENCARI RUTE LOKASI TRAVEL DI KOTA PALANGKA RAYA BERBASIS WEBSITE

2019 ◽  
Vol 13 (1) ◽  
pp. 76-82
Author(s):  
Viktor Handrianus Pranatawijaya ◽  
Widiatry Widiatry ◽  
Nova Noor Kamala Sari ◽  
Putu Bagus Adidyana Anugrah Putra
Keyword(s):  
System Development ◽  
Weighted Graph ◽  
Geographic Information ◽  
Dijkstra Algorithm ◽  
Web Based ◽  
The Public ◽  
Location Data ◽  
Transport Services ◽  
Shortest Route ◽  
Starting Point

Transport service or usually called travel1 is an inter-city transportation that many people use in Palangkaraya to travel among the cities. However, many people do not know the location of transport services in Palangkaraya and the informations obtained is still limited. Thus a system that provides computerized geographic information is needed. This study discusses the mapping of locations of transport services, location search, location data filters and the determination of the shortest path using the Dijkstra algorithm. For system development, it will apply the waterfall method. It is expected that the availability of a web-based system as a place to provide geographic information on the location of travel services is presented using the Google map API. In this study, the testing results for determining the shortest route on the public transport route can be determined by the Dijkstra algorithm. The transportation route is considered as a directed and weighted graph; the point represents a stop, and; side is as a vehicle lane. In the testing, firstly the user  inputs the starting point on the map then looks for the destination on the destination search map, the system will display the initial shortest route output to the destination.

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

2021 ◽  
Vol 5 (2) ◽  
pp. 103
Author(s):  
Putriana Mayang Sari ◽  
Fauziah Fauziah ◽  
Aris Gunaryati
Keyword(s):  
Total Weight ◽  
Search Process ◽  
Business Sector ◽  
Dijkstra’S Algorithm ◽  
Test Results ◽  
Dijkstra Algorithm ◽  
Dijkstra's Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Route Search

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.

scholarly journals A DIJKSTRA ALGORITHM IMPLEMENTATION IN DETERMINING SHORTEST ROUTE TO MOSQUE IN RESIDENTIAL CITRA INDAH CITY

2020 ◽  
Vol 16 (1) ◽  
pp. 65-70
Author(s):  
Siti Lestari Lestari ◽  
Ardiansyah Ardiansyah ◽  
Angelina Puput Giovani ◽  
Desy Dwijayanti
Keyword(s):  
Artificial Intelligence ◽  
Problem Solving ◽  
Shortest Path ◽  
Rapid Development ◽  
Residential Area ◽  
Daily Activities ◽  
Dijkstra Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Algorithm Implementation

The application of artificial intelligence (Artificial Intelligence) for problem-solving in the field of computer science has experienced rapid development from year to year as the development of artificial intelligence itself. Problems involving searching (searching) is one example of the use of artificial intelligence that is quite popular to solve various kinds of problems. In daily activities, the use of roads is always an unavoidable activity, so determining the shortest path from one point to another becomes a problem that is often encountered. This is also felt by residents who live in a large enough housing. Sometimes to be able to reach the destination they are often confused in deciding which way to go to get the shortest distance to the destination. Citra Indah City Housing is a residential area in the Jonggol District area, Bogor Regency, developed by the Ciputra group. Within the Vignolia Hill Cluster, there is a mosque located on the northwest corner of the Vignolia Hill cluster or at the western end of the AH.17 block. A large number of blocks raise problems regarding the shortest route that can be taken by residents to get to the mosque. So, the purpose of this research is to determine the shortest path taken by citizens to get to the mosque. The method used is to apply the Djikstra algorithm which is able to produce the shortest route for residents to get to the mosque.

scholarly journals NEW OFFER FROM PT SAFARI DHARMA SAKTIENDLESS SUMMER TOUR

2018 ◽  
Vol 2 (2) ◽  
pp. 16-25
Author(s):  
Bella Christy Nathania Effendy ◽  
Anthony Sanjaya ◽  
Sonia Rest Wulandari ◽  
Katherine Meyers ◽  
Justin J. Kannalayil ◽  
...  
Keyword(s):  
Transportation Services ◽  
International Standard ◽  
Service Companies ◽  
Transportation Service ◽  
Team 10 ◽  
A Company

PT Safari Dharma Sakti is a company engaged in transportation services. Vehicles that this company has has an international standard compared to other transportation service companies. Even in terms of service, PT Safari Dharma Sakti is also sufficient. But this company only moves in local tourists only, therefore Team 10 offers to be a consultant and help it to Go International to be known not only local tourists but also from abroad. Team 10 gets a lot of information from interviews ranging from price to promotion what has been used. Our team performs with the PIC of the company that is Mr. Samuel and discuss many things. Finally our group gave suggestions to organize tours provided by the company's own team. And the company team was very agree, interested, and expect a lot of this "Endless Summer Tour" plan.

scholarly journals Dijkstra Algorithm Application: Shortest Distance between Buildings

2018 ◽  
Vol 7 (4.10) ◽  
pp. 974 ◽  
Author(s):  
G. Deepa ◽  
Priyank Kumar ◽  
A. Manimaran ◽  
K. Rajakumar ◽  
V. Krishnamoorthy
Keyword(s):  
Shortest Path ◽  
Engineering Calculation ◽  
Destination Node ◽  
Efficiency Improvement ◽  
Storage Space ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
Shortest Route ◽  
Shortest Distance ◽  
Basic Concepts

The shortest path algorithm is one of the best choices for implementation of data structures. The shortest path (SP) problem involves the problem of finding a suitable path between “two vertices or nodes in a graph” in such a way that the sum of the weights of its component edges is minimal. There are many theories for solving this problem one of the widely used way solution for solving this problem is Dijkstra’s algorithm (DA) which is also widely used in many engineering calculation works also. There are two types of DA one is the basic one and other one is optimized. This paper is focused on the basics one which provides a shortest route between source node and the destination node. Main focus has been kept on keeping the work simple and easy to understand with some basic concepts .Storage space and operational efficiency improvement has been tried to improve. 

scholarly journals Emerging Diffusion Barriers of Shared Mobility Services in Korea

2021 ◽  
Vol 13 (14) ◽  
pp. 7707
Author(s):  
Sungwon Kim ◽  
Hwansoo Lee ◽  
Seung-Woo Son
Keyword(s):  
Online News ◽  
Diffusion Barriers ◽  
Innovative Technology ◽  
Transportation Services ◽  
Service Companies ◽  
Mobility Service ◽  
Passenger Transportation ◽  
Transportation Service ◽  
Shared Mobility ◽  
Technological Barriers

Korea’s shared mobility service, TADA, has been accused of violating the Passenger Transportation Services Act, despite being an innovative transportation service. A key reason for this is that TADA is yet to discover an approach to coexist with traditional transportation service companies. The TADA case shows that in addition to technical or business matters, a variety of issues can act as new barriers to the spread of innovation. Therefore, this study aims to understand the emerging barriers that need to be addressed in adopting breakthrough technologies, particularly for shared mobility services. The purpose of this study is to show that the introduction of innovative technology encounters not only technological barriers, as suggested in previous research, but also political, industrial, and legal barriers to diffusion that hinder innovation. Therefore, this study applied the text mining method to online news big data to confirm the existence of diffusion barriers for shared mobility services. The results demonstrate that not only technical efforts but also discussions with various stakeholders and efforts to minimize industrial and legal resistance are required to effectively spread innovative services.

scholarly journals Determinants of satisfaction with campus transportation services: Implications for service quality

2016 ◽  
Vol 10 (1) ◽  
Author(s):  
Felix Charbatzadeh ◽  
Udechukwu Ojiako ◽  
Maxwell Chipulu ◽  
Alasdair Marshall
Keyword(s):  
Service Quality ◽  
Public Transportation ◽  
Critical Element ◽  
Financial Loss ◽  
Transportation Services ◽  
Transportation Service ◽  
Service Engagement ◽  
Managerial Attention ◽  
Determinants Of Satisfaction ◽  
Bus Transportation

Background: In a number of countries, buses are a critical element of public transportation, providing the most inclusive and sustainable mode of transportation to all forms of citizenry, including staff and students of universities.Objectives: The study examines the determinants of satisfaction with campus bus transportation. The article is primarily discursive and based on the synthesis of existing service literature supported by data obtained from a survey of 847 respondents.Method: Structural equation modelling is undertaken using AMOS 19, allowing for the examination of compound relationships between service engagement variables.Results: Results show statistically significant differences between perceived service quality and travel routes. The authors argue that managerial attention to service user experiences does not only hold the key to ongoing competitive success in campus transportation services but also that those services can be significantly enriched through greater managerial attention to the interface between risk of financial loss (which increases when the campus bus transportation service provider becomes less able to compete) and service quality.Conclusion: The authors argue that if providers of campus bus transportation services are to rise to their service delivery challenges and also maintain or improve upon their market positions, they must conceptualise their services in a manner that takes into consideration the two-way interrelationship between risk of financial loss and service quality. It must also be noted that, although this study may have relevance for firm–firm scenarios, its focus is primarily on service supplier firm–customer service engagements.Keywords: Modelling; Transportation; Service

T-Spanner Problem

2017 ◽  
pp. 1-21
Author(s):  
Riham Moharam ◽  
Ehab Morsy ◽  
Ismail A. Ismail
Keyword(s):  
Communication Networks ◽  
Spanning Tree ◽  
Weighted Graph ◽  
Combinatorial Optimization Problem ◽  
Stretch Factor ◽  
A Value ◽  
Shortest Distance ◽  
Distance Approximation ◽  
Maximum Stretch

The t-spanner problem is a popular combinatorial optimization problem and has different applications in communication networks and distributed systems. This chapter considers the problem of constructing a t-spanner subgraph H in a given undirected edge-weighted graph G in the sense that the distance between every pair of vertices in H is at most t times the shortest distance between the two vertices in G. The value of t, called the stretch factor, quantifies the quality of the distance approximation of the corresponding t-spanner subgraph. This chapter studies two variations of the problem, the Minimum t-Spanner Subgraph (MtSS) and the Minimum Maximum Stretch Spanning Tree(MMST). Given a value for the stretch factor t, the MtSS problem asks to find the t-spanner subgraph of the minimum total weight in G. The MMST problem looks for a tree T in G that minimizes the maximum distance between all pairs of vertices in V (i.e., minimizing the stretch factor of the constructed tree). It is easy to conclude from the literatures that the above problems are NP-hard. This chapter presents genetic algorithms that returns a high quality solution for those two problems.

scholarly journals Fraud Crime Mitigation of Mobile Application Users for Online Transportation

2018 ◽  
Vol 12 (3) ◽  
pp. 153 ◽  
Author(s):  
Amaya Andri Damaini ◽  
Ginanjar Setyo Nugroho ◽  
Suyoto Suyoto
Keyword(s):  
Mobile Application ◽  
Low Cost ◽  
Food Delivery ◽  
Ease Of Use ◽  
Transport Service ◽  
Transportation Services ◽  
Transport Services ◽  
Ride Sharing ◽  
Transportation Service ◽  
Courier Service

Online transport service is currently popular in Indonesia. Not only provide ride-sharing service, but also other services such as food delivery, medicine delivery, and courier service. Ease of use and low cost make online transportation service more favored by consumers. However, this service has several disadvantages that cause inconvenience to the user until the occurrence of fraud action by the driver or the customer. Therefore identification of system deficiencies needs to be done to improve the security and convenience of customer and drivers of online transport services. This paper will analyze the problems of online transportation services applications through cases that have occurred and complaints of users of online transport applications. Through this analysis, we propose solutions to protect consumers and drivers for the security of transactions.

Sign in / Sign up

Export Citation Format

Share Document