Font Size: a A A

The Research Of Multi-verse Optimization Algorithm And Its Application

Posted on:2018-12-15Degree:MasterType:Thesis
Country:ChinaCandidate:W PanFull Text:PDF
GTID:2348330512487089Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Multi-verse Optimization(MVO) Algorithm is a novel meta-heuristic algorithm inspired by the phenomenon of multi-verse.The algorithm has advantages such as simple structure,less parameters,easy to understand,excellent search ability.In recent years,Multi-verse optimization(MVO)algorithm has received more and more attention of domestic and foreign scholars.In this paper,aiming to overcome the drawbacks of multi-verse optimization algorithm,the algorithm was improved from aspects of the exponential function inflation size and position update strategy,etc.The purpose is to improve the whole performance of MVO algorithm,perfect its theoretical basis.In addition,we apply the improved algorithm to function optimization,travelling salesman problem and clustering analysis,broaden its range of application.The work of this paper mainly includes the following three aspects:1.Using the exponential function inflation size in order to enhance the depth of the search performance,by introducing the expansion parameters can effectively reduce the solution space,this maked the algorithm has faster search speed.At the same time;it urged the population to move closer to the optimal individual,and improved the precision of the algorithm and accelerate the convergence speed of the algorithm.2.In view of the low accuracy of traditional methods,efficiency is not high and easy to fall into local optimum in solving clustering problems.This paper adopts the way of exponential function inflation size to strengthen the local searching ability of the algorithm.The efficiency of the algorithm is also improved.These improvements enhance the clustering ability of the basic MVO.Simulation results validate that the improved MVO algorithm can improve the accuracy and efficiency of the clustering problem.3.In order to solve the problem of large number of traveling salesman problem,the traditional algorithm is slow;this paper adopts the way of exponential function inflation size based on the multiverse algorithm.In solving the traveling salesman problem,the search speed can be increased,and to modify the abnormal solution in the solving process,in order to solve the traveling salesman problem more efficiently.
Keywords/Search Tags:Multi-verse optimization algorithm, Exponential function inflation size, Function optimization, Traveling salesman problem, Cluster analysis problem, Meta-heuristic algorithm
PDF Full Text Request
Related items