A hybrid genetic/optimization algorithm for finite-horizon, partially observed Markov decision processes

INFORMS Journal on Computing

Volumn 16, Issue 1, 2004, Pages 27-38

  Lin, Zong Zhi ^a   Bean, James C ^b   White III, Chelsea C ^c  

^a GENERAL MOTORS CORPORATION   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c Georgia Institute of Technology   (United States)

Author keywords

Genetic algorithm; Markov decision processes; Mixed integer program; Partially observed Markov decision processes; Piecewise affine and convex

Indexed keywords

DECISION THEORY; GENETIC ALGORITHMS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; PROBABILITY; SET THEORY; VECTORS;

MARKOV DECISION PROCESSES; MIXED INTEGER PROGRAMS; PARTIALLY OBSERVED MARKOV DECISION PROCESSES; PIECEWISE AFFINE AND CONVEX;

MARKOV PROCESSES;

EID: 3843062278     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1020.0024     Document Type: Article

References (36)

1. Bean, J. C. 1994. Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6 154-160.
2. Bertsekas, D. P. 1987. Dynamic Programming: Deterministic and Stochastic Models. Prentice Hall, Englewood Cliffs, NJ.
3. Cassandra, A. R. 1998. Exact and approximate algorithms for partially observable Markov processes. Ph.D. thesis, Department of Computer Science, Brown University, Providence, RI.
4. Cassandra, A. R., L. P. Kaelbling, M. L. Littman. 1994. Acting optimally in partially observable stochastic domains. Technical report CS-94-20, Department of Computer Science, Brown University, Providence, RI.
5. Cassandra, A. R., M. L. Littman, N. L. Zhang. 1997. Incremental pruning: A simple, fast, exact algorithm for partially observable Markov decision processes. Technical report, Department of Computer Science, Brown University, Providence, RI.
6. Cheng, H-T. 1988. Algorithms for partially observable Markov decision processes. Ph.D. thesis, University of British Columbia, Vancouver, British Columbia, Canada.
7. Davidor, Y. 1991. A naturally occurring niche and species phenomenon: The model and first results. Proc. of the Fourth Internat. Conf. Genetic Algorithms. Morgan Kaufmann, San Francisco, CA.
8. De Jong, K. A. 1975. An analysis of the behavior of a class of genetic adaptive systems. Ph.D. thesis, Department of Electrical Engineering and Computer Science, The University of Michigan, Ann Arbor, MI.
9. Eagle, J. N. 1984. The optimal search for a moving target when the search path is constrained. Oper. Res. 32 1107-1115.
10. Goldberg, D. E., J. J. Richardson. 1987. Genetic algorithms with sharing for multimodal function optimization. Proc. of 2nd Internat. Conf., on Genetic Algorithms. Lawrence Erlbaum Publishers, Mahwah, NJ.
11. Gorges-Schleuter, M. 1990. Explicit parallelism of genetic algorithms through population structure. Parallel Problem Solving from Nature. Springer-Verlag, Berlin, Germany, 150-159.
12. Hadj-Alouane, A. B., J. C. Bean. 1997. A genetic algorithm for the multiple-choice integer program. Oper. Res. 45 92-101.
13. Hadj-Alouane, A. B., J. C. Bean, K. G. Murty. 1999. A hybrid genetic/optimization algorithm for a task allocation problem. J. Scheduling 2 189-201.
14. Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. The University of Michigan Press, Ann Arbor, MI.
15. Holland, J. H., 1992. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA.
16. Lark, J. W. 1989. A heuristic search approach for solving finite horizon, completely unobserved Markov decision processes. Ph.D. thesis, Department of Electrical and Computer Engineering, University of Virginia, Charlottesville, VA.
17. Lin, Z-Z. 1999. A hybrid genetic/optimization algorithm for a class of sequential decision models. Ph.D. thesis, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
18. Lin, Z-Z., J. C. Bean, C. C. White, III. 1998. Genetic algorithm heuristics for finite horizon partially observed Markov decision processes. Technical report 98-24, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
19. Littman, M. L. 1996. Algorithms for sequential decision making. Ph.D. thesis, Department of Computer Science, Brown University, Providence, RI.
20. Littman, M. L., A. R. Cassandra, L. P. Kaelbling. 1995. Efficient dynamic programming updates in partially observable Markov decision processes. Techinical report CS-95-19, Department of Computer Science, Brown University, Providence, RI.
21. Lovejoy, W. S. 1991. A survey of algorithmic methods for the partially observable Markov decision processes. Ann. Oper. Res. 28 47-66.
22. Mahfoud, S. W. 1995. Niching method for genetic algorithms. Ph.D. thesis, Department of General Engineering, University of Illinois, Urbana-Champaign, IL.
23. Monahan, G. E. 1982. A survey of partially observable Markov decision processes: Theory, models, and algorithms. Management Sci. 28 1-16.
24. Norman, B. A., J. C. Bean. 1997. A random keys genetic algorithm for job shop scheduling. Engrg. Design Automation 3 145-156.
25. Norman, B. A., J. C. Bean. 1999. A genetic algorithm methodology for complex scheduling problems. Naval Research Logistics 46 199-211.
26. Norman, B. A., J. C. Bean. 2000. Operation scheduling for parallel machine tools. IIE Transactions 32 449-459.
27. Puterman, M. L. 1994. Markov Decision Processes. John Wiley and Sons, Inc., New York.
28. Smallwood, R. D., E. J. Sondik. 1973. The optimal control of partially observable Markov decision processes over a finite horizon. Oper. Res. 21 1071-1088.
29. Sondik, E. J. 1971. The optimal control of partially observable Markov processes. Ph.D. thesis, Department of Electrical Engineering, Stanford University, Palo Alto, CA.
30. White, D. J. 1985. Real applications of Markov decision processes. Interfaces 15 7-83.
31. White, D. J. 1988. Further real applications of Markov decision processes. Interfaces 18 55-61.
32. White, D. J. 1992. Piecewise linear approximation for partially observable Markov decision processes with finite horizons. J. Inform. Optim. Sci. 13 311-324.
33. White, III, C. C. 1991. A survey of solution techniques for the partially observed Markov decision processes. Ann. Oper. Res. 32 215-230.
34. White, III, C. C., D. J. White. 1989. Markov decision processes. Eur. J. Oper. Res. 39 1-16.
35. White, III, C. C., E. C. Wilson, A. C. Weaver. 1982. Decision aid development for use in ambulatory health care settings. Oper. Res. 30 446-463.
36. Zhang, N. L., W. Liu. 1996. Planning in stochastic domains: problem characteristics and approximation. Technical report HKUST-CS96-31, Department of Computer Science, Hong Kong University of Science and Technology, Hong Kong.