TAF PUBLISHING

Mean-Variance Mapping Optimization (MVMO) is the newest class of the modern meta-heuristic algorithms. The original version of this algorithm is suitable for continuous search problems, so can’t apply it directly to discrete search problems. In this paper, the binary version of the MVMO (BMVMO) algorithm proposed. The proposed Binary Mean-Variance Mapping Optimization algorithm compare with well-known binary meta-heuristic optimization algorithms such, Binary genetic Algorithm, Binary Particles Swarm Optimization, and Binary Bat Algorithm over fifteen benchmark functions conducted to draw a conclusion. The numeric experiments result proves that BMVMO is better performance