Implementation of Backtracking and Steepest Ascent Hill Climbing Algorithms on Ferry Scheduling in Lake Toba

Scheduling is highly important in transportation, particularly in Ajibata port, where many limitations and conditions occur. Some of the limitations are the availability of the captain and the amount of cargo on the ship. In the ship scheduling, distance between ports is one important variable to consider in order to minimize the traveling time. To solve the problem of scheduling ships at Ajibata Port, in this study, an application was developed which applied a combination of the CSP (Constraint Satisfaction Problem) Algorithm and the Steepest Hill Climbing Algorithm. The Backtracking algorithm examined all possible solutions in the form of a solution tree based on the constraints obtained using the CSP approach. The solution tree was traced on a DFS (Depth First Search) basis to find the best solution desired. Meanwhile, the Steepest Ascent Hill Climbing Algorithm is an algorithm used to find the shortest path problem. The combination of these two algorithms give a more efficient scheduling by considering the distance between ports during the scheduling process.