Performance of A Star with Dynamic Programming Algorithms in Determining the Shortest Route

Henny Yusnita, Muhammad Zarlis, Sawaluddin

Abstract

A Star's algorithms tend to perform better when combined with heuristics. By implementing the heuristic function-based Best First Search (BFS) search mechanism, the system will find the shortest path from the origin to the destination nodes. In the Dynamic Programming algorithm, the search for the shortest route was based on interconnected stages by loading the route to be searched. In this study, a combination of the A Star algorithm and Dynamic Programming methods was used. Testing of A Star Algorithm with Dynamic Programming in the search for the shortest route from Pasar Petisah to Pasar Lau Cih was chosen. The results of the study found that the A Star - Dynamic Programming algorithm produced the shortest distance of 14.12 Km.

Download


Paper Citation


in Harvard Style

Yusnita H., Zarlis M. and Sawaluddin. (2020). Performance of A Star with Dynamic Programming Algorithms in Determining the Shortest Route.In Proceedings of the International Conference on Culture Heritage, Education, Sustainable Tourism, and Innovation Technologies - Volume 1: CESIT, ISBN 978-989-758-501-2, pages 536-542. DOI: 10.5220/0010335705360542


in Bibtex Style

@conference{cesit20,
author={Henny Yusnita and Muhammad Zarlis and Sawaluddin},
title={Performance of A Star with Dynamic Programming Algorithms in Determining the Shortest Route},
booktitle={Proceedings of the International Conference on Culture Heritage, Education, Sustainable Tourism, and Innovation Technologies - Volume 1: CESIT,},
year={2020},
pages={536-542},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010335705360542},
isbn={978-989-758-501-2},
}


in EndNote Style

TY - CONF

JO - Proceedings of the International Conference on Culture Heritage, Education, Sustainable Tourism, and Innovation Technologies - Volume 1: CESIT,
TI - Performance of A Star with Dynamic Programming Algorithms in Determining the Shortest Route
SN - 978-989-758-501-2
AU - Yusnita H.
AU - Zarlis M.
AU - Sawaluddin.
PY - 2020
SP - 536
EP - 542
DO - 10.5220/0010335705360542