The Effectiveness of Forward-Backward Combination Method in Dynamic Programming

Abstract

Determining the shortest path with efficient results is important to achieve the minimum distance and time to arrive at the destination. The problem is that the shortest path algorithm can provide a solution. Among the shortest paths, dynamic programming (DP) is one of the algorithms that can provide the best solution for this problem. Several previous studies only used forward or backward models to provide solutions. Combining forward and backward models can be applied to problems that have search motion criteria. In this paper, we propose a combination of the forward-backward DP model and compare it with the forward and backward models to find parking spaces and measure time efficiency. The forward-backward combination model provides the most effective solution with efficient time consumption.