In this lesson, you will learn how to:
-
minimize the number of vehicles in a routing problem
-
create a road network graph and compute shortest paths
-
use the classes and functions
IloDispatcherGraph, IloGraphDistance, IloMakePerformed, IloMakeUnperformed, IloSwapPerform, IloRoutingSolution::RouteIterator, IloRoutingSolution::getRouteSize, and IloVisit::setPenaltyCost
You will learn how to solve a vehicle routing problem (VRP) where the main objective is to reduce the number of vehicles. Dispatcher's graph functionality is also introduced in this lesson. You will learn how to create a graph representing a road network and to compute the shortest paths between visits from this graph. The graph functionality can be used to compute distance and time dimensions in any routing problem. Conversely, you could also use Euclidean, Manhattan, or another type of distance computation for the problem in this lesson.
PREVIOUS
NEXT