Abstract
The best choice problem is an important class of the theory of optimal stopping rules. In this article, we present the Cross-Entropy method for solving the multiple best choice problem with the minimal expected ranks of selected objects. We also compare computation results by Cross-Entropy method with results by the genetic algorithm. Computational results showed that the Cross-Entropy method is producing high-quality solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bruss, F.t., Ferguson, T.S.: Minimizing the expected rank with full information. J.Appl. Prob. 30, 616–626 (1993)
Chow, Y.S., Robbins, H., Siegmund, D.: Great Expectations: The Theory of Optimal Stopping. Houghton Mifflin, Boston (1971)
Chow, Y.S., Moriguti, S., Robbins, H., Samuels, S.M.: Optimal selection based on relative rank. Israel J.Math. 2, 81–90 (1964)
Dynkin, E.B., Yushkevich, A.A.: Theorems and Problems on Markov Processes. Plenum, New York (1969)
Gabor, C.P., Halliday, T.R.: Sequential mate choice by multiply mating smooth newts: females become more choosy. Behavioral Ecology 8, 162–166 (1997)
Gilbert, J.P., Mosteller, F.: Recognizing the maximum of sequence. J. Am. Stat. Assoc. 61, 35–73 (1966)
Cianini-Pettitt, J.: Optimal selection based on relative ranks with a random number of individuals. Adv. Appl. Prob. 11, 720–736 (1979)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston (1989)
Nikolaev, M.L.: On a generalization of the best choice problem. Theory Prob. Appl. 22, 187–190 (1977)
Nikolaev, M.L.: Optimal multi-stopping rules. Obozr. Prikl. Prom. Mat. 5, 309–348 (1998)
Pitcher, T.E., Neff, B.D., Rodd, F.H., Rowe, L.: Multiple mating and sequential mate choice in guppies: females trade up. Proceedings of the Royal Society B: Biological Sciences 270, 1623–1629 (2003)
Rubinstein, R.Y., Kroese, D.P.: The Cross-Entropy Method: A Unified Approach to Combinatorial Optimization. In: Monte-Carlo Simulation and Machine Learning. Springer, New York (2004)
Shiryaev, A.N.: Optimal Stopping Rules. Springer, New York (1978)
Sofronov, G.Y., Kroese, D.P., Keith, J.M., Nikolaev, M.L.: Simulation of thresholds in the multiple best choice problem. Obozr. Prikl. Prom. Math. 13, 975–983 (2006)
Tamaki, M.: Minimal expected ranks for the secretary problems with uncertain selection. Lecture Notes-Monograph Series, vol. 35, pp. 127–139. Institute of Mathematical Statistics (2000)
Wang, R., Okazaki, K.: Solving facility layout problem using an improved genetic algorithm. IEICE Trans. Fundam. E88–A N2, 606–610 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Polushina, T.V. (2010). Estimating Optimal Stopping Rules in the Multiple Best Choice Problem with Minimal Summarized Rank via the Cross-Entropy Method. In: Chen, Yp. (eds) Exploitation of Linkage Learning in Evolutionary Algorithms. Evolutionary Learning and Optimization, vol 3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12834-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-12834-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12833-2
Online ISBN: 978-3-642-12834-9
eBook Packages: EngineeringEngineering (R0)