I would like to solve a Vehicle Routing Problem (VRP) variant with Branch-and-Price using CPLEX and OPL. With the VRP variant, the number of vehicles should be minimized. Each customer must be visited and his demand be satisfied. Each vehicle has the same capacity to satisfy customer demand. Distances do not have to be taken into account.