new RandomNeighborhood(solver, objects, 200, 123456L), true));
SearchMonitorFactory.limitThreadTime(solver, 2000);
break;
case 2:
solver.getSearchLoop().plugSearchMonitor(new LargeNeighborhoodSearch(solver,
new PropagationGuidedNeighborhood(solver, objects, 123456L, 100, 10), true));
SearchMonitorFactory.limitThreadTime(solver, 2000);
break;
case 3:
solver.getSearchLoop().plugSearchMonitor(new LargeNeighborhoodSearch(solver,
new SequenceNeighborhood(
new PropagationGuidedNeighborhood(solver, objects, 123456L, 100, 10),
new ReversePropagationGuidedNeighborhood(solver, objects, 123456L, 100, 10)
), true));
SearchMonitorFactory.limitThreadTime(solver, 2000);
break;
case 4:
solver.getSearchLoop().plugSearchMonitor(new LargeNeighborhoodSearch(solver,
new SequenceNeighborhood(
new PropagationGuidedNeighborhood(solver, objects, 123456L, 100, 10),
new ReversePropagationGuidedNeighborhood(solver, objects, 123456L, 100, 10),
new RandomNeighborhood(solver, objects, 200, 123456L)
), true));
SearchMonitorFactory.limitThreadTime(solver, 2000);
break;