Population-based variable neighbourhood search algorithm applied to unconstrained continuous optimisation Online publication date: Tue, 17-Apr-2018
by Wesklei Migliorini; Rafael Stubs Parpinelli
International Journal of Bio-Inspired Computation (IJBIC), Vol. 11, No. 2, 2018
Abstract: This work presents a population-based variable neighbourhood search approach for unconstrained continuous optimisation, called PRVNS. The main contributions of the proposed algorithm are to evolve a population of individuals (i.e., candidate solutions) and to allow each individual adapts its own neighbourhood search area accordingly to its performance. The adaptive amplitude control allows individuals to autonomously exploit and explore promising regions in the search space. Several unconstrained continuous benchmark functions with a high number of dimensions (d = 250) are used to evaluate the algorithm's performance. The PRVNS results are compared with the results obtained by some well known population-based approaches: differential evolution (DE), particle swarm optimisation (PSO) and artificial bee colony (ABC). Also, the standard VNS algorithm is considered in the experiments. The results and analyses suggest that the PRVNS approach is a promising and competitive algorithm for unconstrained continuous optimisation.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook