Simulated annealing
(Mylib/Heuristic/simulated_annealing.cpp)

• View this file on GitHub
• Last update: 2021-04-23 23:44:44+09:00

Operations

Requirements

Notes

Problems

References

Code

#pragma once
#include <cassert>
#include <chrono>
#include <cmath>

namespace haar_lib {
  template <typename Func>
  void simulated_annealing(int duration, double T0, double T1, Func f) {
    using namespace std::chrono;
    assert(T0 >= T1);

    auto s = system_clock::now();

    while (true) {
      auto t = system_clock::now();
      int d  = duration_cast<milliseconds>(t - s).count();
      if (d >= duration) break;

      double now = (double) d / duration;

      double T = std::pow(T0, 1.0 - now) * std::pow(T1, now);

      f(d, T);
    }
  }
}  // namespace haar_lib

#line 2 "Mylib/Heuristic/simulated_annealing.cpp"
#include <cassert>
#include <chrono>
#include <cmath>

namespace haar_lib {
  template <typename Func>
  void simulated_annealing(int duration, double T0, double T1, Func f) {
    using namespace std::chrono;
    assert(T0 >= T1);

    auto s = system_clock::now();

    while (true) {
      auto t = system_clock::now();
      int d  = duration_cast<milliseconds>(t - s).count();
      if (d >= duration) break;

      double now = (double) d / duration;

      double T = std::pow(T0, 1.0 - now) * std::pow(T1, now);

      f(d, T);
    }
  }
}  // namespace haar_lib

Back to top page