Pure Strategy or Mixed Strategy?

Jun He; Feidun He; Hongbin Dong

doi:10.1007/978-3-642-29124-1_19

Pure Strategy or Mixed Strategy?

Jun He, Feidun He, Hongbin Dong

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Other chapter contribution

19 Citations (Scopus)

Abstract

Mixed strategy evolutionary algorithms (EAs) aim at integrating several mutation operators into a single algorithm. However no analysis has been made to answer the theoretical question: whether and when is the performance of mixed strategy EAs better than that of pure strategy EAs? In this paper, asymptotic convergence rate and asymptotic hitting time are proposed to measure the performance of EAs. It is proven that the asymptotic convergence rate and asymptotic hitting time of any mixed strategy (1+1) EA consisting of several mutation operators is not worse than that of the worst pure strategy (1+1) EA using only one mutation operator. Furthermore it is proven that if these mutation operators are mutually complementary, then it is possible to design a mixed strategy (1+1) EA whose performance is better than that of any pure strategy (1+1) EA using only one mutation operator.

Original language	English
Title of host publication	Evolutionary Computation in Combinatorial Optimization
Subtitle of host publication	12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings
Editors	Jin-Kao Hao, Martin Middendorf
Publisher	Springer Nature
Pages	218-229
Volume	7245
ISBN (Electronic)	978-3-642-29124-1
ISBN (Print)	978-3-642-29123-4, 3642291236
DOIs	https://doi.org/10.1007/978-3-642-29124-1_19
Publication status	Published - 28 Mar 2012

Publication series

Name	Evolutionary Computation in Combinatorial Optimization
Volume	7245
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-642-29124-1_19

http://link.springer.com/10.1007/978-3-642-29124-1_19

Permanent link

Persistent link

Cite this

He, J., He, F., & Dong, H. (2012). Pure Strategy or Mixed Strategy? In J.-K. Hao, & M. Middendorf (Eds.), Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings (Vol. 7245, pp. 218-229). Article Chapter 19 (Evolutionary Computation in Combinatorial Optimization; Vol. 7245). Springer Nature. https://doi.org/10.1007/978-3-642-29124-1_19

@inbook{3f5c90a1551e4cef9d36aa4b6700e36b,

title = "Pure Strategy or Mixed Strategy?",

abstract = "Mixed strategy evolutionary algorithms (EAs) aim at integrating several mutation operators into a single algorithm. However no analysis has been made to answer the theoretical question: whether and when is the performance of mixed strategy EAs better than that of pure strategy EAs? In this paper, asymptotic convergence rate and asymptotic hitting time are proposed to measure the performance of EAs. It is proven that the asymptotic convergence rate and asymptotic hitting time of any mixed strategy (1+1) EA consisting of several mutation operators is not worse than that of the worst pure strategy (1+1) EA using only one mutation operator. Furthermore it is proven that if these mutation operators are mutually complementary, then it is possible to design a mixed strategy (1+1) EA whose performance is better than that of any pure strategy (1+1) EA using only one mutation operator.",

author = "Jun He and Feidun He and Hongbin Dong",

note = "Sponsorship: EPSRC RONO: EP/I009809/1",

year = "2012",

month = mar,

day = "28",

doi = "10.1007/978-3-642-29124-1_19",

language = "English",

isbn = "978-3-642-29123-4",

volume = "7245",

series = "Evolutionary Computation in Combinatorial Optimization",

publisher = "Springer Nature",

pages = "218--229",

editor = "Jin-Kao Hao and Martin Middendorf",

booktitle = "Evolutionary Computation in Combinatorial Optimization",

address = "Switzerland",

}

He, J, He, F & Dong, H 2012, Pure Strategy or Mixed Strategy? in J-K Hao & M Middendorf (eds), Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. vol. 7245, Chapter 19, Evolutionary Computation in Combinatorial Optimization, vol. 7245, Springer Nature, pp. 218-229. https://doi.org/10.1007/978-3-642-29124-1_19

Pure Strategy or Mixed Strategy? / He, Jun; He, Feidun; Dong, Hongbin.
Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11-13, 2012. Proceedings. ed. / Jin-Kao Hao; Martin Middendorf. Vol. 7245 Springer Nature, 2012. p. 218-229 Chapter 19 (Evolutionary Computation in Combinatorial Optimization; Vol. 7245).

Research output: Chapter in Book/Report/Conference proceeding › Other chapter contribution