Title: A Novel Variable Neighborhood Search Algorithm
Abstract: General variable neighborhood search algorithm could hardly find local optimal solution for continuous optimization problems in the feasible solution space.A novel variable neighborhood search algorithm based on sequential quadratic programming(SQP) is proposed.In this algorithm,SQP is introduced to the local search of variable neighborhood search algorithm for finding local optimal solution,and then the global optimum can be found by variable neighborhood search algorithm.In addition,the initial solution and jumping processes of variable neighborhood search algorithm is improved.Simulation results show that the proposed algorithm has good convergence and accuracy,and is better than other algorithms in finding global optimal solution.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot