Solve

INDEX PREVIOUS NEXT

You search for a solution using the two-phase approach shown in Solving a Vehicle Routing Problem. The only difference is that you use the swap neighborhoods you created from the visit pairs. You also dynamically modify the solution by adding and removing a visit from an existing routing plan.

As in Solving a Vehicle Routing Problem, you create the RoutingSolver class, which is used to solve the vehicle routing problem.