Total memory optimiser: proof of concept and compromises Online publication date: Mon, 06-Nov-2017
by Maurice Clerc
International Journal of Swarm Intelligence (IJSI), Vol. 3, No. 2/3, 2017
Abstract: For most usual optimisation problems, the nearer is better assumption is true (in probability). Classical iterative algorithms take this property into account, either explicitly or implicitly, by forgetting some information collected during the process, assuming it is not useful any more. However, when the property is not globally true, i.e., for deceptive problems, it may be necessary to keep all the sampled points and their values, and to exploit this increasing amount of information. Such a basic total memory optimiser is presented here. We show on an example that this technique can outperform classical methods on deceptive problems. As it gets very computing time expensive when the dimension of the problem increases, a few compromises are suggested to speed it up.
Online publication date: Mon, 06-Nov-2017
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 Swarm Intelligence (IJSI):
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 firstname.lastname@example.org