You start the solution search by creating an instance of the class IloSolver to solve the problem expressed in the model.

Add the following code after the comment //Create an instance of IloSolver

    IloSolver solver(model);

You now use the member function IloSolver::solve. In this lesson, you use the predefined goal IloGenerate as a parameter of IloSolver::solve. The predefined goal itself takes the following parameters: the environment, the array of variables cars, and IloChooseMinSizeInt. From the array of variables cars, Solver will first choose the unbound variable with the smallest domain and select a value from that domain. Solver will propagate the effects of this decision and repeat the process, moving to the variable with the next smallest domain. If a decision leads to a situation where a constraint is not satisfied, it is undone and Solver backtracks to the last decision.

Add the following code after the comment //Search for a solution

    if (solver.solve(IloGenerate(env, cars, IloChooseMinSizeInt)))

The following code is provided for you:

      {
      solver.out() << solver.getStatus() << " Solution" << endl;
      for (i = 0; i < nbCars; i++) {
        solver.out() << "Car " << i+1 <<  " color:     "
                     << Names[(IloInt)solver.getValue(cars[i])]     
                     << endl;
      }
    }
    else
      solver.out() << "No solution " << endl;
      solver.printInformation();

Compile and run the program. You should get the following results, though the information displayed by IloSolver::printInformation will vary depending on platform, machine, configuration, and so on.

Feasible Solution
Car 1 color:     yellow
Car 2 color:     green
Car 3 color:     green
Car 4 color:     green
Car 5 color:     yellow
Car 6 color:     yellow
Car 7 color:     blue
Car 8 color:     blue
Number of fails               : 0
Number of choice points       : 6
Number of variables           : 12
Number of constraints         : 2
Reversible stack (bytes)      : 4044
Solver heap (bytes)           : 8064
Solver global heap (bytes)    : 4044
And stack (bytes)             : 4044
Or stack (bytes)              : 4044
Search Stack (bytes)          : 4044
Constraint queue (bytes)      : 11152
Total memory used (bytes)     : 39436
Elapsed time since creation   : 0.17