Heuristic Algorithms

In this chapter, we will explore three commonly used heuristic algorithms including the Depth-First Search (DFS), Breath-First Search (BFS) and Dijkstra’s Algorithm (DA) to solve the Shortest Path Problem. We will look at two case studies, a nurse scheduling problem and a beer distribution problem to understand how each case study applied heuristic algorithms to obtain good feasible solutions for their respective problems.