Bees Optimization”(MBO) for solving combinatorial optimization problems with some
modifications to formally show that MBO converges to the global optimum value. We then
adapt MBO into an algorithm called “Honey-Bees Policy Iteration”(HBPI) for solving infinite
horizon-discounted cost stochastic dynamic programming problems and show that HBPI
also converges to the optimal value.