Skip to main content
Log in

Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abbass, H.A. (2001), Marriage in honey bees optimization: a haplometrosis polygynous swarming approach. In: Proc. of the IEEE Congress on Evolutionary Computation, pp.207–214.

  2. Abbass, H.A. and Teo, J. (2001), A true annealing approach to the marriage in honey-bees optimization algorithm. In: Proc. of the Inaugural Workshop on Artificial Life (AL’01), pp. 1–14.

  3. J. Bentley (1992) ArticleTitleFast algorithms for geometric traveling salesman problems ORSA Journal on Computing 4 IssueID4 387–411

    Google Scholar 

  4. Bertsekas, D.P. (1995), Dynamic Programming and Optimal Control, Volumes 1 and 2. Athena Scientific.

  5. Bertsekas, D.P. and Tsitsiklis, J.N. (1996), Neuro Dynamic Programming. Athena Scientific.

  6. Bonabeau, E., Dorigo, M. and Theralaz, G. (1999), Swarm Intelligence: From Natural to Artificial Systems. Oxford Press.

  7. H.S. Chang R. Givan E.K.P. Chong (2004) ArticleTitleParallel rollout for on-line solution of partially observable Markov decision processes Discrete Event Dynamic Systems: Theory and Application 14 IssueID3 309–341 Occurrence Handle10.1023/B:DISC.0000028199.78776.c4

    Article  Google Scholar 

  8. Chang H.S., Gutjahr W.J., Yang J. and Park S. (2004), An ant system based approach to Markov decision processes. In: Proc. of the American Control Conference, pp. 3820–3825

  9. H.S. Chang H-G. Lee M. Fu S.I. Marcus (2005) ArticleTitleEvolutionary policy iteration for solving Markov decision processes IEEE Trans. on Automatic Control 50 IssueID11 1804–1808 Occurrence Handle10.1109/TAC.2005.858644

    Article  Google Scholar 

  10. Corne, D., Fl Glover and Dorigo, M. (eds.) (1999), New Ideas in Optimization. McGraw-Hill.

  11. De Jong, K.A. (1975), An analysis of the behavior of a class of genetic adaptive systems. Ph.D. Thesis, Univ. of Michigan, Ann Arbor, MI.

  12. Dietz, A. (1986), Bee genetics and breeding. In: Rinderer, T. (ed.), Evolution, Academic Press, pp. 3–22

  13. M. Dorigo G. Di Caro (1999) The ant colony optimization metaheuristic D. Corne M. Dorigo (Eds) New Ideas in Optimization McGraw-Hill NY USA 11–32

    Google Scholar 

  14. Dorigo, M., Di Caro, G. and Stützle, T. (eds.) (2000), Special issue on “ant algorithms,” Future Generation Computer Systems 16(8).

  15. M. Dorigo V. Maniezzo A. Colorni (1996) ArticleTitleThe Ant System: optimization by a colony of cooperating agents IEEE Trans. Systems Man Cybernet 25 29–41

    Google Scholar 

  16. Eberhart, R.C. and Kennedy, J. (2001), Swarm Intelligence. Morgan Kaufmann

  17. W. Gutjahr (2002) ArticleTitleACO algorithms with guaranteed convergence to the optimal solution Information Processing Letters 82 145–153 Occurrence Handle10.1016/S0020-0190(01)00258-7

    Article  Google Scholar 

  18. W. Gutjahr (2003) ArticleTitleA generalized convergence result for the graph-based ant system metaheuristic Probability in the Engineering and Informational Sciences 17 545–569 Occurrence Handle10.1017/S0269964803174086

    Article  Google Scholar 

  19. Johnson, D.S. and McGeoch, L.A. (1997), The traveling salesman problem: a case study in local optimization. In: Aarts, E.H.L. and Lenstra, J.K. (eds.), Local Search in Combinatorial Optimization, John-Wiley and Sons, Ltd., pp. 215–310.

  20. L.P. Kaelbling M. Littman A. Moore (1996) ArticleTitleReinforcement learning: a survey Journal of Artificial Intelligence Research 4 237–285

    Google Scholar 

  21. S. Kirkpatrick C.D. Gelatt M.P. Vecchi (1983) ArticleTitleOptimization by simulated annealing Science 220 45–54

    Google Scholar 

  22. Littman M., Dean T. and Kaelbling L. (1995), On the complexity of solving Markov decision problems. In: Proc. 11th Annual Conf. on Uncertainty in Artificial Intelligence, pp. 394–402

  23. Pardalos, P.M. and Resende, M. (eds.) (2002), Handbook of Applied Optimization. Oxford University Press.

  24. Puterman, M.L. (1994), Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, New York.

  25. C.R. Reeves (1997) ArticleTitleGenetic algorithms for the operations researcher INFORMS Journal on Computing 9 IssueID3 231–250 Occurrence Handle10.1287/ijoc.9.3.231

    Article  Google Scholar 

  26. G. Rudolph (1994) ArticleTitleConvergence analysis of canonical genetic algorithms IEEE Transactkions on Neural Networks 5 IssueID1 96–101 Occurrence Handle10.1109/72.265964

    Article  Google Scholar 

  27. Spears, W.M. and DeJong, K.A. (1991), An analysis of multipoint crossover. In: Proc. 1990 Workshop of the Foundations of Genetic Algorithms, pp. 301–315

  28. M. Srinivas L.M. Patnaik (1994) ArticleTitleGenetic algorithms: a survey IEEE Computer 27 IssueID6 17–26

    Google Scholar 

  29. Sutton, R. and Barto, A. (2000), Reinforcement Learning. MIT Press.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyeong Soo Chang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, H.S. Converging Marriage in Honey-Bees Optimization and Application to Stochastic Dynamic Programming. J Glob Optim 35, 423–441 (2006). https://doi.org/10.1007/s10898-005-5608-4

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-5608-4

Keywords

Navigation