Heuristic Function Influence to the Global Optimum Value in Shortest Path Problem

Abstract

Determination of the optimum route is often encountered in daily life. The purpose of the optimum route itself is to find the best trajectory of the two pairs of vertices contained in a map or graph. The search algorithm applied is A*. This algorithm has the evaluation function to assist the search. The function is called heuristic. Two methods which have been introduced as a step to obtain the value of heuristic function are by using Euclidean and Manhattan distance. Both of these methods create the optimum distance in shortest path problem, but these functions gain the different results. This research performs the development of the heuristic function using Euclidean, Manhattan, Euclidean Square and the author method (Andysah).