Vine creeping algorithm for global optimisation

This paper presents a novel vine creeping optimisation algorithm based on the integration of the Levenberg-Marquardt algorithm into a revised non-revisiting genetic algorithm. The global search of the genetic algorithm is enhanced in efficiency and accuracy by incorporating the Levenberg-Marquardt algorithm into the selection and mutation process. The term revisit is redefined as a local region of convergence by the Levenberg-Marquardt algorithm, rather than a particular point selected. The redefinition of a revisit allows a larger step size in mutation hence reducing the number of evaluations in order to flag the current space as saturated. The effect of the revisited regions filling out the current local minimum regions and branching into unvisited space results in the vine creeping effect. The proposed algorithm was tested against three well known benchmark functions, and was able to converge upon the global optimum within an average of 63.91 generations, with a success rate ranging between 96-100%.