Exercise 1.17 Objective function for the vehicle routing problem. For the ve- hicle routing problem, a solution s may be represented by the assignment of the customers to the vehicles. A neighborhood may be defined as the move of one cus- tomer from one vehicle to another. Show that computing the incremental objective function consisting in minimizing the total distance is a difficult procedure