FMTlpheuristic.hpp

Go to the documentation of this file.

/*
Copyright (c) 2019 Gouvernement du Québec
 
SPDX-License-Identifier: LiLiQ-R-1.1
License-Filename: LICENSES/EN/LiLiQ-R11unicode.txt
*/
 
#ifdef FMTWITHOSI
 
#ifndef FMTlpheuristic_H_INCLUDED
#define FMTlpheuristic_H_INCLUDED
 
 
#include "FMTlpsolver.hpp"
#include <random>
#include <memory>
#include <map>
#include <vector>
#include <chrono>
#include <boost/serialization/serialization.hpp>
#include <boost/serialization/nvp.hpp>
#include <boost/serialization/export.hpp>
#include "FMTsolverinterface.hpp"
 
namespace Heuristics
{
    // DocString: FMTlpheuristic
    class FMTEXPORT FMTlpheuristic : public Models::FMTlpsolver
    {
        // DocString: FMTlpheuristic::save
        friend class boost::serialization::access;
        template<class Archive>
        void save(Archive& ar, const unsigned int version) const
        {
            ar & boost::serialization::make_nvp("lpsolve", boost::serialization::base_object<FMTlpsolver>(*this));
            ar & BOOST_SERIALIZATION_NVP(seed);
            ar & BOOST_SERIALIZATION_NVP(usingsolvercopy);
        }
        // DocString: FMTlpheuristic::load
        template<class Archive>
        void load(Archive& ar, const unsigned int version)
        {
            ar & boost::serialization::make_nvp("lpsolve", boost::serialization::base_object<FMTlpsolver>(*this));
            this->passinmessagehandler(*this->_logger);
            ar & BOOST_SERIALIZATION_NVP(seed);
            this->setgeneratorseed(seed);
            ar & BOOST_SERIALIZATION_NVP(usingsolvercopy);
        }
        BOOST_SERIALIZATION_SPLIT_MEMBER()
    protected:
        // DocString: FMTlpheuristic::generator
        std::default_random_engine generator;
        // DocString: FMTlpheuristic::seed
        size_t seed;
        // DocString: FMTlpheuristic::usingsolvercopy
        bool usingsolvercopy;
    public:
        // DocString: FMTlpheuristic::setgeneratorseed
        void setgeneratorseed(const size_t& lseed);
        // DocString: FMTlpheuristic(Models::FMTlpsolver&,size_t lseed,bool copysolver)
        FMTlpheuristic(Models::FMTlpsolver& basesolve, size_t lseed = 0,bool copysolver = true);
        // DocString: FMTlpheuristic()
        FMTlpheuristic(const Models::FMTsolverinterface& interfacetype,const size_t& lseed);
        // DocString: FMTlpheuristic()
        FMTlpheuristic()=default;
        // DocString: FMTlpheuristic(const FMTlpheuristic&)
        FMTlpheuristic(const FMTlpheuristic& rhs);
        // DocString: FMTlpheuristic(const FMTlpheuristic&&)
        FMTlpheuristic(FMTlpheuristic&& rhs)=default;
        // DocString: FMTlpheuristic::operator=
        FMTlpheuristic& operator = (const FMTlpheuristic& rhs);
        // DocString: FMTlpheuristic::branchnboundsolve
        virtual bool branchnboundsolve();
        // DocString: FMTlpheuristic::greedypass
        virtual bool greedypass(const double& initsol,const unsigned int& iteration);
        virtual void paralleloptimize(const double& initbestsolution, const unsigned int& iterations,const double& maxtime, const std::chrono::steady_clock::time_point& Starttime);
        // DocString: FMTlpheuristic::isfeasible
        virtual ~FMTlpheuristic() = default;
 
    };
 
}
BOOST_CLASS_EXPORT_KEY(Heuristics::FMTlpheuristic)
#endif
#endif