Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::sat::ArcGraphNeighborhoodGenerator Class Reference

#include <cp_model_lns.h>

Inheritance diagram for operations_research::sat::ArcGraphNeighborhoodGenerator:
operations_research::sat::NeighborhoodGenerator

Public Member Functions

 ArcGraphNeighborhoodGenerator (NeighborhoodGeneratorHelper const *helper, absl::string_view name)
 
Neighborhood Generate (const CpSolverResponse &initial_solution, double difficulty, absl::BitGenRef random) final
 
- Public Member Functions inherited from operations_research::sat::NeighborhoodGenerator
 NeighborhoodGenerator (absl::string_view name, NeighborhoodGeneratorHelper const *helper)
 
virtual ~NeighborhoodGenerator ()=default
 
virtual bool ReadyToGenerate () const
 Returns true if the neighborhood generator can generate a neighborhood.
 
double GetUCBScore (int64_t total_num_calls) const
 
void AddSolveData (SolveData data)
 
double Synchronize ()
 
std::string name () const
 Returns a short description of the generator.
 
int64_t num_calls () const
 Number of times this generator was called.
 
int64_t num_fully_solved_calls () const
 Number of time the neighborhood was fully solved (OPTIMAL/INFEASIBLE).
 
int64_t num_improving_calls () const
 Out of num_calls(), how many improved the given solution.
 
int64_t num_consecutive_non_improving_calls () const
 
double difficulty () const
 The current difficulty of this generator.
 
double deterministic_limit () const
 The current time limit that the sub-solve should use on this generator.
 

Additional Inherited Members

- Protected Attributes inherited from operations_research::sat::NeighborhoodGenerator
const std::string name_
 
const NeighborhoodGeneratorHelperhelper_
 
absl::Mutex generator_mutex_
 

Detailed Description

This randomly extend a working set of variable by one variable directly connected to that set.

Definition at line 546 of file cp_model_lns.h.

Constructor & Destructor Documentation

◆ ArcGraphNeighborhoodGenerator()

operations_research::sat::ArcGraphNeighborhoodGenerator::ArcGraphNeighborhoodGenerator ( NeighborhoodGeneratorHelper const * helper,
absl::string_view name )
inlineexplicit

Definition at line 548 of file cp_model_lns.h.

Member Function Documentation

◆ Generate()

Neighborhood operations_research::sat::ArcGraphNeighborhoodGenerator::Generate ( const CpSolverResponse & initial_solution,
double difficulty,
absl::BitGenRef random )
finalvirtual
Note
even if difficulty means full neighborhood, we go through the generation process to never get out of a connected components.

We copy the full graph var <-> constraints so that we can:

  • reduce it in place
  • not hold the mutex too long.
    Todo
    (user): should we compress it or use a different representation ?

We pick a variable from the objective.

Active vars are relaxed variables with some unexplored neighbors.

We remove the variable as it is either already relaxed, or will be relaxed.

This constraint has no more un-relaxed variables.

Variable is no longer active ?

Implements operations_research::sat::NeighborhoodGenerator.

Definition at line 1405 of file cp_model_lns.cc.


The documentation for this class was generated from the following files: