![]() |
FMT 1.2.0
Forest management tools for forest planning
|
Multithreading handler running several LP heuristics in parallel and keeping the best solution. More...
#include <FMTLpHeuristicMtHandler.h>
Public Member Functions | |
| FMTLpHeuristicMtHandler () | |
| Default constructor for FMTLpHeuristicMtHandler. | |
| FMTLpHeuristicMtHandler (std::vector< FMTOperatingAreaScheduler > &lheuristics, const double &linitialsolution) | |
| Construct a FMTLpHeuristicMtHandler from operating area schedulers and an initial solution. | |
| FMTLpHeuristicMtHandler (std::vector< FMTOperatingAreaClusterer > &lheuristics, const double &linitialsolution) | |
| Construct a FMTLpHeuristicMtHandler from operating area clusterers and an initial solution. | |
| size_t | initialSolve () const |
| Solve each heuristic in parallel to find an initial solution and return the index of the best one. | |
| size_t | greedySolve (const unsigned int &iterations, const double &maxtime) const |
| Improve the solution of each heuristic in parallel with greedy passes and return the index of the best one. | |
Multithreading handler running several LP heuristics in parallel and keeping the best solution.
| Heuristics::FMTLpHeuristicMtHandler::FMTLpHeuristicMtHandler | ( | ) |
Default constructor for FMTLpHeuristicMtHandler.
| Heuristics::FMTLpHeuristicMtHandler::FMTLpHeuristicMtHandler | ( | std::vector< FMTOperatingAreaScheduler > & | lheuristics, |
| const double & | linitialsolution | ||
| ) |
Construct a FMTLpHeuristicMtHandler from operating area schedulers and an initial solution.
| [in] | lheuristics | the scheduler heuristics. |
| [in] | linitialsolution | the initial solution value. |
| Heuristics::FMTLpHeuristicMtHandler::FMTLpHeuristicMtHandler | ( | std::vector< FMTOperatingAreaClusterer > & | lheuristics, |
| const double & | linitialsolution | ||
| ) |
Construct a FMTLpHeuristicMtHandler from operating area clusterers and an initial solution.
| [in] | lheuristics | the clusterer heuristics. |
| [in] | linitialsolution | the initial solution value. |
| size_t Heuristics::FMTLpHeuristicMtHandler::greedySolve | ( | const unsigned int & | iterations, |
| const double & | maxtime | ||
| ) | const |
Improve the solution of each heuristic in parallel with greedy passes and return the index of the best one.
| [in] | iterations | the number of iterations. |
| [in] | maxtime | the maximum time. |
| size_t Heuristics::FMTLpHeuristicMtHandler::initialSolve | ( | ) | const |
Solve each heuristic in parallel to find an initial solution and return the index of the best one.