/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ /* * Main authors: * Christian Schulte * * Copyright: * Christian Schulte, 2017 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */ #include namespace Gecode { /** * \brief Class for CHB management * * The idea is taken from: Exponential Recency Weighted Average * Branching Heuristic for SAT Solvers, Jia Hui Liang, Vijay Ganesh, * Pascal Poupart, Krzysztof Czarnecki, AAAI 2016, pages 3434-3440. * */ class CHB : public SharedHandle { protected: template class Recorder; /// View information class Info { public: /// Last failure unsigned long long int lf; /// Q-score double qs; }; /// Object for storing chb information class GECODE_VTABLE_EXPORT Storage : public SharedHandle::Object { public: /// Mutex to synchronize globally shared access GECODE_KERNEL_EXPORT static Support::Mutex m; /// Number of chb values int n; /// Number of failures unsigned long long int nf; /// Alpha value double alpha; /// CHB information Info* chb; /// Initialize CHB info template Storage(Home home, ViewArray& x, typename BranchTraits::Merit bm); /// Delete object GECODE_KERNEL_EXPORT ~Storage(void); /// Bump failure count and alpha void bump(void); /// Update chb information at position \a i void update(int i, bool failed); }; /// Return object of correct type Storage& object(void) const; /// Set object to \a o void object(Storage& o); /// Update chb value at position \a i void update(int i); /// Acquire mutex void acquire(void); /// Release mutex void release(void); /// Bump failure count and alpha void bump(void); /// Update chb information at position \a i void update(int i, bool failed); public: /// \name Constructors and initialization //@{ /** * \brief Construct as not yet intialized * * The only member functions that can be used on a constructed but not * yet initialized chb storage is init and the assignment operator. * */ CHB(void); /// Copy constructor GECODE_KERNEL_EXPORT CHB(const CHB& a); /// Assignment operator GECODE_KERNEL_EXPORT CHB& operator =(const CHB& a); /// Initialize for views \a x and Q-score as defined by \a bm template CHB(Home home, ViewArray& x, typename BranchTraits::Merit bm); /// Initialize for views \a x and Q-score as defined by \a bm template void init(Home home, ViewArray& x, typename BranchTraits::Merit bm); /// Default (empty) chb information GECODE_KERNEL_EXPORT static const CHB def; //@} /// Destructor GECODE_KERNEL_EXPORT ~CHB(void); /// \name Information access //@{ /// Return chb value at position \a i double operator [](int i) const; /// Return number of chb values int size(void) const; //@} }; /// Propagator for recording chb information template class CHB::Recorder : public NaryPropagator { protected: using NaryPropagator::x; /// Advisor with index and change information class Idx : public Advisor { protected: /// Index and mark information int _info; public: /// Constructor for creation Idx(Space& home, Propagator& p, Council& c, int i); /// Constructor for cloning \a a Idx(Space& home, Idx& a); /// Mark advisor as modified void mark(void); /// Mark advisor as unmodified void unmark(void); /// Whether advisor's view has been marked bool marked(void) const; /// Get index of view int idx(void) const; }; /// Access to chb information CHB chb; /// The advisor council Council c; /// Constructor for cloning \a p Recorder(Space& home, Recorder& p); public: /// Constructor for creation Recorder(Home home, ViewArray& x, CHB& chb); /// Copy propagator during cloning virtual Propagator* copy(Space& home); /// Cost function (record so that propagator runs last) virtual PropCost cost(const Space& home, const ModEventDelta& med) const; /// Schedule function virtual void reschedule(Space& home); /// Give advice to propagator virtual ExecStatus advise(Space& home, Advisor& a, const Delta& d); /// Give advice to propagator when \a home has failed virtual void advise(Space& home, Advisor& a); /// Perform propagation virtual ExecStatus propagate(Space& home, const ModEventDelta& med); /// Delete propagator and return its size virtual size_t dispose(Space& home); /// Post chb recorder propagator static ExecStatus post(Home home, ViewArray& x, CHB& chb); }; /** * \brief Print chb values enclosed in curly brackets * \relates CHB */ template std::basic_ostream& operator <<(std::basic_ostream& os, const CHB& a); /* * Advisor for chb recorder * */ template forceinline CHB::Recorder::Idx::Idx(Space& home, Propagator& p, Council& c, int i) : Advisor(home,p,c), _info(i << 1) {} template forceinline CHB::Recorder::Idx::Idx(Space& home, Idx& a) : Advisor(home,a), _info(a._info) { } template forceinline void CHB::Recorder::Idx::mark(void) { _info |= 1; } template forceinline bool CHB::Recorder::Idx::marked(void) const { return (_info & 1) != 0; } template forceinline void CHB::Recorder::Idx::unmark(void) { assert(marked()); _info -= 1; } template forceinline int CHB::Recorder::Idx::idx(void) const { return _info >> 1; } /* * Posting of chb recorder propagator * */ template forceinline CHB::Recorder::Recorder(Home home, ViewArray& x, CHB& chb0) : NaryPropagator(home,x), chb(chb0), c(home) { home.notice(*this,AP_DISPOSE); for (int i=0; i forceinline ExecStatus CHB::Recorder::post(Home home, ViewArray& x, CHB& chb) { (void) new (home) Recorder(home,x,chb); return ES_OK; } /* * CHB value storage * */ template forceinline CHB::Storage::Storage(Home home, ViewArray& x, typename BranchTraits::Merit bm) : n(x.size()), nf(0U), alpha(Kernel::Config::chb_alpha_init), chb(heap.alloc(x.size())) { if (bm) { for (int i=0; i Kernel::Config::chb_alpha_limit) { alpha -= Kernel::Config::chb_alpha_decrement; } } forceinline void CHB::Storage::update(int i, bool failed) { if (failed) { chb[i].lf = nf; double reward = 1.0 / (nf - chb[i].lf + 1); chb[i].qs = (1.0 - alpha) * chb[i].qs + alpha * reward; } else { double reward = 0.9 / (nf - chb[i].lf + 1); chb[i].qs = (1.0 - alpha) * chb[i].qs + alpha * reward; } } /* * CHB * */ forceinline CHB::Storage& CHB::object(void) const { return static_cast(*SharedHandle::object()); } forceinline void CHB::object(CHB::Storage& o) { SharedHandle::object(&o); } forceinline double CHB::operator [](int i) const { assert((i >= 0) && (i < object().n)); return object().chb[i].qs; } forceinline int CHB::size(void) const { return object().n; } forceinline void CHB::acquire(void) { object().m.acquire(); } forceinline void CHB::release(void) { object().m.release(); } forceinline void CHB::bump(void) { object().bump(); } forceinline void CHB::update(int i, bool failed) { object().update(i,failed); } forceinline CHB::CHB(void) {} template forceinline CHB::CHB(Home home, ViewArray& x, typename BranchTraits::Merit bm) { assert(!*this); object(*new Storage(home,x,bm)); (void) Recorder::post(home,x,*this); } template forceinline void CHB::init(Home home, ViewArray& x, typename BranchTraits::Merit bm) { assert(!*this); object(*new Storage(home,x,bm)); (void) Recorder::post(home,x,*this); } template std::basic_ostream& operator <<(std::basic_ostream& os, const CHB& chb) { std::basic_ostringstream s; s.copyfmt(os); s.width(0); s << '{'; if (chb.size() > 0) { s << chb[0]; for (int i=1; i forceinline CHB::Recorder::Recorder(Space& home, Recorder& p) : NaryPropagator(home,p), chb(p.chb) { c.update(home, p.c); } template Propagator* CHB::Recorder::copy(Space& home) { return new (home) Recorder(home, *this); } template inline size_t CHB::Recorder::dispose(Space& home) { // Delete access to chb information home.ignore(*this,AP_DISPOSE); chb.~CHB(); // Cancel remaining advisors for (Advisors as(c); as(); ++as) x[as.advisor().idx()].cancel(home,as.advisor(),true); c.dispose(home); (void) NaryPropagator::dispose(home); return sizeof(*this); } template PropCost CHB::Recorder::cost(const Space&, const ModEventDelta&) const { return PropCost::record(); } template void CHB::Recorder::reschedule(Space& home) { View::schedule(home,*this,ME_GEN_ASSIGNED); } template ExecStatus CHB::Recorder::advise(Space&, Advisor& a, const Delta&) { static_cast(a).mark(); return ES_NOFIX; } template void CHB::Recorder::advise(Space&, Advisor& a) { static_cast(a).mark(); } template ExecStatus CHB::Recorder::propagate(Space& home, const ModEventDelta&) { // Lock chb information chb.acquire(); if (home.failed()) { chb.bump(); for (Advisors as(c); as(); ++as) { int i = as.advisor().idx(); if (as.advisor().marked()) { as.advisor().unmark(); chb.update(i,true); if (x[i].assigned()) as.advisor().dispose(home,c); } } } else { for (Advisors as(c); as(); ++as) { int i = as.advisor().idx(); if (as.advisor().marked()) { as.advisor().unmark(); chb.update(i,false); if (x[i].assigned()) as.advisor().dispose(home,c); } } } chb.release(); return c.empty() ? home.ES_SUBSUMED(*this) : ES_FIX; } } // STATISTICS: kernel-branch