An opposition-based algorithm for function optimization
We introduce a comprehensive opposition (CO). We propose an optimization algorithm (OBA) that employs CO as its main operator. We use probability rules to analyze the effect of CO on the optimization performance. OBA converges with probability one to a global optimum.
opposition-based algorithm comprehensive opposition metaheuristic parametric programming global convergence markov chain