Converging marriage in honey-bees optimization and application to stochastic dynamic programming

In this paper, we first refine a recently proposed metaheuristic called ‘Marriage in Honey-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.