Research On Election-survey Algorithm And Its Application

NFL(No Free Lunch Theorems) proves that a specific optimization problem has inevitably the most corresponding optimization algorithm. Therefore, exploring new optimization algorithms will always be a work of scientific and practical value.Election-survey Algorithm is a new heuristic optimization algorithm, It simulates the motivation of election candidates to obtain the highest support ratio in campaign.This paper researchs Election-survey Algorithm and its suitable realm. This paper selects two hot and difficult issues in optimization problem-Job Shop Scheduling and robot path planning-as study objects of Election-survey Algorithm optimization application,and argues effectiveness and related characteristics about solving Job Shop Scheduling and robot path planning.Firstly ,This paper introduces the latest optimization algorithm - basic idea, implementation and characteristics of Election-survey Algorithm, and applys test function to verify Election-survey Algorithm, The computing results show that Election-survey Algorithm demonstrated outstanding performance in local excavation and global search,and is a promising optimization algorithm.Secondly, This paper researchs subjects concerning Job Shop Scheduling problems, and design an kind of Election-survey Algorithm to achieve Job Shop Scheduling, introduce a new method to express solution, and establish corresponding decoding rules to prevent illegal results; discuss the method earning fitness function. Experiment on scheduling problem MT06 had a good effect.Thirdly, basing on characteristics of mobile robot path planning, we designs a kind of Election-survey Algorithm to solve global optimal result of mobile robot path planning. This method consists of three steps: The first step is to establish free space model of mobile robot by a link graph theory, the second step is to use the Dijkstra algorithm to search out a suboptimal collision-free path in free space, the third step is to use Election-survey Algorithm to readjust and optimize location of sub-optimal path ,and then obtain the global optimal robot path. Simulation result show that this modeling method is relatively simple and can effectively find the global optimal path.Finally, the paper summaries all the work,and points out that improving convergence of Election-survey Algorithm and researching expansion of the Algorithm is further direction of exploration.