Does CP_SAT can be used to solve VRP

[menouarazib]

Hi,

I'm little bit confused by the following documentation regarding if we can use CP_SAT to solve VRP:

 OptionalBoolean use_cp = 28;
  // If true, use the CP-SAT solver to find a solution. If use_cp is also true,
  // the CP-SAT solver will be run after the CP solver if there is time
  // remaining and will use the CP solution as a hint for the CP-SAT search.
  // As of 5/2019, only TSP models can be solved.
  OptionalBoolean use_cp_sat = 27;
  // If true, use the CP-SAT solver to find a solution on generalized routing
  // model. If use_cp is also true, the CP-SAT solver will be run after the CP
  // solver if there is time remaining and will use the CP solution as a hint
  // for the CP-SAT search.
  OptionalBoolean use_generalized_cp_sat = 47;
  // If use_cp_sat or use_generalized_cp_sat is true, contains the SAT algorithm
  // parameters which will be used.

[lperron]

yes, but is does not support custom constraints, nor all the things you can express with the routing library.