CbcHeuristicLocal.hpp

Go to the documentation of this file.

/* $Id: CbcHeuristicLocal.hpp 2467 2019-01-03 21:26:29Z unxusr $ */
// Copyright (C) 2002, International Business Machines
// Corporation and others.  All Rights Reserved.
// This code is licensed under the terms of the Eclipse Public License (EPL).

#ifndef CbcHeuristicLocal_H
#define CbcHeuristicLocal_H

#include "CbcHeuristic.hpp"
class CbcHeuristicLocal : public CbcHeuristic {
public:
  // Default Constructor
  CbcHeuristicLocal();

  /* Constructor with model - assumed before cuts
       Initial version does not do Lps
    */
  CbcHeuristicLocal(CbcModel &model);

  // Copy constructor
  CbcHeuristicLocal(const CbcHeuristicLocal &);

  // Destructor
  ~CbcHeuristicLocal();

  virtual CbcHeuristic *clone() const;

  CbcHeuristicLocal &operator=(const CbcHeuristicLocal &rhs);

  virtual void generateCpp(FILE *fp);

  virtual void resetModel(CbcModel *model);

  virtual void setModel(CbcModel *model);

  using CbcHeuristic::solution;
  virtual int solution(double &objectiveValue,
    double *newSolution);
  int solutionFix(double &objectiveValue,
    double *newSolution,
    const int *keep);

  inline void setSearchType(int value)
  {
    swap_ = value;
  }
  inline int *used() const
  {
    return used_;
  }

protected:
  // Data

  // Original matrix by column
  CoinPackedMatrix matrix_;

  // Number of solutions so we only do after new solution
  int numberSolutions_;
  // Type of search 0=normal, 1=BAB
  int swap_;
  int *used_;
};

class CbcHeuristicFPump;
class CbcHeuristicProximity : public CbcHeuristic {
public:
  // Default Constructor
  CbcHeuristicProximity();

  /* Constructor with model - assumed before cuts
    */
  CbcHeuristicProximity(CbcModel &model);

  // Copy constructor
  CbcHeuristicProximity(const CbcHeuristicProximity &);

  // Destructor
  ~CbcHeuristicProximity();

  virtual CbcHeuristic *clone() const;

  CbcHeuristicProximity &operator=(const CbcHeuristicProximity &rhs);

  virtual void generateCpp(FILE *fp);

  virtual void resetModel(CbcModel *model);

  virtual void setModel(CbcModel *model);

  using CbcHeuristic::solution;
  virtual int solution(double &objectiveValue,
    double *newSolution);
  inline void setIncrement(double value)
  {
    increment_ = value;
  }
  inline int *used() const
  {
    return used_;
  }

protected:
  // Data
  double increment_;
  CbcHeuristicFPump *feasibilityPump_;
  int numberSolutions_;
  int *used_;
};

class CbcHeuristicNaive : public CbcHeuristic {
public:
  // Default Constructor
  CbcHeuristicNaive();

  /* Constructor with model - assumed before cuts
       Initial version does not do Lps
    */
  CbcHeuristicNaive(CbcModel &model);

  // Copy constructor
  CbcHeuristicNaive(const CbcHeuristicNaive &);

  // Destructor
  ~CbcHeuristicNaive();

  virtual CbcHeuristic *clone() const;

  CbcHeuristicNaive &operator=(const CbcHeuristicNaive &rhs);

  virtual void generateCpp(FILE *fp);

  virtual void resetModel(CbcModel *model);

  virtual void setModel(CbcModel *model);

  using CbcHeuristic::solution;
  virtual int solution(double &objectiveValue,
    double *newSolution);

  inline void setLargeValue(double value)
  {
    large_ = value;
  }
  inline double largeValue() const
  {
    return large_;
  }

protected:
  double large_;
};

class CbcHeuristicCrossover : public CbcHeuristic {
public:
  // Default Constructor
  CbcHeuristicCrossover();

  /* Constructor with model - assumed before cuts
       Initial version does not do Lps
    */
  CbcHeuristicCrossover(CbcModel &model);

  // Copy constructor
  CbcHeuristicCrossover(const CbcHeuristicCrossover &);

  // Destructor
  ~CbcHeuristicCrossover();

  virtual CbcHeuristic *clone() const;

  CbcHeuristicCrossover &operator=(const CbcHeuristicCrossover &rhs);

  virtual void generateCpp(FILE *fp);

  virtual void resetModel(CbcModel *model);

  virtual void setModel(CbcModel *model);

  using CbcHeuristic::solution;
  virtual int solution(double &objectiveValue,
    double *newSolution);

  inline void setNumberSolutions(int value)
  {
    if (value > 0 && value <= 10)
      useNumber_ = value;
  }

protected:
  // Data
  std::vector< double > attempts_;
  double random_[10];
  int numberSolutions_;
  int useNumber_;
};

#endif

/* vi: softtabstop=2 shiftwidth=2 expandtab tabstop=2
*/