Verify Election Campaign Optimization Algorithm by Several Optimization Problems

Election Campaign Optimization Algorithm is a novel heuristic optimization algorithm, which simulates the motivation of election candidates to the highest support in campaign. This algorithm is easy to understand and optimize performance is good. This algorithm also can achieve optimal value in the global convergence, thought the MATLAB numberical experiments show that good results. Get the optimum value of problems is the target which people pursue. The study of optimization algorithm is always a hotspot of optimal design theory research. Many kinds of optimization problems, both in academic research and application technology, can generalize constrained optimization problems. More and more scholars are engaged in applied research of various heuristic algorithm on constrained optimization because of the shortcoming of classic algorithm. In this paper, several functions of optimization problems are used to verify this algorithm.