Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms》.pdf

Computers Operations Research 63 (2015) 114–124 Contents lists available at ScienceDirect Computers Operations Research journal homepage: /locate/caor Probabilistic properties of fitness-based quasi-reflection in evolutionary algorithms M. Ergezer n, D. Simon Cleveland State University, Department of Electrical and Computer Engineering 2121 Euclid Avenue, FH 332 Cleveland, OH, USA a r t i c l e i n f o a b s t r a c t Available online 30 March 2015 Evolutionary algorithms (EAs) excel in optimizing systems with a large number of variables. Previous Keywords: mathematical and empirical studies have shown that opposition-based algorithms can improve EA Evolutionary algorithms performance. We review existing opposition-based algorithms and introduce a new one. The proposed Continuous optimization algorithm is named fitness-based quasi-reflection and employs the relative fitness of solution candidates Opposition to generate new individuals. We provide the probabilistic analysis to prove that among all the Fitness-based quasi-reflection opposition-based methods that we investigate, fitness-based quasi-reflection has the highest probability of being closer to the solution of an optimization problem. We support our theoretical findings via Monte Carlo simulations and discuss the use of different reflection weights. We also demonstrate the benefits of