Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)

DOI

10.2991/acsr.k.220202.016How to use a DOI?

Keywords

Dijkstra algorithm; Fuzzy Inference System (FIS); Shortest route; Fare; Distance; Terrain difficulty

Abstract

Ojek Online is a motorcycle taxi that is usually used by people that need a short time for traveling. It is one of the easiest forms of transportation, but there are some obstacles in hilly areas such as Semarang City. The fare produced by online motorcycle taxis is sometimes not in accordance with the distance and difficulty of the terrain. The problems in this research are as follows: (1) How to find the shortest route of Ojek Online using the Dijkstra Algorithm, (2) How are the difficulties of the terrain along the shortest routes, (3) How to determine the fare using a fuzzy inference system (FIS) where the inputs are distance and the level of difficulty of the terrain on the geographical map in Semarang City area. The Dijkstra’s Algorithm is used to assist in finding the shortest path and the Mamdani FIS is applied for fixing the fares. The results show that the Dijkstra Algorithm can find the shortest routes of ojek online from UNNES (initial node) to some destinantions in Semarang City. The result using fuzzy logic toolbox in matlab with the input of distance 5.5 km and terrain difficulty 300 m produced an output fare of 13,500 IDR. Further, the input of distance 5.5 km and the terrain difficulty of 100 m poduced an output fare of 13,100 IDR. Some routes with the same distance and different terrain heights have different fares.

Copyright

© 2022 The Authors. Published by Atlantis Press International B.V.

Open Access

This is an open access article under the CC BY-NC license.

Download article (PDF)

TY  - CONF
AU  - Vani Natali Christie Sebayang
AU  - Isnaini Rosyida
PY  - 2022
DA  - 2022/02/08
TI  - Implementations of Dijkstra Algorithm for Searching the Shortest Route of Ojek Online and a Fuzzy Inference System for Setting the Fare Based on Distance and Difficulty of Terrain (Case Study: in Semarang City, Indonesia)
BT  - Proceedings of the  International Conference on Mathematics, Geometry, Statistics, and Computation (IC-MaGeStiC 2021)
PB  - Atlantis Press
SP  - 76
EP  - 84
SN  - 2352-538X
UR  - https://doi.org/10.2991/acsr.k.220202.016
DO  - 10.2991/acsr.k.220202.016
ID  - Sebayang2022
ER  -