J4 ›› 2010, Vol. 37 ›› Issue (4): 737-742.doi: 10.3969/j.issn.1001-2400.2010.04.028

• Original Articles • Previous Articles     Next Articles

Free search algorithm with the variable neighbourhood and step

LI Tuan-jie;CAO Yu-yan;SUN Guo-ding   

  1. (School of Mechano-electronic Engineering, Xidian Univ., Xi'an  710071, China)
  • Received:2009-05-17 Online:2010-08-20 Published:2010-10-11
  • Contact: LI Tuan-jie E-mail:tjli@mail.xidian.edu.cn

Abstract:

To overcome the problem of population-based optimisation algorithms-free search (FS) to find the best solution with the low efficient later stage, especially multi-dimensional search space, FS with the variable neighbourhood and step method is proposed. The previous neighbourhood space and step do not change much in searching for the overall situation and change relatively greatly in the later stage in local exploration by the algorithm. The methods for the varying neighbourhood and step are given and simulation results with four traditional functions show that the algorithm has a better probability of finding the global optimum and mean best value, with quick convergence and high precision, especially for the multi-dimensional and multimodal function.

Key words: free search, global optimization, neighbourhood space, algorithms, search step