A Star (A*) Algorithm Implementation to Measure Shortest Distance from Universitas Negeri Medan to Kualanamu International Airport

Dedy Kiswanto

Abstract


Searching for the shortest path is a problem that often occurs in everyday life, to determine the best distance some information is needed such as the value / cost between points to be visited. The A* (A Star) algorithm is one of the optimal algorithms in the shortest path search category. This algorithm is very good as a solution to the pathfinding process so that it can save time and money. This research was conducted to determine the shortest distance from Medan State University to Kualanamu International Airport using the A* (A Star) algorithm. The method used in this study is by collecting data using Google Maps, building a graph model as a map representation, calculating the shortest distance and evaluating it. The research results obtained show the accuracy of the A* algorithm in determining the shortest route from Medan State University to Kualanamu Airport where this can save time and money on the way.

Keywords


Algorithm A*; Medan state university; Kualanamu international Airport; Shortest path

Full Text:

PDF

References


Agustini, D., E. (2014). Projection of railway infrastructure needs to Kualanamu International Airport in nort Sumatera rovince, Jurnal Penelitian Transportasi Darat, vol 16, pp. 71-80.

Aisa, S., Aplikasi pencarian bengkel aktif dengan google maps API berbasis web, Journal of Computer and Information Technology, vol 4, pp. 61-69, 2021.

Al Hakim, R. R., Purwono, P., Arief, Y. Z., Pangestu, A., Satria, M. H., & Ariyanto, E. (2022). Implementation of dijkstra algorithm with react native to determine Covid-19 distribution. SISTEMASI, 11(1), 160-170.

AlShawi, I. S., Yan, L., Pan, W., and Luo, B. (2012). Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. IEEE Sensors journal, 12(10), 3010-3018.

Apuroop, K. G. S., Le, A. V., Elara, M. R., and Sheu, B. J. (2021). Reinforcement learning-based complete area coverage path planning for a modified hTrihex robot. Sensors, 21(4), 1067.

Budiman, V., Leksmono, Y. S. H., Agung, H., Aplikasi berbasis android untuk mencari lokasi puskemas terdekat dengan algoritma A-STAR di provinsi DKI Jakarta, Jurnal Sistem Informasi, Teknologi Informatika dan Komputer, vol. 9, pp. 39-48, September 2018.

Byrne, R. W. (1979). Memory for urban geography. The Quarterly Journal of Experimental Psychology, 31(1), 147-154.

Cui, X., and Shi, H. (2011). A*-based pathfinding in modern computer games. International Journal of Computer Science and Network Security, 11(1), 125-130.

Farisi, O. I. R., Maysyaroh, S., and Dewi, E. F. (2021). Penerapan Pewarnaan Graf pada Penjadwalan Mengajar Dosen Pendidikan Matematika Universitas Nurul Jadid. Jurnal Matematika, 11(1), 10-19.

Hanan, M. (1966). On Steiner’s problem with rectilinear distance. SIAM Journal on Applied mathematics, 14(2), 255-265.

Hamzawi, S. G. (1992). Lack of airport capacity: Exploration of alternative solutions. Transportation Research Part A: Policy and Practice, 26(1), 47-58.

Huang, B., Wu, Q., and Zhan, F. B. (2007). A shortest path algorithm with novel heuristics for dynamic transportation networks. International Journal of Geographical Information Science, 21(6), 625-644.

Lai, X., Li, J., & Chambers, J. (2021). Enhanced center constraint weighted a* algorithm for path planning of petrochemical inspection robot. Journal of Intelligent & Robotic Systems, 102, 1-15.

Mustaqov, M. A., and Megawaty, D. A. (2020). Penerapan algoritma A-Star pada aplikasi pencarian lokasi fotografi di Bandar Lampung berbasis android. Jurnal Teknoinfo, 14(1), 27-34.

Permatasari, R. C. (2017). Penerapan konsep airport mall pada bandara: Studi kasus Bandara Kuala Namu Medan Sumatera Utara. Narada, 4(3), 345-359.

Sihombing, T., Dewi, E., and Hutapea, D. (2022). Implementation of public service policy to improve the service quality of Sisingamangaraja xii international airport. The Social Perspective Journal, 1(2), 145-163.

Schmid, L., Pantic, M., Khanna, R., Ott, L., Siegwart, R., & Nieto, J. (2020). An efficient sampling-based method for online informative path planning in unknown environments. IEEE Robotics and Automation Letters, 5(2), 1500-1507.

Taufiq, M., Suyitno, A., and Dwijanto, D. (2019). Menentukan rute terpendek dengan memanfaatkan metode heuristik berbasis algoritma A. Indonesian Journal of Mathematics and Natural Sciences, 42(1), 43-51.

Yang, C., Tian, S., and Long, B. (2008). Application of heuristic graph search to test-point selection for analog fault dictionary techniques. IEEE Transactions on Instrumentation and Measurement, 58(7), 2145-2158.

Yu, J., & LaValle, S. M. (2016). Optimal multirobot path planning on graphs: Complete algorithms and effective heuristics. IEEE Transactions on Robotics, 32(5), 1163-1177.




DOI: https://doi.org/10.17509/seict.v4i1.59213

Refbacks

  • There are currently no refbacks.


Copyright (c) 2023 Journal of Software Engineering, Information and Communication Technology (SEICT)

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Journal of Software Engineering, Information and Communicaton Technology (SEICT), 
(e-ISSN:2774-1699 | p-ISSN:2744-1656) published by Program Studi Rekayasa Perangkat Lunak, Kampus UPI di Cibiru.


 Indexed by.