In many routing problems, good solutions must be computed very quickly. However, the computational complexity of routing in general makes it impractical to use complete search methods to obtain optimal solutions except for very small problems.

Therefore, Dispatcher uses a two-phase approach for solving routing problems. The first phase consists of generating a solution that satisfies the problem. In phase two, you improve this first solution using local search.

You will use object oriented programming techniques to write this program. In the previous lesson, you created the RoutingModel class, which is used to model the problem. In this lesson, you create the RoutingSolver class, which is used to solve the problem. You will also create the main function and compile and run the program.