Routing problem costs may be highly dependent on the location of specific customer visits. This problem examines the case where the location of the last customer visit determines the cost coefficient of the entire route. This type of problem could represent a business need to have the last customer visit as close to the depot as possible.

The first step is to write a natural language description of the problem. The constraints and objectives for cost1.cpp are the same as for the PDP; in particular, the objective is to minimize the costs of the delivery of all the parcels. The difference in this lesson lies in the way the costs are calculated with cost coefficients. In cost1.cpp, vehicle costs are derived from a calculation based on the x-coordinate of the vehicle's last visit before returning to the depot.