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

Journal of Global Optimization

Volumn 35, Issue 3, 2006, Pages 423-441

  Chang, Hyeong Soo ^a  

^a Sogang University   (South Korea)

Author keywords

Honey bees optimization; Markov decision process; Policy iteration; Stochastic dynamic programming; Swarm intelligence

Indexed keywords

ALGORITHMIC LANGUAGES; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; ITERATIVE METHODS; MARKOV PROCESSES; OPTIMIZATION; PROBLEM SOLVING; STOCHASTIC CONTROL SYSTEMS;

HONEY-BEES OPTIMIZATION; MARKOV DECISION PROCESS; POLICY ITERATION; STOCHASTIC DYNAMIC PROGRAMMING; SWARM INTELLIGENCE;

DYNAMIC PROGRAMMING;

EID: 33745930807     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-005-5608-4     Document Type: Article

References (29)

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 honeybees optimization algorithm. In: Proc. of the Inaugural Workshop on Artificial Life (AL'01), pp. 1-14.
3. Bentley, J. (1992), Fast algorithms for geometric traveling salesman problems, ORSA Journal on Computing 4(4), 387-411.
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. Chang, H.S., Givan, R. and Chong, E.K.P. (2004), Parallel rollout for on-line solution of partially observable Markov decision processes, Discrete Event Dynamic Systems: Theory and Application 14(3), 309-341.
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. Chang, H.S., Lee, H-G., Fu, M. and Marcus, S.I. (2005), Evolutionary policy iteration for solving Markov decision processes, IEEE Trans. on Automatic Control 50(11), 1804-1808.
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. Dorigo, M. and Di Caro, G. (1999), The ant colony optimization metaheuristic. In: Corne, D. and Dorigo, M. (eds.), New Ideas in Optimization, McGraw-Hill, NY, USA, pp. 11-32.
14. Dorigo, M., Di Caro, G. and Stützle, T. (eds.) (2000), Special issue on "ant algorithms," Future Generation Computer Systems 16(8).
15. Dorigo, M., Maniezzo, V. and Colorni, A. (1996), The Ant System: optimization by a colony of cooperating agents, IEEE Trans. Systems Man Cybernet 25, 29-41.
16. Eberhart, R.C. and Kennedy, J. (2001), Swarm Intelligence. Morgan Kaufmann.
17. Gutjahr, W (2002), ACO algorithms with guaranteed convergence to the optimal solution, Information Processing Letters 82, 145-153.
18. Gutjahr, W. (2003), A generalized convergence result for the graph-based ant system metaheuristic, Probability in the Engineering and Informational Sciences 17, 545-569.
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. Kaelbling, L.P., Littman, M. and Moore, A. (1996), Reinforcement learning: a survey, Journal of Artificial Intelligence Research 4, 237-285.
21. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983), Optimization by simulated annealing, Science 220, 45-54.
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. Reeves, C.R. (1997), Genetic algorithms for the operations researcher, INFORMS Journal on Computing 9(3), 231-250.
26. Rudolph, G. (1994), Convergence analysis of canonical genetic algorithms, IEEE Transactkions on Neural Networks 5(1), 96-101.
27. Spears, WM. and DeJong, K.A. (1991), An analysis of multipoint crossover. In: Proc. 1990 Workshop of the Foundations of Genetic. Algorithms, pp. 301-315.
28. Srinivas, M. and Patnaik, L.M. (1994), Genetic algorithms: a survey, IEEE Computer 27(6), 17-26.
29. Sutton, R. and Barto, A. (2000), Reinforcement Learning. MIT Press.